This section constructs the net value commitment of an Action, defines the transparent transaction value pool, the balancing value of each pool and the fee, and constructs the binding signature. Proposition 8.11 keeps apart an algebraic identity, under which the binding validating key is a known multiple of the randomness base exactly when a pool balances modulo p Vesta , and a knowledge statement, under which a valid binding signature forces balance modulo p Vesta .
Requirement R4 of “Requirements on a shielded payment” (§1.4) is met through the additive homomorphism of the Pedersen commitment (Crypto Guide, §“The Pedersen commitment”, Theorem “Additive homomorphism”). Each Action publishes a commitment to its net value; the group sum of a bundle’s commitments commits to the sum of the net values under the sum of the trapdoors, and a verifier compares that sum with the bundle’s public balancing value (§8.2) without learning any single value.
Let an Action consume a note of value v old and create a note of
value v new , both in
| v net := v old − v new ∈ { − 2 64 + 1, ..., 2 64 − 1 } . |
The value base and the randomness base are
| V Orchard | := GroupHash (z.cash:Orchard-cv, v), | ||
| R Orchard | := GroupHash (z.cash:Orchard-cv, r), |
the value-commitment rows of Table 3. For a trapdoor
| cv net := ValueCommit rcv Orchard (v net) := [v net mod p Vesta] V Orchard + [rcv] R Orchard ∈ E (F p Pallas) |
(protocol specification, §“Homomorphic Pedersen commitments (Sapling and Orchard)”).
Both bases have order p Vesta : the protocol specification types them as points of order p Vesta (§“Balance and Binding Signature (Orchard)”), a set that excludes O (§“Pallas and Vesta”). The specification defines ValueCommit Orchard on the signed integers
| { − p Vesta − 1 2, ..., p Vesta − 1 2 } |
(§“Commitment”), and a signed integer enters the scalar multiplication
as its residue modulo p Vesta (§2.1). Reduction
modulo p Vesta is injective on this domain, since two of its elements
differ by at most
For each Action the author of the transaction draws rcv uniformly from F p Vesta , by ValueCommit Orchard . GenTrapdoor , independently of every other value (protocol specification, §“Sending Notes (Orchard)” and §“Homomorphic Pedersen commitments (Sapling and Orchard)”). Unlike rcm , ψ and esk , which are derived from the note seed rseed (§4.3), the trapdoor rcv is derived from no note, and no note field, note plaintext (§10.1) or transaction field (§11.2) contains it. The author retains every rcv of the bundle; together they determine the binding signing key (§8.3).
The specification types the trapdoor as an integer in
With
Perfect hiding: for rcv uniform on F p Vesta and independent of v net , the commitment cv net is uniform on E (F p Pallas) , whatever v net is.
Computational binding: under Assumptions 2.22
and 2.8, no efficient algorithm outputs, except with
negligible probability, pairs (v, rcv) and (v ′, rcv ′) of an integer
and a trapdoor with
(i) This is the Crypto Guide’s Theorem “Perfect hiding”
(§“The Pedersen commitment”). Since
| [v − v ′] V Orchard − [rcv ′ − rcv] R Orchard = O, |
a relation with non-zero coefficient
Transparent inputs and transparent outputs are the cleartext value transfers of a transaction outside every shielded pool, with public amounts. Each transaction has a transparent transaction value pool: its transparent inputs add their values to it, and its transparent outputs remove theirs. The balancing value of each shielded pool, defined next for the two pools of the Orchard protocol, is also added to it (protocol specification, §“Transactions and Treestates”).
For each pool of the Orchard protocol, the Orchard pool or the Ironwood pool,
the balancing value v pool balance of a
transaction is its declared net value, in zatoshi, of the notes of the pool
that it consumes minus those that it creates: a signed integer in
In a correctly constructed transaction, v pool balance equals the sum of the net values v net of the pool’s Actions. A verifier cannot check this equation directly, since each v net is hidden in its cv net ; the binding signature (§8.3) enforces it.
The protocol specification, §“Transactions and Treestates”, states the
consensus rule: the value remaining in the transparent transaction value
pool must be non-negative. For a transaction other than a coinbase
transaction (Definition “Coinbase transaction”, §11.2) the
remaining value is the transaction fee (ibid.); no transaction field
encodes it (ZIP 229, “Transaction Format” and “Non-requirements”). The
pool of a coinbase transaction also receives, as implicit inputs, the block
subsidy and the fees of the block’s other transactions, and its outputs must
consume all of the value in it (protocol specification, §“Transactions and
Treestates” and §“Transaction Consensus Rules”). From NU7 it receives
only part of the fees: for F the total fee of the block’s other
transactions, ⌊ 6 F / 10 ⌋ , computed once for the block, is
removed from circulation, and the coinbase transaction receives
| marginal _ fee ⋅ max (grace _ actions, logical _ actions) zatoshi, | ||
| marginal _ fee = 5000, grace _ actions = 2, |
where logical _ actions is a sum of per-component contributions, in which each Ironwood-pool Action contributes one (the contribution nActionsIronwood ). The fee of the worked payment is computed in Example 11.16 (§11.5).
The balancing value is cleartext, so a negative one discloses the amount that enters the pool; the field names no receiving note or address.
A transaction T 1 has one transparent input, of 1 000 000 000 zatoshi, 10 ZEC, and of at most 150 bytes, no transparent output, and an Ironwood-pool bundle of two Actions, which creates one note n 1 , of the whole amount less a fee of 15 000 zatoshi, and one dummy note; its balancing value is
| valueBalanceIronwood = − (1 000 000 000 − 15 000) = − 999 985 000 . |
A later transaction T 2 has no transparent input, an Ironwood-pool bundle
of two Actions whose balancing value is 999 985 000 , and one transparent
output, of 999 970 000 zatoshi and of at most 34 bytes, which leaves a
fee of 15 000 zatoshi. Both fees are conventional: for the total sizes
s in and s out in bytes of a transaction’s
transparent inputs and outputs, ZIP 317 adds to logical _ actions
the transparent contribution max (⌈ s in / 150 ⌉, ⌈ s out / 34 ⌉) , which is 1 for each transaction, so
with its two Actions each fee is
It does not learn that T 2 consumed n 1 . Under the preconditions of Theorem 12.13 (“Privacy”, §12.4), the public data of the bundle of T 2 are computationally indistinguishable from those of a bundle with the same public leakage that consumes other leaves of the tree at its anchor, notes of other values included, while n 1 stays unconsumed. In particular the extracted commitment of n 1 hides its recipient and value (Proposition 4.8), a nullifier of T 2 is not linkable to a leaf (Proposition 6.10), and the anchor of T 2 confines its consumed notes only to the leaves of the anchored tree (Remark “Anchor choice as public data”, §5.2). The equal amounts are a correlation, which an observer may weigh with the timing of the two transactions and with how rarely the amount occurs; they are not a path from the leaf of n 1 to a nullifier of T 2 , which the public data do not contain. ZIP 229, Privacy Implications, records this disclosure of the amounts that cross between pools.
Fix a pool of the Orchard protocol and a transaction whose bundle for that
pool has
The binding signing key of the bundle is
| bsk := rcv 1 + ⋯ + rcv n ∈ F p Vesta |
(protocol specification, §“Balance and Binding Signature (Orchard)”). By the additive homomorphism (Crypto Guide, §“The Pedersen commitment”, Theorem “Additive homomorphism”),
| ∑ i = 1 n cv i net = [∑ i = 1 n v i net] V Orchard + [bsk] R Orchard, | (6) |
the integer sum entering as its residue modulo p Vesta .
The verifier computes, from public fields only, the binding validating key
| bvk := (∑ i = 1 n cv i net) − [v balance] V Orchard, |
where the subtracted point is ValueCommit 0 Orchard (v balance) , the commitment with zero trapdoor, and v balance , an element of the domain of ValueCommit Orchard , enters as its residue modulo p Vesta . No transaction field encodes bvk (protocol specification, §“Balance and Binding Signature (Orchard)”).
An opening of a net value commitment cv i net is a
pair (v i ′, r i ′) of an integer v i ′ and a scalar
For the bundle fixed above:
Identity. If
| bvk − [bsk] R Orchard = [∑ i = 1 n v i net − v balance] V Orchard ; |
hence
Knowledge. Let (v i ′, r i ′) be an opening of
cv i net for every i , and let
| (b − ∑ i = 1 n r i ′) D − 1 mod p Vesta |
is the discrete logarithm of V Orchard to the base R Orchard , a relation between two values of GroupHash .
Consequently, under Assumptions 2.22, 2.8
and 7.3, an efficient party that outputs the net value
commitments and the balancing value of a bundle, openings (v i ′, r i ′) of
every cv i net and a binding signature under the resulting
bvk on a message of its choice satisfies
(i) Expanding each cv i net by
Definition 8.2 and applying the additive homomorphism
gives (6); subtracting
[v balance] V Orchard gives the identity. Since
V Orchard has prime order p Vesta , the point
[c] V Orchard is O if and only if
(ii) By the homomorphism,
| [D] V Orchard = [b − ∑ i = 1 n r i ′] R Orchard, |
and D is invertible modulo the prime p Vesta . This is Part 2 of the
proof of the Crypto Guide’s Theorem “The binding signature is a
proof of knowledge of log P B ” (§“Binding signatures as a proof of
knowledge of a discrete logarithm”), with
Consequence. Let an efficient party A output, with probability
ε , a bundle’s net value commitments and balancing value, openings
of every commitment, a message and a binding signature on it under the
resulting bvk , with D non-zero modulo p Vesta ; this event
is efficiently decidable from the output. If
The openings are obtained, and the congruence is promoted to an equality of integers, in Lemma 12.3 and Theorem 12.4 (§12.1).
The binding signature scheme BindingSig Orchard is the binding-signature instance of RedPallas (§7.1): RedPallas on the base R Orchard , without key re-randomisation; its base differs from the spend-authorisation base G SpendAuth . The author of the transaction computes bsk from the trapdoors it retains and signs with it; the verifier recomputes bvk from the public fields and validates the signature under it (protocol specification, §“Binding Signature (Sapling and Orchard)” and §“Balance and Binding Signature (Orchard)”). The signed message is the signature digest SigHash constructed in “Transaction digests and signatures” (§11.3); which transaction data the signatures fix is stated there, in Proposition 11.10.
For an honestly constructed bundle with
The construction runs once for each pool of the Orchard protocol. A transaction carries a balancing value and a binding signature, bindingSigOrchard or bindingSigIronwood, for each pool whose bundle has at least one Action. Each pool’s bvk sums only that pool’s net value commitments and subtracts only that pool’s balancing value; both pools use ValueCommit Orchard with the bases V Orchard and R Orchard , and BindingSig Orchard . The consensus rule of the protocol specification, §“Transaction Consensus Rules” (ZIP 229, “Consensus Rules”), is: if a pool’s bundle has Actions, its binding signature must be a valid signature of SigHash under that pool’s bvk . Validation rejects a non-canonical encoding of the signature’s point component (§7.1; protocol specification, §“RedDSA, RedJubjub, and RedPallas”).