Expand description
fast-certs: a tiny library exposing two publicly verifiable certificates:
- Merkle membership proofs (hash-based).
- Freivalds certificate (algebraic) for A * B = C with Fiat–Shamir randomness.
Merkle notes:
- Uses BLAKE3 with simple domain separation for leaves vs internal nodes.
- Proof = O(log n) sibling hashes + directions.
Freivalds notes:
- All randomness is derived via Fiat–Shamir (BLAKE3 over the public statement).
- Arithmetic over a 64-bit prime modulus (2^61 - 1) for speed and safety.
- Proof is just the random vector r and y = A * (B r), which is extremely small.