Folding scheme auditor
Skill Yue-Zhou1/zkcrypto-audit/plugins/zk-and-vm-auditors/skills/folding-scheme-auditor
Audit folding scheme and IVC implementations for accumulator soundness, step circuit binding, cycle-of-curves correctness, and running instance completeness. Use when reviewing Nova, HyperNova, ProtoStar, or custom folding-based proof systems in Rust.From its SKILL.md
npx -y skills add Yue-Zhou1/zkcrypto-audit --skill folding-scheme-auditorAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
One thing to look at
- 2 stars2 stars. Stars are a popularity signal and not a quality one, but at this level it is likely that nobody has read this closely except its author, and you would be relying on your own review.
SKILL.md
3.0 KB, 599 tokens by cl100k_base, as published. Nobody here has run it
folding-scheme-auditor
Domain auditor for folding scheme and incrementally verifiable computation (IVC) systems.
When to Use
- Reviewing Nova, HyperNova, ProtoStar, or Sonobe-based Rust implementations
- Auditing accumulator update logic and relaxed R1CS folding equations
- Checking IVC step circuit binding and public input threading across steps
- Reviewing cycle-of-curves field selection and cross-curve consistency
- Auditing running instance completeness and error term construction
When NOT to Use
- Standard Groth16, PLONK, or STARKs without folding (use
zk-circuit-auditor) - Recursive plonky2/3 circuits (use
zk-circuit-auditor+plonky2-patterns.md) - Declaring accumulator bugs confirmed without
crypto-fp-check
Core Review Areas
- Accumulator soundness — relaxed R1CS folding equation correctness, error term construction and range
- IVC step circuit binding — public input threading across steps, base case handling
- Cycle-of-curves consistency — field element compatibility, cross-curve public input encoding
- Running instance completeness — witness availability per step, error accumulation bounds
- Folding verifier equation — cross-term commitments, challenge derivation, final SNARK proof
Workflow
Phase 1: Checklist pass
- Read
references/folding-scheme-checklist.md - Identify the folding scheme variant (Nova, HyperNova, ProtoStar) and the cycle of curves
- Map all accumulator update sites and IVC step boundaries
Phase 2: Accumulator review
- Execute
workflows/accumulator-review.md - Verify the relaxed R1CS equation, error term, and cross-term commitment at every folding step
- Treat any unchecked accumulator field as a soundness candidate until disproven
Phase 3: Pattern hunt
- Read
references/finding-patterns.md - Prioritize IVC step binding gaps, cycle-of-curves field mismatches, and base case soundness failures
- Check the final SNARK proof over the last accumulator for correct key binding
Phase 4: Handoff
- Send surviving findings to
crypto-fp-check - Use
zkbugs-indexonly after verification succeeds
Output Contract
Produce a folding-scheme handoff that includes:
- The accumulator state, step circuit, or verifier equation involved
- The exact folding equation gap, field mismatch, or binding failure
- Whether the issue is accumulator soundness, IVC threading, curve consistency, or verifier equation
- The next verification or reporting route
Reference Index
What ships with it: 4 files
6.6 KB alongside SKILL.md
agents/
- openai.yaml630 B
references/
- finding-patterns.md1.7 KB
- folding-scheme-checklist.md1.9 KB
workflows/
- accumulator-review.md2.4 KB