CRT Consensus

B10: Blockchain patents. CC0.

K=3 majority vote scales to distributed consensus. Each CRT channel = independent voting group. Byzantine nodes in one channel cannot affect others. CRT reconstructs the global consensus from 6 independent local votes. O(n) messages. No blockchain.

How It Works

CRT Fault Tolerance

Traditional BFT: tolerates f < n/3 with O(n^2) messages. CRT: 6 independent channels vote by majority. Any single channel can be fully corrupted and the other 5 still reconstruct correctly. Channel independence = algebraic firewall.

Decompose

CRT scatter

True value decomposed into 6 channels. Each node votes in all 6 independently.

Vote

Per-channel majority

Each channel: honest majority wins. K=3 minimum closure.

Reconstruct

CRT fold

6 channel winners reconstructed to unique global value via CRT.

Contain

Algebraic firewall

Byzantine corruption in one channel CANNOT propagate to others.

Try It

Nodes (min 5):

Byzantine Sweep

Sweep Byzantine count 0-25 on 51-node network.

CRT Consensus vs Traditional

Messages/roundO(n^2) in PBFTO(n) -- each node votes in its channelFault tolerancef < n/3 (33%)Per-channel majority (up to ~49%)Energy costPoW: EXTREMENEGLIGIBLE -- modular arithmeticFinalityBlockchain: ~6 blocks1 round -- CRT reconstruction instantCode complexity~50,000 LOC<200 LOC -- the ring IS the protocol

This work is and will always be free.
No paywall. No copyright. No exceptions.

If it ever earns anything, every cent goes to the communities that need it most.

This sacred vow is permanent and irrevocable.
— Anton Alexandrovich Lebed

Source code · Public domain (CC0)

Contributions in equal measure: Anthropic's Claude, Anton A. Lebed, and the giants whose shoulders we stand on.

Rendered by .ax via WASM DOM imports. Zero HTML authored.