mirror of
https://github.com/status-im/nim-dagger.git
synced 2025-02-02 18:03:52 +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>
108 lines
2.8 KiB
Nim
108 lines
2.8 KiB
Nim
import std/unittest
|
|
import std/sequtils
|
|
import std/tables
|
|
|
|
import pkg/questionable/results
|
|
import pkg/stew/byteutils
|
|
import pkg/nimcrypto/sha2
|
|
import pkg/libp2p
|
|
|
|
import pkg/codex/codextypes
|
|
import pkg/codex/merkletree
|
|
|
|
import ./helpers
|
|
import ./generictreetests
|
|
|
|
# TODO: Generalize to other hashes
|
|
|
|
const
|
|
data =
|
|
[
|
|
"00000000000000000000000000000001".toBytes,
|
|
"00000000000000000000000000000002".toBytes,
|
|
"00000000000000000000000000000003".toBytes,
|
|
"00000000000000000000000000000004".toBytes,
|
|
"00000000000000000000000000000005".toBytes,
|
|
"00000000000000000000000000000006".toBytes,
|
|
"00000000000000000000000000000007".toBytes,
|
|
"00000000000000000000000000000008".toBytes,
|
|
"00000000000000000000000000000009".toBytes,
|
|
"00000000000000000000000000000010".toBytes,
|
|
]
|
|
sha256 = Sha256HashCodec
|
|
|
|
suite "Test CodexTree":
|
|
test "Cannot init tree without any multihash leaves":
|
|
check:
|
|
CodexTree.init(leaves = newSeq[MultiHash]()).isErr
|
|
|
|
test "Cannot init tree without any cid leaves":
|
|
check:
|
|
CodexTree.init(leaves = newSeq[Cid]()).isErr
|
|
|
|
test "Cannot init tree without any byte leaves":
|
|
check:
|
|
CodexTree.init(sha256, leaves = newSeq[ByteHash]()).isErr
|
|
|
|
test "Should build tree from multihash leaves":
|
|
var
|
|
expectedLeaves = data.mapIt( MultiHash.digest($sha256, it).tryGet() )
|
|
|
|
var tree = CodexTree.init(leaves = expectedLeaves)
|
|
check:
|
|
tree.isOk
|
|
tree.get().leaves == expectedLeaves.mapIt( it.digestBytes )
|
|
tree.get().mcodec == sha256
|
|
|
|
test "Should build tree from cid leaves":
|
|
var
|
|
expectedLeaves = data.mapIt(
|
|
Cid.init(
|
|
CidVersion.CIDv1,
|
|
BlockCodec,
|
|
MultiHash.digest($sha256, it).tryGet
|
|
).tryGet )
|
|
|
|
let
|
|
tree = CodexTree.init(leaves = expectedLeaves)
|
|
|
|
check:
|
|
tree.isOk
|
|
tree.get().leaves == expectedLeaves.mapIt( it.mhash.tryGet.digestBytes )
|
|
tree.get().mcodec == sha256
|
|
|
|
test "Should build from raw digestbytes (should not hash leaves)":
|
|
let
|
|
tree = CodexTree.init(sha256, leaves = data).tryGet
|
|
|
|
check:
|
|
tree.mcodec == sha256
|
|
tree.leaves == data
|
|
|
|
test "Should build from nodes":
|
|
let
|
|
tree = CodexTree.init(sha256, leaves = data).tryGet
|
|
fromNodes = CodexTree.fromNodes(
|
|
nodes = toSeq(tree.nodes),
|
|
nleaves = tree.leavesCount).tryGet
|
|
|
|
check:
|
|
tree.mcodec == sha256
|
|
tree == fromNodes
|
|
|
|
let
|
|
mhash = sha256.mhash().tryGet
|
|
zero: seq[byte] = newSeq[byte](mhash.size)
|
|
compress = proc(x, y: seq[byte], key: ByteTreeKey): seq[byte] =
|
|
compress(x, y, key, mhash).tryGet
|
|
|
|
makeTree = proc(data: seq[seq[byte]]): CodexTree =
|
|
CodexTree.init(sha256, leaves = data).tryGet
|
|
|
|
testGenericTree(
|
|
"CodexTree",
|
|
@data,
|
|
zero,
|
|
compress,
|
|
makeTree)
|