mirror of
https://github.com/status-im/nim-codex.git
synced 2025-01-09 18:36:29 +00:00
b3e57a37e2
* wire prover into node * stricter case object checks * return correct proof * misc renames * adding usefull traces * fix nodes and tolerance to match expected params * format challenges in logs * add circom compat to solidity groth16 convertion * update * bump time to give nodes time to load with all circom artifacts * misc * misc * use correct dataset geometry in erasure * make errors more searchable * use parens around `=? (await...)` calls * styling * styling * use push raises * fix to match constructor arguments * merge master * merge master * integration: fix proof parameters for a test Increased times due to ZK proof generation. Increased storage requirement because we're now hosting 5 slots instead of 1. * sales: calculate initial proof at start of period reason: this ensures that the period (and therefore the challenge) doesn't change while we're calculating the proof * integration: fix proof parameters for tests Increased times due to waiting on next period. Fixed data to be of right size. Updated expected payout due to hosting 5 slots. * sales: wait for stable proof challenge When the block pointer is nearing the wrap-around point, we wait another period before calculating a proof. * fix merge conflict --------- Co-authored-by: Dmitriy Ryajov <dryajov@gmail.com> Co-authored-by: Eric <5089238+emizzle@users.noreply.github.com>
94 lines
2.1 KiB
Nim
94 lines
2.1 KiB
Nim
## Nim-Codex
|
|
## Copyright (c) 2022 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/options
|
|
|
|
import pkg/leopard
|
|
import pkg/stew/results
|
|
|
|
import ../backend
|
|
|
|
type
|
|
LeoEncoderBackend* = ref object of EncoderBackend
|
|
encoder*: Option[LeoEncoder]
|
|
|
|
LeoDecoderBackend* = ref object of DecoderBackend
|
|
decoder*: Option[LeoDecoder]
|
|
|
|
method encode*(
|
|
self: LeoEncoderBackend,
|
|
data,
|
|
parity: var openArray[seq[byte]]): Result[void, cstring] =
|
|
## Encode data using Leopard backend
|
|
|
|
if parity.len == 0:
|
|
return ok()
|
|
|
|
var encoder = if self.encoder.isNone:
|
|
self.encoder = (? LeoEncoder.init(
|
|
self.blockSize,
|
|
self.buffers,
|
|
self.parity)).some
|
|
self.encoder.get()
|
|
else:
|
|
self.encoder.get()
|
|
|
|
encoder.encode(data, parity)
|
|
|
|
method decode*(
|
|
self: LeoDecoderBackend,
|
|
data,
|
|
parity,
|
|
recovered: var openArray[seq[byte]]): Result[void, cstring] =
|
|
## Decode data using given Leopard backend
|
|
|
|
var decoder =
|
|
if self.decoder.isNone:
|
|
self.decoder = (? LeoDecoder.init(
|
|
self.blockSize,
|
|
self.buffers,
|
|
self.parity)).some
|
|
self.decoder.get()
|
|
else:
|
|
self.decoder.get()
|
|
|
|
decoder.decode(data, parity, recovered)
|
|
|
|
method release*(self: LeoEncoderBackend) =
|
|
if self.encoder.isSome:
|
|
self.encoder.get().free()
|
|
|
|
method release*(self: LeoDecoderBackend) =
|
|
if self.decoder.isSome:
|
|
self.decoder.get().free()
|
|
|
|
proc new*(
|
|
T: type LeoEncoderBackend,
|
|
blockSize,
|
|
buffers,
|
|
parity: int): LeoEncoderBackend =
|
|
## Create an instance of an Leopard Encoder backend
|
|
##
|
|
LeoEncoderBackend(
|
|
blockSize: blockSize,
|
|
buffers: buffers,
|
|
parity: parity)
|
|
|
|
proc new*(
|
|
T: type LeoDecoderBackend,
|
|
blockSize,
|
|
buffers,
|
|
parity: int): LeoDecoderBackend =
|
|
## Create an instance of an Leopard Decoder backend
|
|
##
|
|
LeoDecoderBackend(
|
|
blockSize: blockSize,
|
|
buffers: buffers,
|
|
parity: parity)
|