mirror of
https://github.com/codex-storage/nim-codex.git
synced 2025-01-10 13:05:48 +00:00
72da534856
* Setting up testfixture for proof datasampler * Sets up calculating number of cells in a slot * Sets up tests for bitwise modulo * Implements cell index collection * setting up slot blocks module * Implements getting treeCID from slot * implements getting slot blocks by index * Implements out-of-range check for slot index * cleanup * Sets up getting sample from block * Implements selecting a cell sample from a block * Implements building a minitree for block cells * Adds method to get dataset block index from slot block index * It's running * splits up indexing * almost there * Fixes test. Implementation is now functional * Refactoring to object-oriented * Cleanup * Lining up output type with updated reference code. * setting up * Updates expected samples * Updates proof checking test to match new format * move builder to own dir * move sampler to own dir * fix paths * various changes to add support for the sampler * wip sampler implementation * don't use upraises * wip sampler integration * misc * move tests around * Various fixes to select correct slot and block index * removing old tests * cleanup * misc fix tests that work with correct cell indices * remove unused file * fixup logging * add logscope * truncate entropy to 31 bytes, otherwise it might be > than mod * forwar getCidAndProof to local store * misc * Adds missing test for initial-proving state * reverting back to correct slot/block indexing * fix tests for revert * misc * misc --------- Co-authored-by: benbierens <thatbenbierens@gmail.com>
89 lines
2.6 KiB
Nim
89 lines
2.6 KiB
Nim
## Nim-Codex
|
|
## Copyright (c) 2024 Status Research & Development GmbH
|
|
## Licensed under either of
|
|
## * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE))
|
|
## * MIT license ([LICENSE-MIT](LICENSE-MIT))
|
|
## at your option.
|
|
## This file may not be copied, modified, or distributed except according to
|
|
## those terms.
|
|
|
|
import std/sequtils
|
|
|
|
import pkg/libp2p
|
|
import pkg/stew/arrayops
|
|
import pkg/questionable
|
|
import pkg/questionable/results
|
|
import pkg/poseidon2
|
|
import pkg/poseidon2/io
|
|
|
|
import ../codextypes
|
|
import ../merkletree
|
|
import ../errors
|
|
import ../utils/digest
|
|
|
|
func toCid(hash: Poseidon2Hash, mcodec: MultiCodec, cidCodec: MultiCodec): ?!Cid =
|
|
let
|
|
mhash = ? MultiHash.init(mcodec, hash.toBytes).mapFailure
|
|
treeCid = ? Cid.init(CIDv1, cidCodec, mhash).mapFailure
|
|
success treeCid
|
|
|
|
proc toPoseidon2Hash(cid: Cid, mcodec: MultiCodec, cidCodec: MultiCodec): ?!Poseidon2Hash =
|
|
if cid.cidver != CIDv1:
|
|
return failure("Unexpected CID version")
|
|
|
|
if cid.mcodec != cidCodec:
|
|
return failure("Cid is not of expected codec. Was: " & $cid.mcodec & " but expected: " & $cidCodec)
|
|
|
|
let
|
|
mhash = ? cid.mhash.mapFailure
|
|
bytes: array[32, byte] = array[32, byte].initCopyFrom(mhash.digestBytes())
|
|
hash = ? Poseidon2Hash.fromBytes(bytes).toFailure
|
|
|
|
success hash
|
|
|
|
func toCellCid*(hash: Poseidon2Hash): ?!Cid =
|
|
toCid(hash, Pos2Bn128MrklCodec, CodexSlotCellCodec)
|
|
|
|
func fromCellCid*(cid: Cid): ?!Poseidon2Hash =
|
|
toPoseidon2Hash(cid, Pos2Bn128MrklCodec, CodexSlotCellCodec)
|
|
|
|
func toSlotCid*(hash: Poseidon2Hash): ?!Cid =
|
|
toCid(hash, multiCodec("identity"), SlotRootCodec)
|
|
|
|
func toSlotCids*(slotRoots: openArray[Poseidon2Hash]): ?!seq[Cid] =
|
|
success slotRoots.mapIt( ? it.toSlotCid )
|
|
|
|
func fromSlotCid*(cid: Cid): ?!Poseidon2Hash =
|
|
toPoseidon2Hash(cid, multiCodec("identity"), SlotRootCodec)
|
|
|
|
func toVerifyCid*(hash: Poseidon2Hash): ?!Cid =
|
|
toCid(hash, multiCodec("identity"), SlotProvingRootCodec)
|
|
|
|
func fromVerifyCid*(cid: Cid): ?!Poseidon2Hash =
|
|
toPoseidon2Hash(cid, multiCodec("identity"), SlotProvingRootCodec)
|
|
|
|
func toEncodableProof*(
|
|
proof: Poseidon2Proof): ?!CodexProof =
|
|
|
|
let
|
|
encodableProof = CodexProof(
|
|
mcodec: multiCodec("identity"),
|
|
index: proof.index,
|
|
nleaves: proof.nleaves,
|
|
path: proof.path.mapIt( @( it.toBytes ) ))
|
|
|
|
success encodableProof
|
|
|
|
func toVerifiableProof*(
|
|
proof: CodexProof): ?!Poseidon2Proof =
|
|
|
|
let
|
|
verifiableProof = Poseidon2Proof(
|
|
index: proof.index,
|
|
nleaves: proof.nleaves,
|
|
path: proof.path.mapIt(
|
|
? Poseidon2Hash.fromBytes(it.toArray32).toFailure
|
|
))
|
|
|
|
success verifiableProof
|