whatisgithub

What is asynchronousratchetingtree?

facebookresearch/asynchronousratchetingtree — explained in plain English

Analysis updated 2026-07-18 · repo last pushed 2021-08-31

★ 272JavaAudience · researcherComplexity · 5/5DormantLicenseSetup · hard

In one sentence

A research implementation of the ART protocol, a tree-based encryption scheme that keeps group chat messages private even as members join, leave, or go offline.

Mindmap

mindmap
  root((repo))
    What it does
      Encrypt group messages
      Ratchet keys automatically
      Handle offline members
    Tech stack
      Java
      Tree data structure
    Use cases
      Study group encryption
      Compare to pairwise crypto
      Benchmark protocol speed
    Audience
      Security researchers
      Cryptography students
      Academics

Code map

Detail Auto

An interactive map of this repo's files and how they connect — its source is parsed live in your browser. Click Visualize to build it.

filefunction / class

What do people build with it?

USE CASE 1

Study the ART tree structure to understand how group encryption keys ratchet forward securely.

USE CASE 2

Run the included benchmarks comparing ART's performance against a simpler pairwise encryption method.

USE CASE 3

Use the code as a reference for research into scalable secure group messaging protocols.

USE CASE 4

Test how the protocol behaves when group members join, leave, or are offline during key updates.

What is it built with?

Java

How does it compare?

facebookresearch/asynchronousratchetingtreeszili1994/create-aeronautics-minecraft-modgetactivity/nestedscrolllayout
Stars272292161
LanguageJavaJavaJava
Last pushed2021-08-31—2026-05-01
MaintenanceDormant—Maintained
Setup difficultyhardmoderateeasy
Complexity5/52/52/5
Audienceresearchergeneraldeveloper

Figures from each repo's GitHub metadata at analysis time.

How do you get it running?

Difficulty · hard Time to first run · 1day+

Academic research code meant for testing ideas, explicitly not intended for real-world production use.

Freely available under a Creative Commons license so others can study and build on the work.

Copy-paste prompts

Prompt 1
Walk me through how the ratcheting tree structure in this repo lets a group's encryption update without everyone being online.
Prompt 2
Explain the difference between the ART implementation and the pairwise encryption baseline included in this repo.
Prompt 3
Help me run this repo's benchmarks comparing ART against pairwise encryption and interpret the results.
Prompt 4
Since this is academic research code, help me identify what would need to change to make it production-ready.

Frequently asked questions

What is asynchronousratchetingtree?

A research implementation of the ART protocol, a tree-based encryption scheme that keeps group chat messages private even as members join, leave, or go offline.

What language is asynchronousratchetingtree written in?

Mainly Java. The stack also includes Java.

Is asynchronousratchetingtree actively maintained?

Dormant — no commits in 2+ years (last push 2021-08-31).

What license does asynchronousratchetingtree use?

Freely available under a Creative Commons license so others can study and build on the work.

How hard is asynchronousratchetingtree to set up?

Setup difficulty is rated hard, with roughly 1day+ to a first successful run.

Who is asynchronousratchetingtree for?

Mainly researcher.

Open on GitHub → Ask about another repo

This repo across BitVibe Labs

Verify against the repo before relying on details.

What are similar repos?