Checked (mina_base.Mina_base.Pending

type var = Hash.var

type path

module Address : sig ... end

type Snarky_backendless.Request.t +=

| Coinbase_stack_path : Address.value -> path Snarky_backendless.Request.t

| Get_coinbase_stack : Address.value -> (Stack.t * path)
                                        Snarky_backendless.Request.t

| Set_coinbase_stack : Address.value
  * Stack.t -> unit Snarky_backendless.Request.t

| Set_oldest_coinbase_stack : Address.value
  * Stack.t -> unit Snarky_backendless.Request.t

| Find_index_of_newest_stacks : Update.Action.t -> (Address.value * Address.value)
                                                   Snarky_backendless.Request.t

| Find_index_of_oldest_stack : Address.value Snarky_backendless.Request.t

| Get_previous_stack : State_stack.t Snarky_backendless.Request.t

val get : 
  depth:int ->
  var ->
  Address.var ->
  Stack.var Snark_params.Tick.Checked.t

val add_coinbase : 
  constraint_constants:Genesis_constants.Constraint_constants.t ->
  var ->
  Update.var ->
  coinbase_receiver:Signature_lib.Public_key.Compressed.var ->
  supercharge_coinbase:Snark_params.Tick.Boolean.var ->
  State_body_hash.var ->
  var Snark_params.Tick.Checked.t

update_stack t ~is_new_stack updated_stack implements the following spec:

gets the addressaddr of the latest stack or a new stack
finds a coinbase stack in t at path addr and pushes the coinbase_data on to the stack
returns a root t' of the tree

val pop_coinbases : 
  constraint_constants:Genesis_constants.Constraint_constants.t ->
  var ->
  proof_emitted:Snark_params.Tick.Boolean.var ->
  (var * Stack.var) Snark_params.Tick.Checked.t

pop_coinbases t pk updated_stack implements the following spec:

gets the addressaddr of the oldest stack.
finds a coinbase stack in t at path addr and replaces it with empty stack if a proof_emitted is true
returns a root t' of the tree