UnprovenTree

abstract def canEqual(that: Any): Boolean

abstract val challengeOpt: Option[Array[Byte]]

Challenge used by the prover.

abstract val position: NodePosition

Position of the node in the tree, see comments for position field in sigmastate.interpreter.Hint

abstract def productArity: Int

abstract def productElement(n: Int): Any

abstract val proposition: SigmaBoolean

Node's sigma-protocol statement to be proven.

abstract val simulated: Boolean

Whether the node represents simulated sigma-protocol

abstract def withChallenge(challenge: Challenge): UnprovenTree

abstract def withPosition(updatedPosition: NodePosition): UnprovenTree

abstract def withSimulated(newSimulated: Boolean): UnprovenTree

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def productIterator: Iterator[Any]

def productPrefix: String

def real: Boolean

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit