Convert Circuit

Convert Circuit Description

The high-level description of Convert can be found Brun and mint.

The Convert provides a mechanism that burning and minting of assets can be enabled by adding Convert Value Vommitments in transaction and ensuring the homomorphic sum of Spend, Output and Convert value commitments to be zero.

The Convert value commitment is constructed from AllowedConversion which was published earlier in AllowedConversion Tree. The AllowedConversion defines the allowed conversion assets. The AllowedConversion Tree is a merkle hash tree stored in the ledger.

AllowedConversion

An AllowedConversion is a compound asset type in essence, which contains distinct asset types and the corresponding conversion ratios.

AllowedConversion is an array of tuple $\{(t_1,v_1^{ratio}),(t_2,v_2^{ratio})...(t_n,v_n^{ratio})\}$

• $t$: ${\mathbb{B}}^{l_t}$ is a bytestring representing the asset identifier of the note.
• $v^{ratio}$: $v^{ratio}$ is a signed 64-bit integer in the range $\{-2^{63}..2^{63}-1\}$.

Calculate:

• $v{b}_i:=rep{r}_{\mathbb{J}}(PR{F}^{vcgMASP}(t_i))$
• $v{b}^{allowedconversion}={\Sigma }_1^n([v_i^{ratio}]v{b}_i)$
• $c{m}^{allowedconversion}=\mathsf{PedersenHashToPoint}{(}^{\prime \prime }MASP\_\_P{H}^{\prime \prime },[1{]}^6||v{b}^{allowedconversion})$

Note that PedersenHashToPoint is used the same as in NoteCommitment for now.

An AllowedConversion can be issued, removed and modified as public conversion rule by consensus authorization and stored in AllowedConversion Tree as leaf node.

An AllowedConversion can be used by proving the existence in AllowedConversion Tree(must use the latest root anchor), and then generating a Convert Value Commitment to be used in transaction.

Convert Value Commitment

Convert Value Commitment is a tuple $(v{b}^{allowedconversion},v^{convert},rc{v}^{convert})$

• $v^{convert}$: $v^{convert}$ is an unsigned integer representing the value of conversion in range $\{\mathrm{0..}{2}^{64}-1\}$.

Choose independent uniformly random commitment trapdoors:

• $rc{v}^{convert}$ $\leftarrow \mathsf{ValueCommit}.GenTrapdoor()$

Check that $h_{\mathbb{J}}rep{r}_{\mathbb{J}}(PR{F}^{vcgMASP}(v{b}^{allowedconversion}))$ is of type $K{A}^{Sapling}.PublicPrimeOrder$, i.e. it is a valid ctEdwards Curve point on the JubjubCurve (as defined in the original Sapling specification) not equal to $O_{\mathbb{J}}$. If it is equal to $O_{\mathbb{J}}$, $v{b}^{allowedconversion}$ is an invalid asset identifier.

Calculate

• $c{v}^{convert}=[v^{convert}{h}_{\mathbb{J}}]v{b}^{allowedconversion}+[rc{v}^{convert}]{\mathsf{GroupHash}}_{\mathsf{URS}}^{{\mathbb{J}}^{(\mathsf{r})\ast }}{(}^{\prime \prime }MASP\_\_r{\_}^{\prime \prime }{,}^{\prime \prime }{r}^{\prime \prime })$

Note that ${\mathsf{GroupHash}}_{\mathsf{URS}}^{{\mathbb{J}}^{(\mathsf{r})\ast }}{(}^{\prime \prime }MASP\_\_r{\_}^{\prime \prime }{,}^{\prime \prime }{r}^{\prime \prime })$ is used the same as in NoteCommitment for now.

AllowedConversion Tree

AllowedConversion Tree has the same structure as Note Commitment Tree and is an independent tree stored in ledger.

• $\mathsf{MerkleDept}{\mathsf{h}}^{\mathsf{Convert}}$: 32(for now)
• leaf node: $c{m}^{allowedconversion}$

Convert Statement

The Convert circuit has 47358 constraints.

Let $l_{MerkleSapling}$, $l_{scalar}$, $\mathsf{ValueCommit}$, $\mathsf{PedersenHashToPoint}$, ${\mathsf{GroupHash}}_{\mathsf{URS}}^{{\mathbb{J}}^{(\mathsf{r})\ast }}$, $\mathbb{J}$ be as defined in the original Sapling specification.

A valid instance of ${\pi }_{convert}$ assures that given a primary input:

• $r{t}^{convert}:{\mathbb{B}}^{l_{MerkleSapling}}$
• $c{v}^{convert}:ValueCommit.Output$

the prover knows an auxiliary input:

• $path:{\mathbb{B}}^{[l_{Merkle}][MerkleDept{h}^{Convert}]}$
• $pos:(\mathrm{0..}{2}^{MerkleDept{h}^{Convert}}-1)$
• $c{m}^{allowedconversion}:{\mathbb{B}}^{MerkleSapling}$
• $v{b}^{allowedconversion}:\mathbb{J}$
• $rc{v}^{convert}:\{\mathrm{0..}{2}^{l_{scalar}}-1\})$
• $v^{convert}:\{\mathrm{0..}{2}^{l_{convert\_value}}-1\}$

such that the following conditions hold:

• AllowedConversion cm integrity: $c{m}^{allowedconversion}=\mathsf{PedersenHashToPoint}{(}^{\prime \prime }MASP\_\_P{H}^{\prime \prime },[1{]}^6||v{b}^{allowedconversion})$

• Merkle path validity: Either $v^{convert}$ is 0; or $(path,pos)$ is a valid Merkle path of depth $MerkleDept{h}^{Convert}$, as as defined in the original Sapling specification, from $c{m}^{allowedconversion}$ to the anchor $r{t}^{convert}$

• Small order checks: $v{b}^{allowedconversion}$ is not of small order, i.e.$[h_{\mathbb{J}}]v{b}^{allowedconversion}\ne O_{\mathbb{J}}$.

• Convert Value Commitment integrity: $c{v}^{convert}=[v^{convert}{h}_{\mathbb{J}}]v{b}^{allowedconversion}+[rc{v}^{convert}]{\mathsf{GroupHash}}_{\mathsf{URS}}^{{\mathbb{J}}^{(\mathsf{r})\ast }}{(}^{\prime \prime }MASP\_\_r{\_}^{\prime \prime }{,}^{\prime \prime }{r}^{\prime \prime })$

Return $(c{v}^{convert},r{t}^{convert},{\pi }_{convert})$

Notes:

• Public and auxiliary inputs MUST be constrained to have the types specified. In particular, see the original Sapling specification, for required validity checks on compressed representations of Jubjub curve points. The ValueCommit.Output type also represents points, i.e. $\mathbb{J}$.
• In the Merkle path validity check, each layer does not check that its input bit sequence is a canonical encoding(in {$\mathrm{0..}{r}_{\mathbb{S}}-1$}) of the integer from the previous layer.

Incentive Description

Incentive system provide a mechanism in which the old asset(input) is burned, the new asset(output) is minted with the same quantity and incentive asset(reward) is minted with the convert ratio meanwhile.

Incentive AllowedConversion Tree

As described in Convert circuit, the AllowedConversion Tree is an independent merkle tree in the ledger and contains all the Incentive AllowedConversions.

Incentive AllowedConversion Struct

In general, there are three items in Incentive AllowedConversion Struct(but not mandatory？),i.e. input, output and reward. And each item has an asset type and a quantity(i64, for the convert ratio).

Note that the absolute value of input and output must be consistent in incentive system. The quantity of input is negative and the quantity of output is positive.

To guarantee the input and output to be open as the same asset type in future unshielding transactions, the input and output assets have the same prefix description(e.g. BTC_1, BTC_2...BTC_n). And to prevent repeated shielding and unshielding and encourage long-term contribution to privacy pool, the postfix timestamp is used to distinct the input and output assets. The timestamp is depended on the update period and can be defined flexibly(e.g. date, epoch num). When new timestamp occurs, the AllowedConversion will be updated to support all the "history asset" conversion to the latest one.

Incentive AllowedConversion Operatioin

Incentive AllowedConversion is governed by incentive system, who will be in charge of issuing new incentive plan, updating(modifying) to the latest timestamp and destroying the disabled.

• Issue
  • Issue a new incentive plan for new asset.
  • Issue for the last latest AllowedConversion when new timestamp occurs.
• Update
  • For every new timestamp occurs, updating the existing AllowedConversion. Keep the input still, update the output to the latest asset and modify the reward quantity according to the ratio.
• Destroy
  • Detele the AllowedConversion from the tree.
• Query Service
  • A service for querying the latest AllowedConversion, return (anchor, path, AllowedConversion).

Workflow from User's Perspective

• Shielding transaction
  • Query the latest timestamp for target asset(non-latest will be rejected in tx execution)
  • Construct a target shielded note and shielding tx
  • Add the note to shielded pool if tx executes successfully(check the prefix and the latest timestamp).
• Converting transaction
  • Construct spend notes from shielded notes
  • Construct convert notes(query the latest AllowedConversion)
  • Construct output notes
  • Construct convert tx
  • Get incentive output notes with latest timestamp and rewards if tx executes successfully
• Unshielding transaction
  • Construct unshielding transaction
  • Get unshielded note if tx executes successfully(check the prefix)