codex-storage/codex-storage-proofs
1
0
Fork 0
mirror of https://github.com/codex-storage/codex-storage-proofs.git synced 2025-02-01 13:36:21 +00:00
Code Issues Packages Projects Releases Wiki Activity

cleanup

Browse Source
This commit is contained in:
Csaba Kiraly 2022-11-17 14:00:16 +01:00
parent 56ca654ab9
commit d2a72613b0
No known key found for this signature in database
GPG Key ID: 0FE274EE8C95166E
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
circuits/storer.circom
View File

@ -21,7 +21,7 @@ template HashCheck(blockSize) {
} }
template StorageProver(blockSize, qLen, nLevels) { template StorageProver(blockSize, qLen, nLevels) {
// blockSize: size of block in bits (sha256), or in ?symbols? (Poseidon) // blockSize: size of block in bits (sha256), or in symbols (Poseidon)
// qLen: query length, i.e. number if indices to be proven // qLen: query length, i.e. number if indices to be proven
// nLevels: size of Merkle Tree in the manifest // nLevels: size of Merkle Tree in the manifest
signal input chunks[qLen][blockSize]; signal input chunks[qLen][blockSize];
@ -47,7 +47,6 @@ template StorageProver(blockSize, qLen, nLevels) {
component num2Bits[qLen]; component num2Bits[qLen];
component inclusionProofs[qLen]; component inclusionProofs[qLen];
//component inclusionProofs[qLen] = MerkleTreeInclusionProof(nLevels);
for (var i = 0; i < qLen; i++) { for (var i = 0; i < qLen; i++) {
num2Bits[i] = Num2Bits(nLevels); num2Bits[i] = Num2Bits(nLevels);