Skip to content

Feature: composite eligibility circuit — prove a boolean formula over multiple attributes #425

Description

@Psalmuel01

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.

Metadata

Metadata

Assignees

Labels

Stellar WaveIssues in the Stellar wave programcircuitsNoir ZK circuit workhardHigh complexity or deep domain knowledge

Type

No type

Projects

No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions