veedo - Action Report¶

Project: /home/user/git/veedo Created: 2026-08-17

VeeDo evaluated — STARK VDF for Black Box randomness and block beacon (2026-08-17 06:06)¶

Status: 🔵 DESIGNED — math verified, Hare port pending. What: Evaluated StarkWare's VeeDo (STARK-based Verifiable Delay Function) for NeXuS Black Box VRF lottery and block randomness beacon. Why: The Vestal Protocol's Black Box requires unforgeable, delay-bound randomness that cannot be predicted or ground regardless of hardware. How: Read README, delay_function.sage reference code, verifier.txt (Solidity MimcVerifier contract). Key findings: (1) MiMC delay function: cube operations in GF(0x30000003000000010000000000000001), 126-bit prime field. 335M iterations = ~3.5 min on i7-7700K — unavoidable even with infinite parallelism. (2) Prover inversion trick: prover runs inverse function (cube root, cheap) to generate trace; verifier checks forward direction (hard to fake, fast to verify). (3) MDS matrix deployed values differ from Sage reference — use verifier.txt values: MM_MAT00=0x109bbc..., MM_MAT01=0x1eb885..., MM_MAT10=0xdc8eaa..., MM_MAT11=0x2c1850. (4) STARK verification architecture: StarkVerifier (general) + MimcConstraintPoly (AIR) + MimcOods (OODS sampling) + FactRegistry. The StarkVerifier is the general engine — swap the AIR, prove anything. (5) VeeDo's role: Black Box lottery (180d/365d), block randomness beacon, anti-grinding. NOT the general state transition prover (that is stwo). Files: ~/git/veedo (repo), evaluation only. Next: port delay_function.sage to Python reference then Hare production.