object FiatShamirTree
- Alphabetic
- By Inheritance
- FiatShamirTree
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
val
ToBytes_DHT: OperationCostInfo[FixedCost]
Represents cost of serializing UncheckedDiffieHellmanTuple or UnprovenDiffieHellmanTuple node of ProofTree.
-
final
val
ToBytes_ProofTreeConjecture: OperationCostInfo[FixedCost]
Represents cost of serializing ProofTreeConjecture node of ProofTree.
-
final
val
ToBytes_Schnorr: OperationCostInfo[FixedCost]
Represents cost of serializing UncheckedSchnorr or UnprovenSchnorr node of ProofTree.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
val
internalNodePrefix: Byte
Prefix byte which is put before the other ProofTreeConjecture serialized bytes.
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
val
leafPrefix: Byte
Prefix byte which is put before the other ProofTreeLeaf serialized bytes.
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toBytes(tree: ProofTree, w: SigmaByteWriter)(implicit E: ErgoTreeEvaluator): Unit
Prover Step 7: Convert the tree to a byte array
s
for input to the Fiat-Shamir hash function.Prover Step 7: Convert the tree to a byte array
s
for input to the Fiat-Shamir hash function. The conversion should be such that the tree can be unambiguously parsed and restored given the array. For each non-leaf node, the string should contain its type (OR or AND). For each leaf node, the string should contain the Sigma-protocol statement being proven and the commitment. The string should not contain information on whether a node is marked "real" or "simulated", and should not contain challenges, responses and/or the real/simulated flag for any node.- tree
the tree to take commitments from
- w
writer which is used for serialization
- E
optional evaluator (can be null) which is used for profiling of operations. When
E
isnull
, then profiling is turned-off and has no effect on the execution. HOTSPOT: don't beautify the code
-
def
toBytes(tree: ProofTree)(implicit E: ErgoTreeEvaluator): Array[Byte]
Prover Step 7: Convert the tree to a byte array
s
for input to the Fiat-Shamir hash function.Prover Step 7: Convert the tree to a byte array
s
for input to the Fiat-Shamir hash function. See the other overload for detailed docs. -
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()