CRYPTOGRAPHY / MATHEMATICS
POINT/3
A sequence of small reconstruction experiments, from repetition codes to authenticated recursive fragments.
- Current state
- Research prototype
- Discipline
- Cryptography · Mathematics
- Built with
- C / OpenSSL / HMAC-SHA256 / Orange / Cryptol
The idea
POINT/3 separates recovery from integrity. Its early repetition-code experiments show the limits of majority decoding; POINT/3-W explores a recursive two-of-three reconstruction topology in which a recovered value must also satisfy a path-bound authenticator.
How it works
Small C and Orange examples implement repetition and affine scattering. The later C/OpenSSL prototype combines an object, an HMAC tag and their XOR at each node. A Cryptol executable specification describes a depth-four, 81-leaf tree and its round-trip and branch-loss properties.
What’s implemented
- Three-way repetition and affine-scatter demonstrations
- Recursive authenticated two-of-three reconstruction for a 128-bit object
- Presence masks for modeling erased terminal fragments
- A depth-four Cryptol specification with round-trip and branch-loss checks
PROJECT STATUS / RESEARCH PROTOTYPE
Where it stands
Small reconstruction research prototype
- Experimental reference code with a narrow object/key interface
- Affine scattering changes locality rather than coding distance
- The repository's executable checks are not an independent security review or a production storage-system claim
Source & resources
Documentation behind this project page
Reviewed October 1, 2026. Project descriptions reflect a source review; repository validation claims were not independently reproduced.