mirror of
https://github.com/logos-storage/logos-storage-proofs-circuits.git
synced 2026-01-05 15:03:05 +00:00
25 lines
1.1 KiB
Markdown
25 lines
1.1 KiB
Markdown
|
|
Storage proof `circom` circuit
|
|
------------------------------
|
|
|
|
See the [README in the parent dir](../README.md) for the (draft) specification.
|
|
|
|
### Organization of the circuit code
|
|
|
|
- `sample_cells.circom` - compute cell indices to sample, and prove those cells
|
|
- `single_cell.circom` - prove a single cell
|
|
- `merkle.circom` - Merkle inclusion proof (using our custom Merkle tree convention)
|
|
- `extract_bits.circom` - extract lower bits of the *standard representation* of a field element
|
|
- `binary_compare.circom` - compare numbers given in binary representation (the point is that they can be bigger than the field size!)
|
|
- `log2.circom` - circom code for computing base 2 logarithm
|
|
- `misc.circom` - miscellaneous helper funtions
|
|
- `poseidon2_hash.circom` - compute Poseidon2 hash with sponge construction
|
|
- `poseidon2_sponge.circom` - generic sponge construction
|
|
- `poseidon2_perm.circom` - the Poseidon2 permutation
|
|
|
|
Note: the main component is not included in the above, as it depends on the
|
|
parameters. You can use one of the reference input generators to create one;
|
|
or look at `deprecated/slot_main.circom` for an example.
|
|
|
|
|