mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-01-05 23:13:09 +00:00
52c5578c46
* rework merkle tree support * deps * rename merkletree -> codexmerkletree * treed and proof encoding/decoding * small change to invoke proof verification * rename merkletree to codexmerkletree * style * adding codex merkle and coders tests * fixup imports * remove new codecs for now * bump deps * adding trace statement * properly serde of manifest block codecs * use default hash codec * add more trace logging to aid debugging * misc * remove double import * revert un-needded change * proof size changed * bump poseidon2 * add from nodes test * shorte file names * remove upraises * wip poseidon tree * adjust file names * misc * shorten file names * fix bad `elements` iter * don't do asserts * add fromNodes and converters * root and getProof now return result * add poseidon2 tree tests * root now returns result * misc * had to make merkletree a ref, because nim blows up otherwise * root returns a result * root returns a result * import poseidon tests * bump * merkle poseidon2 digest * misc * add merkle digest tests * bump * don't use checksuite * Update tests/codex/merkletree/generictreetests.nim Co-authored-by: markspanbroek <mark@spanbroek.net> Signed-off-by: Dmitriy Ryajov <dryajov@gmail.com> * Update codex/merkletree/merkletree.nim Co-authored-by: markspanbroek <mark@spanbroek.net> Signed-off-by: Dmitriy Ryajov <dryajov@gmail.com> * Update codex/merkletree/merkletree.nim Co-authored-by: markspanbroek <mark@spanbroek.net> Signed-off-by: Dmitriy Ryajov <dryajov@gmail.com> * Update tests/codex/merkletree/generictreetests.nim Co-authored-by: markspanbroek <mark@spanbroek.net> Signed-off-by: Dmitriy Ryajov <dryajov@gmail.com> * missing return * make toBool private (it's still needed otherwise comparison won't work) * added `digestTree` that returns a tree and `digest` for root * test against both poseidon trees - codex and poseidon2 * shorten merkle tree names * don't compare trees - it's going to be too slow * move comparison to mekrle helper * remove merkle utils --------- Signed-off-by: Dmitriy Ryajov <dryajov@gmail.com> Co-authored-by: markspanbroek <mark@spanbroek.net>
107 lines
2.7 KiB
Nim
107 lines
2.7 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/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 = multiCodec("sha2-256")
|
|
|
|
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.bytes )
|
|
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.bytes )
|
|
tree.get().mcodec == sha256
|
|
|
|
test "Should build from raw bytes (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.getMhash().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)
|