Anoma.RM.Transparent.ProvingSystem.RLPS (Anoma v0.32.0)

I am the resource logic proving system module for the TRM.

I provide the interface for everything that has to do with the TRM resource logic proving.

Public API

I have the following public functionality

Summary

Types

t()

Functions

from_noun(list)
match_resource(tag, bool)

I am a function to matching the resource form the tag provided.

prove(_, _, _)

I am the TRM resource logic proving system prove interface.

to_noun_rl_args(instance)

I am function for turning a resource logic proving system instance to a resource logic format for transparent RM.

verify(jammed_predicate, instance, arg)

I am the verification function of the TRM resource logic proving system.

Types

Link to this type

t()

@type t() :: %Anoma.RM.Transparent.ProvingSystem.RLPS{
  instance: Anoma.RM.Transparent.ProvingSystem.RLPS.Instance.t(),
  proof: <<_::0>>,
  proving_key: binary(),
  verifying_key: binary(),
  witness: <<_::0>>
}

Functions

Link to this function

from_noun(list)

@spec from_noun(Noun.t()) :: {:ok, t()} | :error
Link to this function

match_resource(tag, bool)

@spec match_resource(integer(), boolean()) ::
  {:ok, Anoma.RM.Transparent.Resource.t()} | {:error, String.t()}
@spec match_resource(integer(), boolean()) ::
  {:ok, Anoma.RM.Transparent.Resource.t()} | {:error, String.t()}

I am a function to matching the resource form the tag provided.

In particular, given a flag I try to un-match the jammed resource from the commitment or nullifier.

Link to this function

prove(_, _, _)

@spec prove(<<_::0>>, Anoma.RM.Transparent.ProvingSystem.RLPS.Instance.t(), <<_::0>>) ::
  <<_::0>>

I am the TRM resource logic proving system prove interface.

As we are in the transparent case, this is always trivial.

Link to this function

to_noun_rl_args(instance)

@spec to_noun_rl_args(Anoma.RM.Transparent.ProvingSystem.RLPS.Instance.t()) ::
  Noun.t()

I am function for turning a resource logic proving system instance to a resource logic format for transparent RM.

Instead of the pure instance, I supply to the logic underlying resource plaintexts which we can get as we are dealing with commitments and nullifiers transparently.

Link to this function

verify(jammed_predicate, instance, arg)

@spec verify(binary(), Anoma.RM.Transparent.ProvingSystem.RLPS.Instance.t(), <<_::0>>) ::
  boolean()

I am the verification function of the TRM resource logic proving system.

I accept a jammed predicate as my verifying key. I first check that it can be cued, then make sure that the key corresponds to the resource, after which I run the jammed logic on the instance.