mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-01-02 13:33:10 +00:00
1cac3e2a11
* cleanup imports and logs * add BlockHandle type * revert deps * refactor: async error handling and future tracking improvements - Update async procedures to use explicit raises annotation - Modify TrackedFutures to handle futures with no raised exceptions - Replace `asyncSpawn` with explicit future tracking - Update test suites to use `unittest2` - Standardize error handling across network and async components - Remove deprecated error handling patterns This commit introduces a more robust approach to async error handling and future management, improving type safety and reducing potential runtime errors. * bump nim-serde * remove asyncSpawn * rework background downloads and prefetch * imporove logging * refactor: enhance async procedures with error handling and raise annotations * misc cleanup * misc * refactor: implement allFinishedFailed to aggregate future results with success and failure tracking * refactor: update error handling in reader procedures to raise ChunkerError and CancelledError * refactor: improve error handling in wantListHandler and accountHandler procedures * refactor: simplify LPStreamReadError creation by consolidating parameters * refactor: enhance error handling in AsyncStreamWrapper to catch unexpected errors * refactor: enhance error handling in advertiser and discovery loops to improve resilience * misc * refactor: improve code structure and readability * remove cancellation from addSlotToQueue * refactor: add assertion for unexpected errors in local store checks * refactor: prevent tracking of finished futures and improve test assertions * refactor: improve error handling in local store checks * remove usage of msgDetail * feat: add initial implementation of discovery engine and related components * refactor: improve task scheduling logic by removing unnecessary break statement * break after scheduling a task * make taskHandler cancelable * refactor: update async handlers to raise CancelledError * refactor(advertiser): streamline error handling and improve task flow in advertise loops * fix: correct spelling of "divisible" in error messages and comments * refactor(discovery): simplify discovery task loop and improve error handling * refactor(engine): filter peers before processing in cancelBlocks procedure
58 lines
1.6 KiB
Nim
58 lines
1.6 KiB
Nim
import std/sequtils
|
|
import std/random
|
|
|
|
import pkg/unittest2
|
|
import pkg/poseidon2
|
|
import pkg/poseidon2/sponge
|
|
|
|
import pkg/questionable/results
|
|
|
|
import pkg/codex/merkletree
|
|
import pkg/codex/utils/poseidon2digest
|
|
|
|
import ./helpers
|
|
|
|
suite "Digest - MerkleTree":
|
|
const KB = 1024
|
|
|
|
test "Hashes chunks of data with sponge, and combines them in merkle root":
|
|
let bytes = newSeqWith(64 * KB, rand(byte))
|
|
var leaves: seq[Poseidon2Hash]
|
|
for i in 0 ..< 32:
|
|
let
|
|
chunk = bytes[(i * 2 * KB) ..< ((i + 1) * 2 * KB)]
|
|
digest = Sponge.digest(chunk, rate = 2)
|
|
leaves.add(digest)
|
|
|
|
let
|
|
digest = Poseidon2Tree.digest(bytes, chunkSize = 2 * KB).tryGet
|
|
spongeDigest = SpongeMerkle.digest(bytes, chunkSize = 2 * KB)
|
|
codexPosTree = Poseidon2Tree.init(leaves).tryGet
|
|
rootDigest = codexPosTree.root.tryGet
|
|
|
|
check:
|
|
bool(digest == spongeDigest)
|
|
bool(digest == rootDigest)
|
|
|
|
test "Handles partial chunk at the end":
|
|
let bytes = newSeqWith(63 * KB, rand(byte))
|
|
var leaves: seq[Poseidon2Hash]
|
|
for i in 0 ..< 31:
|
|
let
|
|
chunk = bytes[(i * 2 * KB) ..< ((i + 1) * 2 * KB)]
|
|
digest = Sponge.digest(chunk, rate = 2)
|
|
leaves.add(digest)
|
|
|
|
let partialChunk = bytes[(62 * KB) ..< (63 * KB)]
|
|
leaves.add(Sponge.digest(partialChunk, rate = 2))
|
|
|
|
let
|
|
digest = Poseidon2Tree.digest(bytes, chunkSize = 2 * KB).tryGet
|
|
spongeDigest = SpongeMerkle.digest(bytes, chunkSize = 2 * KB)
|
|
codexPosTree = Poseidon2Tree.init(leaves).tryGet
|
|
rootDigest = codexPosTree.root.tryGet
|
|
|
|
check:
|
|
bool(digest == spongeDigest)
|
|
bool(digest == rootDigest)
|