@sismo-core/hydra-s2
v1.0.0
Published
Hydra S2 Proving scheme
Downloads
1
Readme
Installation
$ yarn add @sismo-core/hydra-s2
Prover js (HydraS2Prover)
const prover = new HydraS2Prover(
registryTree,
commitmentMapperPubKey,
// + Optional override of the circuit path for ES module (see below for more information)
{
wasmPath: "https://[Your server].hydra-s2.wasm",
zkeyPath: "https://[Your server].hydra-s2.zkey"
}
);
| Params | Type | Description | | ---------- | -------------- | ------------- | | registryTree | MerkleTree | Registry Merkle tree that contain the Accounts Merkle tree | | commitmentMapperPubKey | EddsaPublicKey | Pub key of the CommitmentMapper |
To generate the proof, we need to provide a .wasm and a .zkey to the witness calculator. For CommonJS modules we add theses files directly in the package and we resolve the path. For ES module we can't do that, that's why we choose to host files on an S3.
If this solution doesn't suite you or if you want to optimize the download time, you can override S3 paths by adding a third params in the HydraS2Prover constructor and host files wherever you want.
ES modules (which can be overridden)
export const wasmPath = "https://static.sismo.io/hydra-s2-zkps/v1/hydra-s2.wasm";
export const zkeyPath = "https://static.sismo.io/hydra-s2-zkps/v1/hydra-s2.zkey";
CommonJS
export const wasmPath = require.resolve('./hydra-s2.wasm');
export const zkeyPath = require.resolve('./hydra-s2.zkey');
Generate Snark Proof
const source: HydraS2Account = {
identifier: address,
secret,
commitmentReceipt
}
const destination: DestinationInput = {
identifier: address,
secret,
commitmentReceipt,
chainId: 1,
}
const statement: StatementInput = {
value?: BigNumberish;
// A comparator of 0 means the accounts value in the tree can be more than the value in the statement
// A comparator of 1 means the accounts value in the tree must be equal to the value in the statement
comparator?: number;
registryTree: KVMerkleTree;
accountsTree: KVMerkleTree;
}
const params = {
vault,
source,
destination,
statement,
requestIdentifier
}
const snarkProof = await prover.generateSnarkProof(params);
// Generate inputs
// This function is automatically called by generateSnarkProof but you can call it in your tests
const { privateInputs, publicInputs } = await prover.generateInputs(params);
// Throw human readable errors
// This function is automatically called by generateSnarkProof but you can call it in your tests
try {
await prover.userParamsValidation(params);
} catch (e) {
console.log(e);
}
| Params | Type | Description | | ---------- | -------------- | ------------- | | source | HydraS2Account | Source account | | destination | HydraS2Account | Destination account | | statementValue | BigNumberish | Must be 0 <= statementValue <= accountValue if statementComparator is false or statementValue = accountValue if statementComparator is true | | chainId | BigNumberish | Chain id | | accountsTree | MerkleTree | Merkle tree constituted which include the source and a value | | requestIdentifier | BigNumberish | proofIdentifier = hash((hash(source.secret, 1), requestIdentifier) | | statementComparator | boolean | Define if the value is strict or not |
export type HydraS2Account = {
identifier: BigNumberish,
secret: BigNumberish,
commitmentReceipt: [BigNumberish, BigNumberish, BigNumberish]
};
Verifier js (HydraS2Verifier)
import { HydraS2Verifier } from "@sismo-core/hydra-s2";
const isValid = await HydraS2Verifier.verifyProof(snarkProof.a, snarkProof.b, snarkProof.c, snarkProof.input);
Verifier contract (HydraS2Verifier)
import {HydraS2Verifier} from "@sismo-core/hydra-s2/contracts/HydraS2Verifier.sol";
struct ZKProof {
uint256[2] a;
uint256[2][2] b;
uint256[2] c;
uint256[10] input;
}
contract HydraS2Attester {
HydraS2Verifier internal _verifier;
error InvalidSnarkProof(uint256[10] publicInputs);
constructor(
HydraS2Verifier hydraS2Verifier
) {
_verifier = hydraS2Verifier;
}
function attest(ZKProof calldata proof) external {
if(! _verifier.verifyProof(proof.a, proof.b, proof.c, proof.input)) {
revert InvalidSnarkProof(proof.input);
}
}
}
License
Distributed under the MIT License.
Contribute
Please, feel free to open issues, PRs or simply provide feedback!