Golay constraint structure
The [24,12,8] extended binary Golay code enforces valid flip patterns and corrects up to 3 errors.
Post-quantum. Lattice-hard. Self-inverse.
Cryptography from geometry.
Compact, self-inverse, and verified against post-quantum attack models.
192 Bciphertexts
388 Bsecret keys
100%decryption correctness
MITlicense
Built from mathematical structure
Every foundational claim is backed by exact-computation verification scripts.
Leech lattice substrate
The unique 24-dimensional even unimodular lattice with 196,560 minimal vectors provides the geometric hardness.
Conway automorphisms
Sign-change automorphisms indexed by Golay codewords embed the monomial subgroup 2^12.M24 in Co0.
Verified by computation
All mathematical foundations — Golay weight distribution, Leech minimal vectors, KEM correctness — are computationally verified.
Install in seconds
Install RCLP in a Python virtual environment and run the verification suite.
git clone https://github.com/LumenHelixLab/RCLP.git cd RCLP python3 -m venv .venv .venv/bin/pip install -r requirements.txt .venv/bin/pip install -e . .venv/bin/python -m pytest tests/
Tested on Windows 11, macOS Sonoma, Ubuntu 22.04/24.04, and modern mobile browsers.
How it works
A geometric KEM built from code, lattice, and surface constraints.
Golay Code -> Valid Flip Pattern -> Leech Lattice Vector -> Two-Sided Surface -> RCLP-KEM Ciphertext
^ |
└─────────────── Babai + Nearest-Codeword Decoder ───────────────────────────┘Documentation
Everything you need to run, extend, and deploy RCLP.