mirror of
https://github.com/status-im/nim-dagger.git
synced 2025-01-19 11:14:09 +00:00
fffb674bba
* rework merkle tree support * rename merkletree -> codexmerkletree * treed and proof encoding/decoding * style * adding codex merkle and coders tests * use default hash codec * proof size changed * add from nodes test * shorte file names * wip poseidon tree * shorten file names * root returns a result * import poseidon tests * fix merge issues and cleanup a few warnings * setting up slot builder * Getting cids in slot * ensures blocks are devisable by number of slots * wip * Implements indexing strategies * Swaps in indexing strategy into erasure. * wires slot and indexing tests up * Fixes issue where indexing strategy stepped gives wrong values for smallest of ranges * debugs indexing strategies * Can select slot blocks * finding number of pad cells * Implements building slot tree * finishes implementing slot builder * Adds check that block size is a multiple of cell size * Cleanup slotbuilder * Review comments by Tomasz * Fixes issue where ecK was used as numberOfSlots. * rework merkle tree support * deps * rename merkletree -> codexmerkletree * treed and proof encoding/decoding * style * adding codex merkle and coders tests * remove new codecs for now * proof size changed * add from nodes test * shorte file names * wip poseidon tree * shorten file names * fix bad `elements` iter * bump * bump * wip * reworking slotbuilder * move out of manifest * expose getCidAndProof * import index strat... * remove getMHash * remove unused artifacts * alias zero * add digest for multihash * merge issues * remove unused hashes * add option to result converter * misc * fix tests * add helper to derive EC block count * rename method * misc * bump * extract slot root building into own proc * revert to manifest to accessor --------- Co-authored-by: benbierens <thatbenbierens@gmail.com>
54 lines
1.5 KiB
Nim
54 lines
1.5 KiB
Nim
## Nim-Codex
|
|
## Copyright (c) 2023 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 pkg/poseidon2
|
|
import pkg/poseidon2/io
|
|
import pkg/questionable/results
|
|
import pkg/libp2p/multihash
|
|
|
|
import ../merkletree
|
|
|
|
func digestTree*(
|
|
_: type Poseidon2Tree,
|
|
bytes: openArray[byte], chunkSize: int): ?!Poseidon2Tree =
|
|
## Hashes chunks of data with a sponge of rate 2, and combines the
|
|
## resulting chunk hashes in a merkle root.
|
|
##
|
|
|
|
var index = 0
|
|
var leaves: seq[Poseidon2Hash]
|
|
while index < bytes.len:
|
|
let start = index
|
|
let finish = min(index + chunkSize, bytes.len)
|
|
let digest = Sponge.digest(bytes.toOpenArray(start, finish - 1), rate = 2)
|
|
leaves.add(digest)
|
|
index += chunkSize
|
|
return Poseidon2Tree.init(leaves)
|
|
|
|
func digest*(
|
|
_: type Poseidon2Tree,
|
|
bytes: openArray[byte], chunkSize: int): ?!Poseidon2Hash =
|
|
## Hashes chunks of data with a sponge of rate 2, and combines the
|
|
## resulting chunk hashes in a merkle root.
|
|
##
|
|
|
|
(? Poseidon2Tree.digestTree(bytes, chunkSize)).root
|
|
|
|
func digestMhash*(
|
|
_: type Poseidon2Tree,
|
|
bytes: openArray[byte], chunkSize: int): ?!MultiHash =
|
|
## Hashes chunks of data with a sponge of rate 2 and
|
|
## returns the multihash of the root
|
|
##
|
|
|
|
let
|
|
hash = ? Poseidon2Tree.digest(bytes, chunkSize)
|
|
|
|
? MultiHash.init(Pos2Bn128MrklCodec, hash).mapFailure
|