SigSerializer

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

9. final def getClass(): Class[_]

   

   Definition Classes

   AnyRef → Any

10. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

11. val hashSize: Int

    

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

13. lazy val logger: Logger

    

    Attributes

    protected

    Definition Classes

    LazyLogging

14. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

15. final def notify(): Unit

    

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

17. val order: Int

    

18. def parseAndComputeChallenges(exp: SigmaBoolean, r: SigmaByteReader, challengeOpt: Challenge = null): UncheckedSigmaTree

    

    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.

    exp

    sigma proposition which defines the structure of bytes from the reader

    r

    reader to extract challenges from

    challengeOpt

    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)

    returns

    An instance of UncheckedSigmaTree HOTSPOT: don't beautify the code Note, null is used instead of Option to avoid allocations.

19. def parseAndComputeChallenges(exp: SigmaBoolean, proof: Array[Byte]): UncheckedTree

    

    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.

    exp

    sigma proposition which defines the structure of bytes from the reader

    proof

    proof to extract challenges from

    returns

    An instance of UncheckedTree i.e. either NoProof or UncheckedSigmaTree

20. def readBytesChecked(r: SigmaByteReader, numRequestedBytes: Int, onError: (String) ⇒ Unit): Array[Byte]

    

    Helper method to read requested or remaining bytes from the reader.

21. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

22. def toProofBytes(node: UncheckedSigmaTree, w: SigmaByteWriter, writeChallenge: Boolean): Unit

    

    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.

    node

    subtree to traverse

    w

    writer to put the bytes

    writeChallenge

    if true, than node.challenge is serialized, and omitted otherwise.

23. def toProofBytes(tree: UncheckedTree): Array[Byte]

    

    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

    tree to traverse and serialize

    returns

    the proof bytes containing all the serialized challenges and prover messages (aka z values)

24. def toString(): String

    

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

28. def warn(msg: String): Unit

    

    Log warning message using this class's logger.