190 lines
5.5 KiB
Nim
190 lines
5.5 KiB
Nim
## Nim-Codex
|
|
## Copyright (c) 2023 Status Research & Development GmbH
|
|
## Licensed under either of
|
|
## * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE))
|
|
## * MIT license ([LICENSE-MIT](LICENSE-MIT))
|
|
## at your option.
|
|
## This file may not be copied, modified, or distributed except according to
|
|
## those terms.
|
|
|
|
import std/sugar
|
|
import std/sequtils
|
|
|
|
import pkg/chronos
|
|
import pkg/questionable
|
|
import pkg/questionable/results
|
|
import pkg/constantine/math/arithmetic
|
|
import pkg/poseidon2
|
|
import pkg/poseidon2/types
|
|
import pkg/poseidon2/io
|
|
import pkg/stew/arrayops
|
|
|
|
import ../../logutils
|
|
import ../../market
|
|
import ../../blocktype as bt
|
|
import ../../merkletree
|
|
import ../../manifest
|
|
import ../../stores
|
|
|
|
import ../builder
|
|
|
|
import ./utils
|
|
|
|
logScope:
|
|
topics = "codex datasampler"
|
|
|
|
type
|
|
Cell* = seq[byte]
|
|
|
|
Sample* = object
|
|
data*: Cell
|
|
slotProof*: Poseidon2Proof
|
|
cellProof*: Poseidon2Proof
|
|
slotBlockIdx*: Natural
|
|
blockCellIdx*: Natural
|
|
|
|
ProofInput* = object
|
|
entropy*: Poseidon2Hash
|
|
verifyRoot*: Poseidon2Hash
|
|
verifyProof*: Poseidon2Proof
|
|
numSlots*: Natural
|
|
numCells*: Natural
|
|
slotIndex*: Natural
|
|
samples*: seq[Sample]
|
|
|
|
DataSampler* = ref object of RootObj
|
|
index: Natural
|
|
blockStore: BlockStore
|
|
# The following data is invariant over time for a given slot:
|
|
builder: SlotsBuilder
|
|
|
|
proc new*(
|
|
T: type DataSampler,
|
|
index: Natural,
|
|
blockStore: BlockStore,
|
|
builder: SlotsBuilder): ?!DataSampler =
|
|
|
|
if index > builder.slotRoots.high:
|
|
error "Slot index is out of range"
|
|
return failure("Slot index is out of range")
|
|
|
|
success DataSampler(
|
|
index: index,
|
|
blockStore: blockStore,
|
|
builder: builder)
|
|
|
|
proc getCell*(self: DataSampler, blkBytes: seq[byte], blkCellIdx: Natural): Cell =
|
|
let
|
|
cellSize = self.builder.cellSize.uint64
|
|
dataStart = cellSize * blkCellIdx.uint64
|
|
dataEnd = dataStart + cellSize
|
|
return blkBytes[dataStart ..< dataEnd]
|
|
|
|
proc createProofSample(self: DataSampler, slotTreeCid: Cid, cellIdx: Natural): Future[?!Sample] {.async.} =
|
|
let
|
|
cellsPerBlock = self.builder.numBlockCells
|
|
blkCellIdx = cellIdx.toBlockCellIdx(cellsPerBlock)
|
|
slotBlkIdx = cellIdx.toBlockIdx(cellsPerBlock)
|
|
|
|
logScope:
|
|
cellIdx = cellIdx
|
|
slotBlkIdx = slotBlkIdx
|
|
blkCellIdx = blkCellIdx
|
|
|
|
without (cid, proof) =? await self.blockStore.getCidAndProof(
|
|
slotTreeCid,
|
|
slotBlkIdx.Natural), err:
|
|
error "Failed to get block from block store", err = err.msg
|
|
return failure(err)
|
|
|
|
without slotProof =? proof.toVerifiableProof(), err:
|
|
error "Unable to convert slot proof to poseidon proof", error = err.msg
|
|
return failure(err)
|
|
|
|
# If the cell index is greater than or equal to the UNPADDED number of slot cells,
|
|
# Then we're sampling inside a padded block.
|
|
# In this case, we use the pre-generated zero-data and pre-generated padding-proof for this cell index.
|
|
if cellIdx >= self.builder.numSlotCells:
|
|
trace "Sampling a padded block"
|
|
|
|
without blockProof =? self.builder.emptyDigestTree.getProof(blkCellIdx), err:
|
|
error "Failed to get proof from empty block tree", err = err.msg
|
|
return failure(err)
|
|
|
|
success(Sample(
|
|
data: newSeq[byte](self.builder.cellSize.int),
|
|
slotProof: slotProof,
|
|
cellProof: blockProof,
|
|
slotBlockIdx: slotBlkIdx.Natural,
|
|
blockCellIdx: blkCellIdx.Natural))
|
|
|
|
else:
|
|
trace "Sampling a dataset block"
|
|
# This converts our slotBlockIndex to a datasetBlockIndex using the
|
|
# indexing-strategy used by the builder.
|
|
# We need this to fetch the block data. We can't do it by slotTree + slotBlkIdx.
|
|
let datasetBlockIndex = self.builder.slotIndicies(self.index)[slotBlkIdx]
|
|
|
|
without (bytes, blkTree) =? await self.builder.buildBlockTree(datasetBlockIndex), err:
|
|
error "Failed to build block tree", err = err.msg
|
|
return failure(err)
|
|
|
|
without blockProof =? blkTree.getProof(blkCellIdx), err:
|
|
error "Failed to get proof from block tree", err = err.msg
|
|
return failure(err)
|
|
|
|
success(Sample(
|
|
data: self.getCell(bytes, blkCellIdx),
|
|
slotProof: slotProof,
|
|
cellProof: blockProof,
|
|
slotBlockIdx: slotBlkIdx.Natural,
|
|
blockCellIdx: blkCellIdx.Natural))
|
|
|
|
proc getProofInput*(
|
|
self: DataSampler,
|
|
entropy: ProofChallenge,
|
|
nSamples: Natural): Future[?!ProofInput] {.async.} =
|
|
## Generate proofs as input to the proving circuit.
|
|
##
|
|
|
|
let
|
|
entropy = Poseidon2Hash.fromBytes(
|
|
array[31, byte].initCopyFrom(entropy[0..30])) # truncate to 31 bytes, otherwise it _might_ be greater than mod
|
|
|
|
without verifyTree =? self.builder.verifyTree and
|
|
verifyProof =? verifyTree.getProof(self.index) and
|
|
verifyRoot =? verifyTree.root(), err:
|
|
error "Failed to get slot proof from verify tree", err = err.msg
|
|
return failure(err)
|
|
|
|
let slotTreeCid = self.builder.manifest.slotRoots[self.index]
|
|
|
|
logScope:
|
|
index = self.index
|
|
samples = nSamples
|
|
slotTreeCid = slotTreeCid
|
|
|
|
trace "Collecting input for proof"
|
|
|
|
let cellIdxs = entropy.cellIndices(
|
|
self.builder.slotRoots[self.index],
|
|
self.builder.numSlotCellsPadded,
|
|
nSamples)
|
|
|
|
trace "Found cell indices", cellIdxs
|
|
let samples = collect(newSeq):
|
|
for cellIdx in cellIdxs:
|
|
without sample =? (await self.createProofSample(slotTreeCid, cellIdx)), err:
|
|
error "Failed to create proof sample", error = err.msg
|
|
return failure(err)
|
|
sample
|
|
|
|
success ProofInput(
|
|
entropy: entropy,
|
|
verifyRoot: verifyRoot,
|
|
verifyProof: verifyProof,
|
|
numSlots: self.builder.numSlots,
|
|
numCells: self.builder.numSlotCells,
|
|
slotIndex: self.index,
|
|
samples: samples)
|