About the service
I develop industrial zero-knowledge schemes and proofs on Noir — Aztec's ZK language with Rust-inspired syntax. Noir lets you describe private logic in clean, readable code while remaining backend-independent: the scheme compiles to ACIR (Abstract Circuit Intermediate Representation) and can work with different proof systems, including Barretenberg for UltraHonk and UltraPlonk proofs.
What you get:
— Custom schemes on Noir for identification, set membership proofs, private voting, credential verification, mixers and confidential transfers.
— Efficient constraint design that reduces gate count and proof generation time.
— Reusable Noir libraries and modules with clear interfaces, unit tests via nargo, and documented public and private inputs.
— Verifier integration: generating Solidity or contract verifiers for on-chain proof verification, as well as off-chain proof generation.
— Merkle tree inclusion proofs, hash commitments (Pedersen, Poseidon, Keccak), range checks and signature verification inside the circuit.
— Full integration with JavaScript or TypeScript layer (Node or browser) for witness construction and proof generation.
Process: I start from your privacy requirements, identify public and private inputs, model the constraints and refine the scheme for robustness and performance. Each scheme comes with a test suite, trust assumptions description, and instructions for proof and verification.
Describe your task — I'll assess costs based on constraints and propose the cleanest Noir solution.
What you get:
— Custom schemes on Noir for identification, set membership proofs, private voting, credential verification, mixers and confidential transfers.
— Efficient constraint design that reduces gate count and proof generation time.
— Reusable Noir libraries and modules with clear interfaces, unit tests via nargo, and documented public and private inputs.
— Verifier integration: generating Solidity or contract verifiers for on-chain proof verification, as well as off-chain proof generation.
— Merkle tree inclusion proofs, hash commitments (Pedersen, Poseidon, Keccak), range checks and signature verification inside the circuit.
— Full integration with JavaScript or TypeScript layer (Node or browser) for witness construction and proof generation.
Process: I start from your privacy requirements, identify public and private inputs, model the constraints and refine the scheme for robustness and performance. Each scheme comes with a test suite, trust assumptions description, and instructions for proof and verification.
Describe your task — I'll assess costs based on constraints and propose the cleanest Noir solution.
