Circom & Noir Zero-Knowledge Circuit Engineering
We write tightly constrained arithmetic circuits for confidential claims, solvency proofs, selective-disclosure identity (SoulPass), and private state transitions.
- Poseidon hash commitments, depth-20 Merkle inclusion proofs & nullifier binding
- Signal-tagging and recipient-binding constraints to prevent front-running
- Browser-native WebAssembly witness generation + snarkjs Groth16 proving