mirror of
https://github.com/status-im/nim-codex.git
synced 2025-01-20 15:49:53 +00:00
f25c555d59
* Move to version 2.0.6 * Update nim-confutils submodule to latest version * Update dependencies * Update Nim version to 2.0.12 * Add gcsafe pragma * Add missing import * Update specific conf for Nim 2.x * Fix method signatures * Revert erasure coding attempt to fix bug * More gcsafe pragma * Duplicate code from libp2p because it is not exported anymore * Fix camelcase function names * Use alreadySeen because need is not a bool anymore * newLPStreamReadError does not exist anymore so use another error * Replace ValidIpAddress by IpAddress * Add gcsafe pragma * Restore maintenance parameter deleted by mistake when removing esasure coding fix attempt code * Update method signatures * Copy LPStreamReadError code from libp2p which was removed * Fix camel case * Fix enums in tests * Fix camel case * Extract node components to a variable to make Nim 2 happy * Update the tests using ValidIpAddress to IpAddress * Fix cast for value which is already an option * Set nim version to 2.0.x for CI * Set nim version to 2.0.x for CI * Move to miniupnp version 2.2.4 to avoid symlink error * Set core.symlinks to false for Windows for miniupnp >= 2.2.5 support * Update to Nim 2.0.14 * Update CI nim versions to 2.0.14 * Try with GCC 14 * Replace apt-fast by apt-get * Update ubuntu runner to latest * Use Ubuntu 20.04 for coverage * Disable CI cache for coverage * Add coverage property description * Remove commented test * Check the node value of seen instead of using alreadySeen * Fix the merge. The taskpool work was reverted. * Update nim-ethers submodule * Remove deprecated ValidIpAddress. Fix missing case and imports. * Fix a weird issue where nim-confutils cannot find NatAny * Fix tests and remove useless static keyword
98 lines
2.6 KiB
Nim
98 lines
2.6 KiB
Nim
import ../../asynctest
|
|
|
|
import pkg/chronos
|
|
import pkg/libp2p/cid
|
|
|
|
import pkg/codex/merkletree
|
|
import pkg/codex/chunker
|
|
import pkg/codex/blocktype as bt
|
|
import pkg/codex/slots
|
|
import pkg/codex/stores
|
|
import pkg/codex/conf
|
|
import pkg/confutils/defs
|
|
import pkg/poseidon2/io
|
|
import pkg/codex/utils/poseidon2digest
|
|
import pkg/codex/nat
|
|
import pkg/codex/utils/natutils
|
|
import ./helpers
|
|
import ../helpers
|
|
|
|
suite "Test Prover":
|
|
let
|
|
samples = 5
|
|
blockSize = DefaultBlockSize
|
|
cellSize = DefaultCellSize
|
|
repoTmp = TempLevelDb.new()
|
|
metaTmp = TempLevelDb.new()
|
|
challenge = 1234567.toF.toBytes.toArray32
|
|
|
|
var
|
|
store: BlockStore
|
|
prover: Prover
|
|
|
|
setup:
|
|
let
|
|
repoDs = repoTmp.newDb()
|
|
metaDs = metaTmp.newDb()
|
|
config = CodexConf(
|
|
cmd: StartUpCmd.persistence,
|
|
nat: NatConfig(
|
|
hasExtIp: false,
|
|
nat: NatNone),
|
|
metricsAddress: parseIpAddress("127.0.0.1"),
|
|
persistenceCmd: PersistenceCmd.prover,
|
|
circomR1cs: InputFile("tests/circuits/fixtures/proof_main.r1cs"),
|
|
circomWasm: InputFile("tests/circuits/fixtures/proof_main.wasm"),
|
|
circomZkey: InputFile("tests/circuits/fixtures/proof_main.zkey"),
|
|
numProofSamples: samples
|
|
)
|
|
backend = config.initializeBackend().tryGet()
|
|
|
|
store = RepoStore.new(repoDs, metaDs)
|
|
prover = Prover.new(store, backend, config.numProofSamples)
|
|
|
|
teardown:
|
|
await repoTmp.destroyDb()
|
|
await metaTmp.destroyDb()
|
|
|
|
test "Should sample and prove a slot":
|
|
let
|
|
(_, _, verifiable) =
|
|
await createVerifiableManifest(
|
|
store,
|
|
8, # number of blocks in the original dataset (before EC)
|
|
5, # ecK
|
|
3, # ecM
|
|
blockSize,
|
|
cellSize)
|
|
|
|
let
|
|
(inputs, proof) = (
|
|
await prover.prove(1, verifiable, challenge)).tryGet
|
|
|
|
check:
|
|
(await prover.verify(proof, inputs)).tryGet == true
|
|
|
|
test "Should generate valid proofs when slots consist of single blocks":
|
|
|
|
# To get single-block slots, we just need to set the number of blocks in
|
|
# the original dataset to be the same as ecK. The total number of blocks
|
|
# after generating random data for parity will be ecK + ecM, which will
|
|
# match the number of slots.
|
|
let
|
|
(_, _, verifiable) =
|
|
await createVerifiableManifest(
|
|
store,
|
|
2, # number of blocks in the original dataset (before EC)
|
|
2, # ecK
|
|
1, # ecM
|
|
blockSize,
|
|
cellSize)
|
|
|
|
let
|
|
(inputs, proof) = (
|
|
await prover.prove(1, verifiable, challenge)).tryGet
|
|
|
|
check:
|
|
(await prover.verify(proof, inputs)).tryGet == true
|