SigSerializer
Related Docs:
class SigSerializer
| package serialization
Represents cost of: 1) evaluating a polynomial 2) obtaining GF2_192 instance 3) converting it to array of bytes
Represents cost of: 1) evaluating a polynomial 2) obtaining GF2_192 instance 3) converting it to array of bytes
Represents cost of parsing UncheckedDiffieHellmanTuple node from proof bytes.
Represents cost of parsing UncheckedDiffieHellmanTuple node from proof bytes.
Represents cost of parsing UncheckedSchnorr node from proof bytes.
Represents cost of parsing UncheckedSchnorr node from proof bytes.
Represents cost of parsing GF2_192_Poly from proof bytes.
Represents cost of parsing GF2_192_Poly from proof bytes.
A size of challenge in Sigma protocols, in bits.
A size of challenge in Sigma protocols, in bits.
Number of bytes to represent any group element as byte array
Number of bytes to represent any group element as byte array
Verifier Step 2: In a top-down traversal of the tree, obtain the challenges for the children of every non-leaf node by reading them from the proof or computing them.
Verifier Step 2: In a top-down traversal of the tree, obtain the challenges for the children of every non-leaf node by reading them from the proof or computing them. Verifier Step 3: For every leaf node, read the response z provided in the proof.
sigma proposition which defines the structure of bytes from the reader
reader to extract challenges from
if non-empty, then the challenge has been computed for this node by its parent; else it needs to be read from the proof (via reader)
optional evaluator (can be null) which is used for profiling of operations.
When E is null, then profiling is turned-off and has no effect on
the execution.
An instance of UncheckedSigmaTree
HOTSPOT: don't beautify the code
Note, null is used instead of Option to avoid allocations.
Verifier Step 2: In a top-down traversal of the tree, obtain the challenges for the children of every non-leaf node by reading them from the proof or computing them.
Verifier Step 2: In a top-down traversal of the tree, obtain the challenges for the children of every non-leaf node by reading them from the proof or computing them. Verifier Step 3: For every leaf node, read the response z provided in the proof.
sigma proposition which defines the structure of bytes from the reader
proof to extract challenges from
optional evaluator (can be null) which is used for profiling of operations.
When E is null, then profiling is turned-off and has no effect on
the execution.
An instance of UncheckedTree i.e. either NoProof or UncheckedSigmaTree
Helper method to read requested or remaining bytes from the reader.
Helper method to read requested or remaining bytes from the reader.
Recursively traverses the given node and serializes challenges and prover messages to the given writer.
Recursively traverses the given node and serializes challenges and prover messages to the given writer. Note, sigma propositions and commitments are not serialized.
subtree to traverse
writer to put the bytes
if true, than node.challenge is serialized, and omitted otherwise.
Recursively traverses the given node and serializes challenges and prover messages to the given writer.
Recursively traverses the given node and serializes challenges and prover messages to the given writer. Note, sigma propositions and commitments are not serialized.
tree to traverse and serialize
the proof bytes containing all the serialized challenges and prover messages
(aka z values)
Log warning message using this class's logger.
Log warning message using this class's logger.