Real gates are often boolean combinations (accredited OR income>=X) AND jurisdiction-eligible. Today these require multiple separate proofs. A composite circuit could prove a small policy formula in one proof.
Scope
- Design a circuit that evaluates a fixed-shape boolean policy over several committed attributes (AND/OR of threshold and membership checks) and outputs a single pass/fail, revealing only the result.
- Keep it bounded (a small max number of terms) for provability; document the policy encoding.
- Wire through witness/SDK; fixtures + tests.
Value
Single-proof complex eligibility, far better UX than chaining proofs.
Acceptance
- A bounded boolean policy over multiple attributes is provable in one proof; documented; tested.
Real gates are often boolean combinations (accredited OR income>=X) AND jurisdiction-eligible. Today these require multiple separate proofs. A composite circuit could prove a small policy formula in one proof.
Scope
Value
Single-proof complex eligibility, far better UX than chaining proofs.
Acceptance