One Tensor Commitment for Tables of Every Height
Every table of a multi-table AIR proof in one tensor commitment: one fold vector, one query set, one sumcheck, and t + 1 support cells for unsalted leaves.
Cryptography
Proof systems, commitment schemes and the cryptography Hekate proves.
2 articles
Zero-Knowledge Ring-Switching without the Transpose
Ring-switching made zero-knowledge: over a binary field of degree n, the correction costs n − 1 multiplication constraints for any number of batched claims.