mirror of
https://github.com/status-im/nim-dagger.git
synced 2025-02-08 21:05:21 +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>
89 lines
2.2 KiB
Nim
89 lines
2.2 KiB
Nim
import std/unittest
|
|
import std/sequtils
|
|
import std/sugar
|
|
|
|
import pkg/poseidon2
|
|
import pkg/poseidon2/io
|
|
import pkg/questionable/results
|
|
import pkg/results
|
|
import pkg/stew/byteutils
|
|
import pkg/stew/arrayops
|
|
import constantine/math/arithmetic
|
|
import constantine/math/io/io_bigints
|
|
import pkg/constantine/math/io/io_fields
|
|
import pkg/constantine/platforms/abstractions
|
|
|
|
import pkg/codex/merkletree
|
|
|
|
import ./generictreetests
|
|
import ./helpers
|
|
|
|
const
|
|
data =
|
|
[
|
|
"0000000000000000000000000000001".toBytes,
|
|
"0000000000000000000000000000002".toBytes,
|
|
"0000000000000000000000000000003".toBytes,
|
|
"0000000000000000000000000000004".toBytes,
|
|
"0000000000000000000000000000005".toBytes,
|
|
"0000000000000000000000000000006".toBytes,
|
|
"0000000000000000000000000000007".toBytes,
|
|
"0000000000000000000000000000008".toBytes,
|
|
"0000000000000000000000000000009".toBytes,
|
|
"0000000000000000000000000000010".toBytes,
|
|
]
|
|
|
|
suite "Test CodexTree":
|
|
var
|
|
expectedLeaves: seq[Poseidon2Hash]
|
|
|
|
setup:
|
|
expectedLeaves = toSeq( data.concat().elements(Poseidon2Hash) )
|
|
|
|
test "Should fail init tree from empty leaves":
|
|
check:
|
|
Poseidon2Tree.init( leaves = newSeq[Poseidon2Hash](0) ).isErr
|
|
|
|
test "Init tree from poseidon2 leaves":
|
|
let
|
|
tree = Poseidon2Tree.init( leaves = expectedLeaves ).tryGet
|
|
|
|
check:
|
|
tree.leaves == expectedLeaves
|
|
|
|
test "Init tree from byte leaves":
|
|
let
|
|
tree = Poseidon2Tree.init(
|
|
leaves = data.mapIt(
|
|
array[31, byte].initCopyFrom( it )
|
|
)).tryGet
|
|
|
|
check:
|
|
tree.leaves == expectedLeaves
|
|
|
|
test "Should build from nodes":
|
|
let
|
|
tree = Poseidon2Tree.init(leaves = expectedLeaves).tryGet
|
|
fromNodes = Poseidon2Tree.fromNodes(
|
|
nodes = toSeq(tree.nodes),
|
|
nleaves = tree.leavesCount).tryGet
|
|
|
|
check:
|
|
tree == fromNodes
|
|
|
|
let
|
|
compressor = proc(
|
|
x, y: Poseidon2Hash,
|
|
key: PoseidonKeysEnum): Poseidon2Hash {.noSideEffect.} =
|
|
compress(x, y, key.toKey)
|
|
|
|
makeTree = proc(data: seq[Poseidon2Hash]): Poseidon2Tree =
|
|
Poseidon2Tree.init(leaves = data).tryGet
|
|
|
|
testGenericTree(
|
|
"Poseidon2Tree",
|
|
toSeq( data.concat().elements(Poseidon2Hash) ),
|
|
zero,
|
|
compressor,
|
|
makeTree)
|