Specification 
The Orchard protocol MUST be implemented as specified in the Zcash Protocol Specification .
Given that the Orchard protocol largely follows the design of the Sapling protocol, we provide here a list of differences, with references to their normative specifications and associated design rationale.
Curves 
The Orchard protocol uses the Pallas / Vesta curve cycle, in place of BLS12-381 and its embedded curve Jubjub:
- Pallas is used as the "application curve", on which the Orchard protocol itself is implemented (c/f Jubjub).
- Vesta is used as the "circuit curve"; its scalar field (being the base field of Pallas) is the "word" type over which the circuit is implemented (c/f BLS12-381).
We use the "simplified SWU" algorithm to define an infallible
GroupHash
, instead of the fallible BLAKE2s-based mechanism used for Sapling. It is intended to follow (version 10 of) the IETF hash-to-curve Internet Draft (but the protocol specification takes precedence in the case of any discrepancy).
The presence of the curve cycle is an explicit design choice. This proposal only uses half of the cycle (Pallas being an embedded curve of Vesta); the full cycle is expected to be leveraged by future protocol updates.
- Curve specifications:
-
GroupHash
:
- Supporting evidence:
Proving system 
Orchard uses the Halo 2 proving system with the PLONKish arithmetization , instead of Groth16 and R1CS.
This proposal does not make use of Halo 2's support for recursive proofs, but this is expected to be leveraged by future protocol updates.
Circuit 
Orchard uses a single circuit for both spends and outputs, similar to Sprout. An "action" contains both a single (possibly dummy) note being spent, and a single (possibly dummy) note being created.
An Orchard transaction contains a "bundle" of actions, and a single Halo 2 proof that covers all of the actions in the bundle.
- Action description:
- Circuit statement:
- Design rationale:
Commitments 
The Orchard protocol has equivalent commitment schemes to Sapling. For non-homomorphic commitments, Orchard uses the PLONKish-efficient Sinsemilla in place of Bowe–Hopwood Pedersen hashes.
- Sinsemilla hash function:
- Sinsemilla commitments:
- Design rationale:
Commitment tree 
Orchard uses an identical commitment tree structure to Sapling, except that we instantiate it with Sinsemilla instead of a Bowe–Hopwood Pedersen hash.
- Design rationale and considered alternatives:
Keys and addresses 
Orchard keys and payment addresses are structurally similar to Sapling, with the following changes:
- The proof authorizing key is removed, and
nk
is now a field element.
-
ivk
is computed as a Sinsemilla commitment instead of a BLAKE2s output. There is an additional
rivk
component of the full viewing key that acts as the randomizer for this commitment.
-
ovk
is derived from
fvk
, instead of being a component of the spending key.
- All diversifiers now result in valid payment addresses.
There is no Bech32 encoding defined for an individual Orchard shielded payment address, incoming viewing key, or full viewing key. Instead we define unified payment addresses and viewing keys in . Orchard spending keys are encoded using Bech32m as specified in .
Orchard keys may be derived in a hierarchical deterministic (HD) manner. We do not adapt the Sapling HD mechanism from ZIP 32 to Orchard; instead, we define a hardened-only derivation mechanism (similar to Sprout).
- Key components diagram:
- Key components specification:
- Encodings:
- HD key derivation specification:
- Design rationale:
Notes 
Orchard notes have the structure
(addr,v,ρ,φ,rcm).
ρ
is set to the nullifier of the spent note in the same action, which ensures it is unique.
φ
and
rcm
are derived from a random seed (as with Sapling after ZIP 212 ).
Nullifiers 
Nullifiers for Orchard notes are computed as:
nf=[Fnk(ρ)+φ(modp)]G+cm
where
F
is instantiated with Poseidon, and
G
is a fixed independent base.
- Poseidon:
- Design rationale and considered alternatives:
Signatures 
Orchard uses RedPallas (RedDSA instantiated with the Pallas curve) as its signature scheme in place of Sapling's RedJubjub (RedDSA instantiated with the Jubjub curve).
Additional Rationale 
The primary motivator for proposing a new shielded protocol and pool is the need to migrate spend authority to a recursion-friendly curve. Spend authority in the Sapling shielded pool is rooted in the Jubjub curve, but there is no known way to construct an efficient curve cycle (or path to one) from either Jubjub or BLS12-381.
Despite having recursion-friendliness as a design goal, we do not propose a recursive protocol in this ZIP. Deploying an entire scaling solution in a single upgrade would be a risky endeavour with a lot of moving parts. By focusing just on the components that enable a recursive protocol (namely the curve cycle and the proving system), we can start the migration of value to a scalable protocol before actually deploying the scalable protocol itself.
The remainder of the changes we make relative to Sapling are motivated by simplifying the Sapling protocol (and fixing deficiencies), and using protocol primitives that are more efficient in the UltraPLONK arithmetization.