mirror of
https://github.com/codex-storage/codex-storage-proofs.git
synced 2025-01-10 02:45:55 +00:00
a0ba322cfd
* WIP: working on storage proofs * make it work * don't need to pass an array * add failing case * move `saltSquare` to top * updating deps
80 lines
2.6 KiB
Plaintext
80 lines
2.6 KiB
Plaintext
pragma circom 2.1.0;
|
|
|
|
// include "../node_modules/circomlib/circuits/poseidon.circom";
|
|
include "../node_modules/circomlib/circuits/mimc.circom";
|
|
// include "../node_modules/circomlib/circuits/mimcsponge.circom";
|
|
include "../node_modules/circomlib/circuits/switcher.circom";
|
|
include "../node_modules/circomlib/circuits/bitify.circom";
|
|
|
|
template parallel MerkleProof(LEVELS) {
|
|
signal input leaf;
|
|
signal input pathElements[LEVELS];
|
|
signal input pathIndices;
|
|
|
|
signal output root;
|
|
|
|
component switcher[LEVELS];
|
|
component hasher[LEVELS];
|
|
|
|
component indexBits = Num2Bits(LEVELS);
|
|
indexBits.in <== pathIndices;
|
|
|
|
for (var i = 0; i < LEVELS; i++) {
|
|
switcher[i] = Switcher();
|
|
|
|
switcher[i].L <== i == 0 ? leaf : hasher[i - 1].out;
|
|
switcher[i].R <== pathElements[i];
|
|
switcher[i].sel <== indexBits.out[i];
|
|
|
|
// hasher[i] = Poseidon(2);
|
|
hasher[i] = MultiMiMC7(2, 91);
|
|
hasher[i].k <== 2;
|
|
hasher[i].in[0] <== switcher[i].outL;
|
|
hasher[i].in[1] <== switcher[i].outR;
|
|
}
|
|
|
|
root <== hasher[LEVELS - 1].out;
|
|
}
|
|
|
|
template parallel HashCheck(BLOCK_SIZE) {
|
|
signal input block[BLOCK_SIZE];
|
|
signal input blockHash;
|
|
|
|
component hash = MultiMiMC7(BLOCK_SIZE, 91);
|
|
hash.in <== block;
|
|
hash.k <== 2;
|
|
|
|
blockHash === hash.out; // assert that block matches hash
|
|
}
|
|
|
|
template StorageProver(BLOCK_SIZE, QUERY_LEN, LEVELS) {
|
|
// BLOCK_SIZE: size of block in symbols
|
|
// QUERY_LEN: query length, i.e. number if indices to be proven
|
|
// LEVELS: size of Merkle Tree in the manifest
|
|
signal input chunks[QUERY_LEN][BLOCK_SIZE]; // chunks to be proven
|
|
signal input siblings[QUERY_LEN][LEVELS]; // siblings hashes of chunks to be proven
|
|
signal input path[QUERY_LEN]; // path of chunks to be proven
|
|
signal input hashes[QUERY_LEN]; // hashes of chunks to be proven
|
|
signal input root; // root of the Merkle Tree
|
|
signal input salt; // salt (block hash) to prevent preimage attacks
|
|
|
|
signal saltSquare <== salt * salt; // might not be necesary as it's part of the public inputs
|
|
|
|
component hashers[QUERY_LEN];
|
|
for (var i = 0; i < QUERY_LEN; i++) {
|
|
hashers[i] = HashCheck(BLOCK_SIZE);
|
|
hashers[i].block <== chunks[i];
|
|
hashers[i].blockHash <== hashes[i];
|
|
}
|
|
|
|
component merkelizer[QUERY_LEN];
|
|
for (var i = 0; i < QUERY_LEN; i++) {
|
|
merkelizer[i] = MerkleProof(LEVELS);
|
|
merkelizer[i].leaf <== hashes[i];
|
|
merkelizer[i].pathElements <== siblings[i];
|
|
merkelizer[i].pathIndices <== path[i];
|
|
|
|
merkelizer[i].root === root;
|
|
}
|
|
}
|