Overview of asset surjection proof.
parent
75b47a4748
commit
286e8ac44b

@ 53,6 +53,10 @@ _(TODO: QUESTION: How is it ensured that H<sub>A</sub> is a valid curve point? T




Since the committed values in the Pedersen commitments are unknowable to parties not privy to the blinding factors, there exists the possibility for a transaction resulting in two or more outputs to encode a negative value in one output and an excess positive value in the others, resulting in inflated (i.e., counterfeit) asset supply. To prevent this, transactions with more than a single output are required to provide a **range proof** for each output, which is a zeroknowledge proof that the committed value is in a finite range between zero and an upper bound that won't risk overflow into negative values. (Values are encoded as 256bit unsigned integers such that verylarge integers "wrap around" and behave as negatives. Range proofs typically prove that a committed amount can be represented in 64bits or less, affording no risk of overflow.) Under CA, the requirement to provide a range proof remains the same as under CT.




A new requirement in CA is the **asset surjection proof**. Similar to range proofs, ASPs prove that a validity contstraint is met on the blinded asset commitments of the transaction outputs. Specifically, it proves that the asset tags of the outputs match the asset tags of the inputs, without revealing what those tags are or which outputs correspond to which inputs. (TODO: preceding is imprecise.)




(TODO: discuss space requirments of ASPs, since they do add to transaction size. Compared to range proofs already included in CT transactions, however, they are comparatively small, except perhaps in the case of a large number of inputs and outputs in a single transaction.)




## Specifications




We propose to add the following three CA operations to the set of valid operations declared in graphene::chain::operation (chain/protocol/operations.hpp). The new CA operations are shown here side by side with their CT equivalents:




Loading…
Reference in New Issue