codex-storage
/
nim-codex
mirror of https://github.com/codex-storage/nim-codex.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Updates expected samples

This commit is contained in:
benbierens 2023-11-27 15:57:23 +01:00 committed by Dmitriy Ryajov
parent 24be5b2788
commit a4cafa6317
No known key found for this signature in database
GPG Key ID: DA8C680CE7C657A4
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
tests/codex/proof/testdatasampler.nim
View File

@ -193,7 +193,7 @@ asyncchecksuite "Test proof datasampler - main":
check: check:
isPow2(numberOfCells) isPow2(numberOfCells)
let knownIndices = @[50.uint64, 21.uint64, 110.uint64] let knownIndices = @[74.uint64, 41.uint64, 51.uint64]
test "Can find single slot-cell index": test "Can find single slot-cell index":
proc slotCellIndex(i: int): uint64 = proc slotCellIndex(i: int): uint64 =
@ -203,7 +203,8 @@ asyncchecksuite "Test proof datasampler - main":
proc getExpectedIndex(i: int): uint64 = proc getExpectedIndex(i: int): uint64 =
let let
numberOfCellsInSlot = (bytesPerBlock * numberOfSlotBlocks) div CellSize.int numberOfCellsInSlot = (bytesPerBlock * numberOfSlotBlocks) div CellSize.int
hash = Sponge.digest(@[datasetRootHash, challenge, toF(i)], rate = 2) slotRootHash = toF(1234) # TODO - replace with slotPoseidonTree.root when it is a poseidon tree.
hash = Sponge.digest(@[slotRootHash, challenge, toF(i)], rate = 2)
return extractLowBits(hash.toBig(), ceilingLog2(numberOfCellsInSlot)) return extractLowBits(hash.toBig(), ceilingLog2(numberOfCellsInSlot))
check: check: