Contribute / bring your own questions

Protocols get better
when people hack on them.

Read a little. Run something small. Tell us what you find.

Choose a starting point

01 / Website & explanations

ledgerloops.com ↗

Plain HTML, the historical browser demo, diagrams, and the whitepaper source. Improve an explanation, check an example, or make the research easier to follow.

02 / Search & benchmarks

strategy-pit ↗

Explore detection strategies, the Sarafu-based netting challenge, and the notes on loop detection and lift resolution.

03 / Peer-to-peer prototype

jerboa ↗

Follow the prototype introduced in October 2024. Read its current documentation for setup, assumptions, and the state of the implementation.

04 / Local-node implementation

ledgerloops ↗

The current README describes a TypeScript/Deno node with loop detection, greedy lift negotiation, and cooperative resolution. It supports interactions between local nodes; the historical demo also links here.

05 / Another search experiment

jaribu ↗

A June 2025 exploration of peer-to-peer cycle detection through depth-first-search messaging. Work in progress, with a pnpm-based development workflow.

06 / Synchronizing ledgers

braided-snap ↗

A small SNAP experiment using Braid, with a server for each participant and a ledger made of transaction lists. Another part of the project’s work on keeping peers in sync.

Start with the website

This repository is a collection of static files. With Git and Python 3 installed:

git clone https://github.com/ledgerloops/ledgerloops.com.git
cd ledgerloops.com
python3 -m http.server 8000 --bind 127.0.0.1

Open the local server on port 8000 in your browser. No package install or build step is required for these pages.

Implement your own ideas

Read the protocol overview, the historical whitepaper, and the Decentralized Cycle Detection Internet-Draft. Check which version and assumptions your implementation follows.

The project has described its design as patent-free and published under CC BY-SA 3.0. Check each repository’s own license before reusing its code; the website’s statement does not establish the license of every implementation.

A useful contribution can be small

A reproducible failure. A diagram that makes the protocol click. A comparison against another algorithm. A careful account of what did—and didn’t—work.

Open an issue in the relevant repository, or get in touch if you’re exploring an experiment with your community.