voting_circuits/delegation/

builder.rs

//! Multi-note delegation bundle builder.
//!
//! Orchestrates the creation of a complete delegation proof:
//! a single merged circuit proving all 15 conditions for up to
//! `circuit::MAX_REAL_NOTES` notes.
//! Handles padding unused note slots with zero-value notes that still carry
//! valid IMT non-membership proofs against the real tree root.

use ff::{Field, PrimeField, PrimeFieldBits};
use group::{Curve, GroupEncoding};
use halo2_proofs::circuit::Value;
use pasta_curves::{
    arithmetic::{CurveAffine, CurveExt},
    pallas,
};
use rand::{CryptoRng, RngCore};
use std::{iter, vec::Vec};

use orchard::{
    constants::{
        fixed_bases::{COMMIT_IVK_PERSONALIZATION, NOTE_COMMITMENT_PERSONALIZATION},
        L_ORCHARD_BASE, L_VALUE,
    },
    keys::{FullViewingKey, Scope, SpendValidatingKey},
    note::{commitment::ExtractedNoteCommitment, nullifier::Nullifier, Note, RandomSeed, Rho},
    spec::NonIdentityPallasPoint,
    tree::MerklePath,
    value::NoteValue,
};

use super::{
    circuit::{self, rho_binding_hash, van_commitment_hash, NoteSlotWitness},
    imt::{derive_nullifier_domain, gov_null_hash, ImtProofData, ImtProvider},
};
use crate::circuit::elgamal::base_to_scalar;
use crate::protocol_hash::poseidon_hash_2;

// Hash-to-curve personalization for synthetic padding `g_d_pad` points.
//
// Domain-separated from Orchard's `KEY_DIVERSIFICATION_PERSONALIZATION`
// (`"z.cash:Orchard-gd"`) so that `g_d_pad = hash_to_curve(PADDING_PERSONALIZATION)(...)`
// is not generated by the same diversified-address construction as real Orchard
// bases. Any accidental point collision is treated as a negligible hash-to-curve
// collision rather than a burned diversifier-index overlap.
pub(crate) const PADDING_PERSONALIZATION: &str = "shielded-vote/padding-v1";

/// Rho and rseed for a single padded note, captured during Phase 1 (PCZT construction).
#[derive(Clone, Debug)]
pub struct PaddedNoteData {
    /// Rho bytes (32 bytes, LE encoding of pallas::Base).
    pub rho: [u8; 32],
    /// Random seed bytes (32 bytes).
    pub rseed: [u8; 32],
}

/// Randomness captured during Phase 1 (PCZT construction) that must be reused
/// in Phase 2 (ZK proving) so the prover commits to the same nf_signed/cmx_new
/// that the signer committed to via the ZIP-244 sighash.
#[derive(Clone, Debug)]
pub struct PrecomputedRandomness {
    /// Rho + rseed for each padded note (0–4 entries).
    pub padded_notes: Vec<PaddedNoteData>,
    /// Rseed for the signed (keystone) note.
    pub rseed_signed: [u8; 32],
    /// Rseed for the output note.
    pub rseed_output: [u8; 32],
}

/// Which precomputed note input failed validation.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum PrecomputedRandomnessLocation {
    /// A padded note entry by index in `PrecomputedRandomness::padded_notes`.
    PaddedNote(usize),
    /// The synthetic signed note.
    SignedNote,
    /// The output note.
    OutputNote,
}

/// Input for a single real note in the delegation.
#[derive(Debug)]
pub struct RealNoteInput {
    /// The note being delegated.
    pub note: Note,
    /// The note's full viewing key.
    pub fvk: FullViewingKey,
    /// Merkle authentication path for the note commitment.
    pub merkle_path: MerklePath,
    /// IMT non-membership proof for this note's nullifier.
    ///
    /// This must satisfy [`ImtProofData`]'s tree contract and authenticate to
    /// the same nullifier IMT root used for the bundle.
    pub imt_proof: ImtProofData,
    /// Whether this note uses the internal (change) or external scope.
    pub scope: Scope,
}

/// Complete delegation bundle: a single circuit proving all 15 conditions.
#[derive(Debug)]
pub struct DelegationBundle {
    /// The merged delegation circuit.
    pub circuit: circuit::Circuit,
    /// Public inputs (14 field elements).
    pub instance: circuit::Instance,
}

// `ExtractP` from the Orchard spec: the x-coordinate of a non-identity Pallas
// point. Panics on identity.
// Note: Orchard's `spec::extract_p` is `pub(crate)`; we mirror it here.
fn point_x(point: &pallas::Point) -> pallas::Base {
    point_x_opt(point).expect("ExtractP requires a non-identity Pallas point")
}

fn point_x_opt(point: &pallas::Point) -> Option<pallas::Base> {
    point
        .to_affine()
        .coordinates()
        .into_option()
        .map(|coords| *coords.x())
}

// Expands a 32-byte compressed encoding into a stream of little-endian bits.
// Orchard’s note commitment hashes `g_d` and `pk_d` as
// little-endian bits of their 32-byte compressed encodings.
fn byte_bits(bytes: [u8; 32]) -> impl Iterator<Item = bool> {
    bytes
        .into_iter()
        .flat_map(|byte| (0..8).map(move |bit| ((byte >> bit) & 1) == 1))
}

// Expands a 64-bit little-endian integer into a stream of little-endian bits.
// Orchard’s note commitment hashes `value` as a 64-bit little-endian integer.
fn u64_bits(value: u64) -> impl Iterator<Item = bool> {
    value
        .to_le_bytes()
        .into_iter()
        .flat_map(|byte| (0..8).map(move |bit| ((byte >> bit) & 1) == 1))
}

// Derives the external IVK scalar from the full viewing key and spend validating key.
// Used to construct padding `(g_d_pad, pk_d_pad)` pairs such that the in-circuit
// `pk_d = [selected_ivk] * g_d` check (condition 11) holds against the same ivk
// the circuit derives in condition 5. Padding always uses `is_internal = false`,
// so the external rivk is the correct scope.
// Note: Orchard's `FullViewingKey::to_ivk` does not expose the inner Ivk scalar;
// if it did (e.g. `fvk.ivk_scalar(scope)`), we could drop this re-implementation.
pub(crate) fn external_ivk_scalar(fvk: &FullViewingKey, ak: &SpendValidatingKey) -> pallas::Scalar {
    let ak_point: pallas::Point = ak.into();
    let ak_x = point_x(&ak_point);
    let rivk = fvk.rivk(Scope::External).inner();
    let domain = sinsemilla::CommitDomain::new(COMMIT_IVK_PERSONALIZATION);
    let ivk = domain
        .short_commit(
            iter::empty()
                .chain(ak_x.to_le_bits().iter().by_vals().take(L_ORCHARD_BASE))
                .chain(
                    fvk.nk()
                        .inner()
                        .to_le_bits()
                        .iter()
                        .by_vals()
                        .take(L_ORCHARD_BASE),
                ),
            &rivk,
        )
        .expect("external ivk must not be bottom");
    base_to_scalar(ivk).expect("external ivk must fit in the scalar field")
}

// Wraps a `pallas::Point` as `NonIdentityPallasPoint` without panicking on identity.
//
// Synthesized padding points come from `hash_to_curve` and scalar multiplication
// by `ivk`; both are cryptographically non-identity (identity from `hash_to_curve`
// is negligible, and `ivk = 0` is already rejected by `CommitIvk`'s ⊥ branch upstream).
// We validate here so the invariant fails at the construction site rather than
// silently flowing into the witness — the in-circuit `NonIdentityPoint::new`
// would catch identity at proof time, but a build-time error is cheaper to debug.
fn non_identity_padding_point(
    point: pallas::Point,
    slot_index: usize,
    component: &'static str,
) -> Result<NonIdentityPallasPoint, DelegationBuildError> {
    NonIdentityPallasPoint::from_bytes(&point.to_affine().to_bytes())
        .into_option()
        .ok_or(DelegationBuildError::InvalidPaddingPoint {
            slot_index,
            component,
        })
}

fn validate_padding_slot_index(slot_index: usize) -> Result<(), DelegationBuildError> {
    if (1..circuit::MAX_REAL_NOTES).contains(&slot_index) {
        Ok(())
    } else {
        Err(DelegationBuildError::InvalidPaddingSlotIndex { slot_index })
    }
}

// Derives the synthetic `(g_d_pad, pk_d_pad)` pair for padding slot `slot_index`.
// `g_d_pad` is domain-separated from Orchard's `DiversifyHash`, so the pair is
// intentionally not a valid `orchard::Address`. `pk_d_pad = [ivk] * g_d_pad`
// satisfies condition 11 by construction (callers must pass the external ivk,
// since padding pins `is_internal = false`). Both points are wrapped as
// `NonIdentityPallasPoint` via `non_identity_padding_point` so the invariant fails at
// the builder rather than at proof time.
pub(crate) fn padding_points(
    slot_index: usize,
    ivk: pallas::Scalar,
) -> Result<(NonIdentityPallasPoint, NonIdentityPallasPoint), DelegationBuildError> {
    validate_padding_slot_index(slot_index)?;
    let slot_index_u32 =
        u32::try_from(slot_index).expect("validated padding slot index fits in u32");
    let g_d_pad =
        pallas::Point::hash_to_curve(PADDING_PERSONALIZATION)(&slot_index_u32.to_le_bytes());
    let pk_d_pad = g_d_pad * ivk;
    Ok((
        non_identity_padding_point(g_d_pad, slot_index, "g_d")?,
        non_identity_padding_point(pk_d_pad, slot_index, "pk_d")?,
    ))
}

// Generates a random seed for a given rho.
// The random seed is used to derive the psi and rcm for the note.
// Note: Orchard's RandomSeed::random is not exposed. If it was exposed,
// we could use it here instead of sampling a random seed.
fn random_seed_for_rho(rho: &Rho, rng: &mut impl RngCore) -> RandomSeed {
    loop {
        let mut rseed = [0u8; 32];
        rng.fill_bytes(&mut rseed);
        let rseed = RandomSeed::from_bytes(rseed, rho);
        if bool::from(rseed.is_some()) {
            return rseed.unwrap();
        }
    }
}

// Derives the note commitment point for a synthetic padding note.
// Orchard has this low-level operation internally as NoteCommitment::derive,
// but does not expose it as a public helper. Mirror it here so padding can use
// domain-separated synthetic (g_d, pk_d) points.
//
// Sinsemilla returns `None` precisely when the commitment would be the identity
// ("bottom"), so callers must convert that into a recoverable build error.
fn note_commitment_point(
    g_d: pallas::Point,
    pk_d: pallas::Point,
    value: NoteValue,
    rho: pallas::Base,
    psi: pallas::Base,
    rcm: pallas::Scalar,
) -> Option<pallas::Point> {
    let domain = sinsemilla::CommitDomain::new(NOTE_COMMITMENT_PERSONALIZATION);
    // Mirrors Orchard NoteCommit while allowing synthetic padding points.
    domain
        .commit(
            iter::empty()
                .chain(byte_bits(g_d.to_affine().to_bytes()))
                .chain(byte_bits(pk_d.to_affine().to_bytes()))
                .chain(u64_bits(value.inner()).take(L_VALUE))
                .chain(rho.to_le_bits().iter().by_vals().take(L_ORCHARD_BASE))
                .chain(psi.to_le_bits().iter().by_vals().take(L_ORCHARD_BASE)),
            &rcm,
        )
        .into_option()
}

// Derives the note nullifier for a given note.
// Note: Orchard has this low-level operation internally as Note::nullifier,
// but does not expose it as a public helper. Mirror it here so padding can use
// the same derivation logic.
fn derive_note_nullifier(
    nk: pallas::Base,
    rho: pallas::Base,
    psi: pallas::Base,
    cm: pallas::Point,
) -> Option<pallas::Base> {
    let k = pallas::Point::hash_to_curve("z.cash:Orchard")(b"K");
    let prf_nf = poseidon_hash_2(nk, rho);
    // Pallas base elements embed directly into the larger scalar field.
    let scalar = pallas::Scalar::from_repr((prf_nf + psi).to_repr())
        .expect("Pallas base field is smaller than its scalar field");
    point_x_opt(&(k * scalar + cm))
}

/// Off-circuit `(cmx, nullifier)` for a synthetic padding slot, in canonical
/// little-endian byte encoding.
///
/// The values match what the delegation circuit constrains for the padded
/// slot, so downstream consumers (PCZT metadata, PIR precompute, IMT
/// non-membership lookups) can reference the same padding-slot commitment
/// x-coordinate and real Orchard nullifier the prover witnesses without
/// re-implementing the synthetic padding derivation.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct SyntheticPaddingNoteParts {
    /// Extracted x-coordinate of the synthetic padding note commitment.
    pub cmx: [u8; 32],
    /// Real Orchard nullifier of the synthetic padding note (the one
    /// `gov_null` is derived from).
    pub nullifier: [u8; 32],
}

struct SyntheticPaddingDerivation {
    g_d_pad: NonIdentityPallasPoint,
    pk_d_pad: NonIdentityPallasPoint,
    psi: pallas::Base,
    rcm: orchard::note::NoteCommitTrapdoor,
    cm: pallas::Point,
    cmx: pallas::Base,
    real_nf: pallas::Base,
}

// Derives every off-circuit value for a synthetic padding note from one shared
// construction, so public helper output and in-circuit witnesses cannot drift.
fn derive_synthetic_padding_note(
    nk: pallas::Base,
    ivk: pallas::Scalar,
    slot_index: usize,
    rho: Rho,
    rseed: RandomSeed,
    location: PrecomputedRandomnessLocation,
) -> Result<SyntheticPaddingDerivation, DelegationBuildError> {
    // Padding uses synthetic address components bound to the external IVK; the
    // rho-scoped seed then supplies the Orchard commitment randomness.
    let (g_d_pad, pk_d_pad) = padding_points(slot_index, ivk)?;
    let psi = rseed.psi(&rho);
    let rcm = rseed.rcm(&rho);

    // Commitment and nullifier derivation can bottom out only in negligible
    // group edge cases; surface those as build errors at the caller's location.
    let cm = note_commitment_point(
        *g_d_pad,
        *pk_d_pad,
        NoteValue::ZERO,
        rho.into_inner(),
        psi,
        rcm.inner(),
    )
    .ok_or(DelegationBuildError::InvalidPaddingNoteCommitment { location })?;
    let cmx =
        point_x_opt(&cm).ok_or(DelegationBuildError::InvalidPaddingNoteCommitment { location })?;
    let real_nf = derive_note_nullifier(nk, rho.into_inner(), psi, cm)
        .ok_or(DelegationBuildError::InvalidPaddingNullifier { location })?;

    Ok(SyntheticPaddingDerivation {
        g_d_pad,
        pk_d_pad,
        psi,
        rcm,
        cm,
        cmx,
        real_nf,
    })
}

/// Computes the off-circuit `(cmx, nullifier)` for a synthetic padding slot
/// from the same construction the delegation builder uses in-circuit.
///
/// Padding slots are not Orchard diversified addresses: `g_d_pad` is
/// hash-to-curve under [`PADDING_PERSONALIZATION`] (domain-separated from
/// Orchard's `DiversifyHash`) and `pk_d_pad = [ivk_external] * g_d_pad`.
/// Callers must supply the same `slot_index`, `rho`, and `rseed` the
/// delegation builder will see during proving (e.g. via
/// [`PaddedNoteData`]) so the off-circuit `cmx`/`nullifier` agree with
/// the circuit's witnessed values bit-for-bit.
///
/// Valid `slot_index` values are circuit padding slots `1..MAX_REAL_NOTES`
/// (`1..=4` for the current fixed-width circuit); slot `0` is always a real
/// note slot and `MAX_REAL_NOTES` is outside the circuit shape.
///
/// Returns [`DelegationBuildError::InvalidPaddingSlotIndex`],
/// [`DelegationBuildError::InvalidPaddingPoint`],
/// [`DelegationBuildError::InvalidPaddingNoteCommitment`], or
/// [`DelegationBuildError::InvalidPaddingNullifier`] for the
/// slot validation error and cryptographically negligible failure modes
/// (identity point, Sinsemilla bottom, identity nullifier point). Errors are reported against
/// [`PrecomputedRandomnessLocation::PaddedNote`] with the supplied
/// `slot_index`.
pub fn synthetic_padding_note_parts(
    fvk: &FullViewingKey,
    slot_index: usize,
    rho: Rho,
    rseed: RandomSeed,
) -> Result<SyntheticPaddingNoteParts, DelegationBuildError> {
    let ak: SpendValidatingKey = fvk.clone().into();
    let ivk = external_ivk_scalar(fvk, &ak);
    let location = PrecomputedRandomnessLocation::PaddedNote(slot_index);
    let padding =
        derive_synthetic_padding_note(fvk.nk().inner(), ivk, slot_index, rho, rseed, location)?;

    Ok(SyntheticPaddingNoteParts {
        cmx: padding.cmx.to_repr(),
        nullifier: padding.real_nf.to_repr(),
    })
}

// A single padding note slot in the delegation.
struct PaddingSlot {
    witness: NoteSlotWitness,
    cmx: pallas::Base,
    v_raw: u64,
    gov_null: pallas::Base,
    #[cfg(test)]
    real_nf: pallas::Base,
}

#[allow(clippy::too_many_arguments)]
fn build_padding_slot(
    slot_index: usize,
    pad_idx: usize,
    nk: pallas::Base,
    dom: pallas::Base,
    ivk: pallas::Scalar,
    imt_provider: &impl ImtProvider,
    rng: &mut impl RngCore,
    precomputed: Option<&PrecomputedRandomness>,
) -> Result<PaddingSlot, DelegationBuildError> {
    let location = PrecomputedRandomnessLocation::PaddedNote(pad_idx);

    let (rho, rseed) = if let Some(pre) = precomputed {
        // Reuse randomness so the prover commits to the same values.
        if pad_idx >= pre.padded_notes.len() {
            return Err(DelegationBuildError::MissingPrecomputedPaddedNote {
                index: pad_idx,
                actual: pre.padded_notes.len(),
            });
        }
        let pd = &pre.padded_notes[pad_idx];
        let rho = Rho::from_bytes(&pd.rho)
            .into_option()
            .ok_or(DelegationBuildError::InvalidPrecomputedRho { index: pad_idx })?;
        let rseed = RandomSeed::from_bytes(pd.rseed, &rho)
            .into_option()
            .ok_or(DelegationBuildError::InvalidPrecomputedRseed { location })?;
        (rho, rseed)
    } else {
        let rho = Rho::from_nf_old(Nullifier::from_inner(pallas::Base::random(&mut *rng)));
        let rseed = random_seed_for_rho(&rho, &mut *rng);
        (rho, rseed)
    };

    let padding = derive_synthetic_padding_note(nk, ivk, slot_index, rho, rseed, location)?;
    let gov_null = gov_null_hash(nk, dom, padding.real_nf);
    let imt_proof = imt_provider.non_membership_proof(padding.real_nf)?;

    // Merkle path is unconstrained for zero-value padding because condition 10
    // is gated by v=0; IMT non-membership and address ownership still run.
    let merkle_path = MerklePath::dummy(&mut *rng);
    let witness = NoteSlotWitness {
        g_d: Value::known(padding.g_d_pad),
        pk_d: Value::known(padding.pk_d_pad),
        v: Value::known(NoteValue::ZERO),
        rho: Value::known(rho.into_inner()),
        psi: Value::known(padding.psi),
        rcm: Value::known(padding.rcm),
        cm: Value::known(padding.cm),
        path: Value::known(merkle_path.auth_path()),
        pos: Value::known(merkle_path.position()),
        imt_nf_bounds: Value::known(imt_proof.nf_bounds),
        imt_leaf_pos: Value::known(imt_proof.leaf_pos),
        imt_path: Value::known(imt_proof.path),
        is_internal: Value::known(false),
    };

    Ok(PaddingSlot {
        witness,
        cmx: padding.cmx,
        v_raw: 0,
        gov_null,
        #[cfg(test)]
        real_nf: padding.real_nf,
    })
}

#[cfg(test)]
pub(crate) struct PaddingSlotForTesting {
    pub witness: NoteSlotWitness,
    pub cmx: pallas::Base,
    pub gov_null: pallas::Base,
    pub real_nf: pallas::Base,
}

#[cfg(test)]
pub(crate) fn build_padding_slot_for_testing(
    slot_index: usize,
    pad_idx: usize,
    fvk: &FullViewingKey,
    ak: &SpendValidatingKey,
    dom: pallas::Base,
    imt_provider: &impl ImtProvider,
    rng: &mut impl RngCore,
) -> Result<PaddingSlotForTesting, DelegationBuildError> {
    let padding = build_padding_slot(
        slot_index,
        pad_idx,
        fvk.nk().inner(),
        dom,
        external_ivk_scalar(fvk, ak),
        imt_provider,
        rng,
        None,
    )?;

    Ok(PaddingSlotForTesting {
        witness: padding.witness,
        cmx: padding.cmx,
        gov_null: padding.gov_null,
        real_nf: padding.real_nf,
    })
}

/// Errors from delegation bundle construction.
#[derive(Clone, Debug)]
pub enum DelegationBuildError {
    /// Must have 1 to `circuit::MAX_REAL_NOTES` real notes.
    InvalidNoteCount(usize),
    /// Public input construction failed.
    Instance(circuit::InstanceError),
    /// Padding can only occupy circuit slots 1..`circuit::MAX_REAL_NOTES`.
    InvalidPaddingSlotIndex { slot_index: usize },
    /// A synthesized padding point was the identity.
    InvalidPaddingPoint {
        slot_index: usize,
        component: &'static str,
    },
    /// A synthesized padding note commitment bottomed out.
    InvalidPaddingNoteCommitment {
        location: PrecomputedRandomnessLocation,
    },
    /// A synthesized padding note nullifier bottomed out.
    InvalidPaddingNullifier {
        location: PrecomputedRandomnessLocation,
    },
    /// A required precomputed padded note entry is missing.
    MissingPrecomputedPaddedNote { index: usize, actual: usize },
    /// A precomputed padded note rho is not a canonical field encoding.
    InvalidPrecomputedRho { index: usize },
    /// A precomputed rseed is not valid for the note rho.
    InvalidPrecomputedRseed {
        location: PrecomputedRandomnessLocation,
    },
    /// Precomputed note components do not produce a valid Orchard note.
    InvalidPrecomputedNote {
        location: PrecomputedRandomnessLocation,
    },
    /// IMT proof fetch failed for a padded note nullifier.
    ImtFetchFailed(super::imt::ImtError),
}

impl From<circuit::InstanceError> for DelegationBuildError {
    fn from(e: circuit::InstanceError) -> Self {
        DelegationBuildError::Instance(e)
    }
}

impl From<super::imt::ImtError> for DelegationBuildError {
    fn from(e: super::imt::ImtError) -> Self {
        DelegationBuildError::ImtFetchFailed(e)
    }
}

impl std::fmt::Display for DelegationBuildError {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            DelegationBuildError::InvalidNoteCount(n) => {
                write!(
                    f,
                    "invalid note count: {} (expected 1–{})",
                    n,
                    circuit::MAX_REAL_NOTES
                )
            }
            DelegationBuildError::Instance(e) => {
                write!(f, "instance construction failed: {e}")
            }
            DelegationBuildError::InvalidPaddingSlotIndex { slot_index } => {
                write!(
                    f,
                    "invalid padding slot index {slot_index} (expected 1..={})",
                    circuit::MAX_REAL_NOTES - 1
                )
            }
            DelegationBuildError::InvalidPaddingPoint {
                slot_index,
                component,
            } => {
                write!(
                    f,
                    "invalid padding point {component} at slot {slot_index}: identity point"
                )
            }
            DelegationBuildError::InvalidPaddingNoteCommitment { location } => {
                write!(f, "invalid padding note commitment for {location}")
            }
            DelegationBuildError::InvalidPaddingNullifier { location } => {
                write!(f, "invalid padding nullifier for {location}")
            }
            DelegationBuildError::MissingPrecomputedPaddedNote { index, actual } => {
                write!(
                    f,
                    "missing precomputed padded note at index {index} (got {actual} entries)"
                )
            }
            DelegationBuildError::InvalidPrecomputedRho { index } => {
                write!(f, "invalid precomputed padded note rho at index {index}")
            }
            DelegationBuildError::InvalidPrecomputedRseed { location } => {
                write!(f, "invalid precomputed rseed for {location}")
            }
            DelegationBuildError::InvalidPrecomputedNote { location } => {
                write!(f, "invalid precomputed note components for {location}")
            }
            DelegationBuildError::ImtFetchFailed(e) => {
                write!(f, "IMT proof fetch failed: {e}")
            }
        }
    }
}

impl std::fmt::Display for PrecomputedRandomnessLocation {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            PrecomputedRandomnessLocation::PaddedNote(index) => {
                write!(f, "padded note {index}")
            }
            PrecomputedRandomnessLocation::SignedNote => write!(f, "signed note"),
            PrecomputedRandomnessLocation::OutputNote => write!(f, "output note"),
        }
    }
}

/// Build a complete delegation bundle with 1 to `circuit::MAX_REAL_NOTES`
/// real notes and padding.
///
/// # Arguments
///
/// - `real_notes`: 1 to `circuit::MAX_REAL_NOTES` real notes with their keys,
///   Merkle paths, and IMT proofs.
/// - `fvk`: The delegator's full viewing key (shared across all real notes).
/// - `alpha`: Spend auth randomizer for the keystone signature.
/// - `output_recipient`: Address of the voting hotkey (output note recipient).
/// - `vote_round_id`: Voting round identifier.
/// - `nc_root`: Note commitment tree root (shared ledger-state anchor).
///   The caller must pin this from the chain's note commitment tree at the
///   verifier-accepted snapshot height; the builder does not authenticate it.
/// - `van_comm_rand`: Blinding factor for the governance commitment.
/// - `imt_provider`: Provider for the bundle-wide alternate-nullifier IMT root
///   and padded-note IMT non-membership proofs. Every real-note proof in
///   `real_notes` must authenticate to this provider's root, and the caller
///   must ensure the provider root is from the same ledger snapshot as
///   `nc_root`.
/// - `rng`: Cryptographically secure random number generator.
/// - `precomputed`: If `Some`, reuse Phase 1 randomness for padded/signed/output notes
///   (ZCA-74 fix). If `None`, sample fresh randomness (backward compat for tests).
///
/// # Caller contract
///
/// `alpha` and `van_comm_rand` are secret, one-time blinding scalars and MUST
/// be drawn from a CSPRNG such as `OsRng` for each delegation bundle.
/// `vote_round_id`, `nc_root`, and the IMT root behind `imt_provider` are
/// authenticated session parameters: the builder constrains proofs to the
/// supplied values but cannot prove they came from the intended chain snapshot
/// or governance announcement. `rng` is used for note seed material and dummy
/// Merkle paths when randomness is not supplied via `precomputed`; the
/// security-critical blinding scalars remain caller-supplied.
#[allow(clippy::too_many_arguments)]
pub fn build_delegation_bundle(
    real_notes: Vec<RealNoteInput>,
    fvk: &FullViewingKey,
    alpha: pallas::Scalar,
    output_recipient: orchard::Address,
    vote_round_id: pallas::Base,
    nc_root: pallas::Base,
    van_comm_rand: pallas::Base,
    imt_provider: &impl ImtProvider,
    rng: &mut (impl RngCore + CryptoRng),
    precomputed: Option<&PrecomputedRandomness>,
) -> Result<DelegationBundle, DelegationBuildError> {
    // The circuit exposes a fixed MAX_REAL_NOTES shape; callers split larger
    // wallets into multiple delegation proofs rather than changing the VK.
    let n_real = real_notes.len();
    if n_real == 0 || n_real > circuit::MAX_REAL_NOTES {
        return Err(DelegationBuildError::InvalidNoteCount(n_real));
    }

    // Snapshot the IMT root — all per-note non-membership proofs must be against this root.
    let nf_imt_root = imt_provider.root();

    // Derive key material.
    let nk_val = fvk.nk().inner();
    let ak: SpendValidatingKey = fvk.clone().into();
    let ivk = external_ivk_scalar(fvk, &ak);

    // Derive the nullifier domain for this round (ZIP §Nullifier Domains).
    let dom = derive_nullifier_domain(vote_round_id);

    // Collect per-note data.
    let mut note_slots = Vec::with_capacity(circuit::MAX_REAL_NOTES);
    let mut cmx_values = Vec::with_capacity(circuit::MAX_REAL_NOTES);
    let mut v_values = Vec::with_capacity(circuit::MAX_REAL_NOTES);
    let mut gov_nulls = Vec::with_capacity(circuit::MAX_REAL_NOTES);

    // Process real notes: derive psi/rcm from rseed, compute the note commitment,
    // real nullifier, and gov nullifier, then pack everything into a NoteSlotWitness.
    for input in &real_notes {
        let note = &input.note;
        let rho = note.rho();
        let psi = note.rseed().psi(&rho);
        let rcm = note.rseed().rcm(&rho);
        let cm = note.commitment();
        let cmx = ExtractedNoteCommitment::from(cm.clone()).inner();
        let v_raw = note.value().inner();
        let recipient = note.recipient();

        // Condition 12: real nullifier for IMT non-membership.
        let real_nf = note.nullifier(fvk);
        // Condition 14: alternate nullifier = Poseidon(nk, dom, real_nf).
        let gov_null = gov_null_hash(nk_val, dom, real_nf.inner());

        let slot = NoteSlotWitness {
            g_d: Value::known(recipient.g_d()),
            pk_d: Value::known(recipient.pk_d().inner()),
            v: Value::known(note.value()),
            rho: Value::known(rho.into_inner()),
            psi: Value::known(psi),
            rcm: Value::known(rcm),
            cm: Value::known(cm.inner()),
            path: Value::known(input.merkle_path.auth_path()),
            pos: Value::known(input.merkle_path.position()),
            imt_nf_bounds: Value::known(input.imt_proof.nf_bounds),
            imt_leaf_pos: Value::known(input.imt_proof.leaf_pos),
            imt_path: Value::known(input.imt_proof.path),
            is_internal: Value::known(matches!(input.scope, Scope::Internal)),
        };

        note_slots.push(slot);
        cmx_values.push(cmx);
        v_values.push(v_raw);
        gov_nulls.push(gov_null);
    }

    // Pad remaining slots with zero-value dummy notes (ZIP §Note Padding).
    // Dummy notes use v=0, which gates condition 10 (Merkle path) via
    // v * (root - anchor) = 0. All other conditions run unconditionally.
    for i in n_real..circuit::MAX_REAL_NOTES {
        let pad_idx = i - n_real; // index into precomputed.padded_notes
        let padding =
            build_padding_slot(i, pad_idx, nk_val, dom, ivk, imt_provider, rng, precomputed)?;

        note_slots.push(padding.witness);
        cmx_values.push(padding.cmx);
        v_values.push(padding.v_raw);
        gov_nulls.push(padding.gov_null);
    }

    let notes: [NoteSlotWitness; circuit::MAX_REAL_NOTES] =
        note_slots.try_into().unwrap_or_else(|_| unreachable!());

    // Condition 8: ballot scaling.
    // num_ballots = floor(v_total / BALLOT_DIVISOR)
    let v_total_u64: u64 = v_values.iter().sum();
    let num_ballots_u64 = v_total_u64 / circuit::BALLOT_DIVISOR;
    let remainder_u64 = v_total_u64 % circuit::BALLOT_DIVISOR;
    let num_ballots_field = pallas::Base::from(num_ballots_u64);

    // Condition 7: gov commitment integrity.
    // van_comm = Poseidon(DOMAIN_VAN, g_d_new_x, pk_d_new_x, num_ballots,
    //                     vote_round_id, MAX_PROPOSAL_AUTHORITY, van_comm_rand)
    // Extract the output address as two x-coordinates (vpk representation).

    let g_d_new_x = *output_recipient
        .g_d()
        .to_affine()
        .coordinates()
        .unwrap()
        .x();
    let pk_d_new_x = *output_recipient
        .pk_d()
        .inner()
        .to_affine()
        .coordinates()
        .unwrap()
        .x();

    let van_comm = van_commitment_hash(
        g_d_new_x,
        pk_d_new_x,
        num_ballots_field,
        vote_round_id,
        van_comm_rand,
    );

    // Condition 3: rho binding.
    // rho_signed = Poseidon(cmx_1, cmx_2, cmx_3, cmx_4, cmx_5, van_comm, vote_round_id)
    // Binds the keystone note to the exact notes being delegated.
    let rho = rho_binding_hash(
        cmx_values[0],
        cmx_values[1],
        cmx_values[2],
        cmx_values[3],
        cmx_values[4],
        van_comm,
        vote_round_id,
    );

    // Construct the keystone (signed) note (ZIP §Dummy Signed Note).
    // Value is 1 so that hardware wallets (Keystone) render the transaction.
    // The rho is bound to the delegation via condition 3.
    let sender_address = fvk.address_at(0u32, Scope::External);
    let signed_rho = Rho::from_nf_old(Nullifier::from_inner(rho));
    let signed_note = if let Some(pre) = precomputed {
        let location = PrecomputedRandomnessLocation::SignedNote;
        let rseed = RandomSeed::from_bytes(pre.rseed_signed, &signed_rho)
            .into_option()
            .ok_or(DelegationBuildError::InvalidPrecomputedRseed { location })?;
        Note::from_parts(sender_address, NoteValue::from_raw(1), signed_rho, rseed)
            .into_option()
            .ok_or(DelegationBuildError::InvalidPrecomputedNote { location })?
    } else {
        Note::new(
            sender_address,
            NoteValue::from_raw(1),
            signed_rho,
            &mut *rng,
        )
    };

    // Condition 2: nullifier integrity — nf_signed is a public input.
    let nf_signed = signed_note.nullifier(fvk);

    // Condition 6: output note commitment integrity.
    // The output note is sent to the voting hotkey address with rho = nf_signed.
    let output_rho = Rho::from_nf_old(nf_signed);
    let output_note = if let Some(pre) = precomputed {
        let location = PrecomputedRandomnessLocation::OutputNote;
        let rseed = RandomSeed::from_bytes(pre.rseed_output, &output_rho)
            .into_option()
            .ok_or(DelegationBuildError::InvalidPrecomputedRseed { location })?;
        Note::from_parts(output_recipient, NoteValue::ZERO, output_rho, rseed)
            .into_option()
            .ok_or(DelegationBuildError::InvalidPrecomputedNote { location })?
    } else {
        Note::new(output_recipient, NoteValue::ZERO, output_rho, &mut *rng)
    };
    let cmx_new = ExtractedNoteCommitment::from(output_note.commitment()).inner();

    // Condition 4: spend authority — rk is the randomized spend key.
    let rk = ak.randomize(&alpha);

    // Assemble the circuit (private witnesses) and instance (public inputs).
    // The caller runs keygen + create_proof on the circuit, then submits
    // the proof + instance to the vote chain. The verifier only needs
    // the instance, proof, and verification key.
    let circuit = circuit::Circuit::from_note_unchecked(fvk, &signed_note, alpha)
        .with_output_note(&output_note)
        .with_notes(notes)
        .with_van_comm_rand(van_comm_rand)
        .with_ballot_scaling(
            pallas::Base::from(num_ballots_u64),
            pallas::Base::from(remainder_u64),
        );

    let instance = circuit::Instance::from_parts(
        nf_signed,
        rk,
        cmx_new,
        van_comm,
        vote_round_id,
        nc_root,
        nf_imt_root,
        [
            gov_nulls[0],
            gov_nulls[1],
            gov_nulls[2],
            gov_nulls[3],
            gov_nulls[4],
        ],
        dom,
    )?;

    Ok(DelegationBundle { circuit, instance })
}

// ================================================================
// Test-only
// ================================================================

#[cfg(test)]
mod tests {
    use super::*;
    use crate::delegation::imt::{ImtError, SpacedLeafImtProvider};
    use ff::Field;
    use halo2_proofs::dev::MockProver;
    use incrementalmerkletree::{Hashable, Level};
    use orchard::{
        constants::MERKLE_DEPTH_ORCHARD,
        keys::{FullViewingKey, Scope, SpendingKey},
        note::{commitment::ExtractedNoteCommitment, Note, Rho},
        tree::{MerkleHashOrchard, MerklePath},
        value::NoteValue,
    };
    use pasta_curves::pallas;
    use rand::rngs::OsRng;
    use std::cell::{Cell, RefCell};

    /// Merged circuit K value.
    const K: u32 = 14;

    #[derive(Debug)]
    struct RecordingImtProvider {
        proof: ImtProofData,
        error: Option<ImtError>,
        requested_nfs: RefCell<Vec<pallas::Base>>,
    }

    impl RecordingImtProvider {
        fn returning(proof: ImtProofData) -> Self {
            Self {
                proof,
                error: None,
                requested_nfs: RefCell::new(Vec::new()),
            }
        }

        fn failing(error: ImtError) -> Self {
            Self {
                proof: test_imt_proof(),
                error: Some(error),
                requested_nfs: RefCell::new(Vec::new()),
            }
        }
    }

    impl ImtProvider for RecordingImtProvider {
        fn root(&self) -> pallas::Base {
            self.proof.root
        }

        fn non_membership_proof(&self, nf: pallas::Base) -> Result<ImtProofData, ImtError> {
            self.requested_nfs.borrow_mut().push(nf);
            match &self.error {
                Some(error) => Err(error.clone()),
                None => Ok(self.proof.clone()),
            }
        }
    }

    fn test_imt_proof() -> ImtProofData {
        ImtProofData {
            root: pallas::Base::from(900u64),
            nf_bounds: [
                pallas::Base::from(10u64),
                pallas::Base::from(20u64),
                pallas::Base::from(30u64),
            ],
            leaf_pos: 7,
            path: std::array::from_fn(|i| pallas::Base::from(1_000u64 + i as u64)),
        }
    }

    fn precomputed_padding_note(rng: &mut impl RngCore) -> (PaddedNoteData, Rho, RandomSeed) {
        let rho = Rho::from_nf_old(Nullifier::from_inner(pallas::Base::random(&mut *rng)));
        let rseed = random_seed_for_rho(&rho, &mut *rng);
        (
            PaddedNoteData {
                rho: rho.to_bytes(),
                rseed: *rseed.as_bytes(),
            },
            rho,
            rseed,
        )
    }

    fn assert_known<T>(value: &Value<T>, f: impl FnOnce(&T) -> bool) {
        let checked = Cell::new(false);
        value.assert_if_known(|actual| {
            checked.set(true);
            f(actual)
        });
        assert!(checked.get(), "expected known witness value");
    }

    fn assert_padding_slot_matches(
        padding: &PaddingSlot,
        slot_index: usize,
        nk: pallas::Base,
        dom: pallas::Base,
        ivk: pallas::Scalar,
        rho: Rho,
        rseed: RandomSeed,
        imt_proof: &ImtProofData,
        requested_nfs: &[pallas::Base],
    ) {
        let (g_d_pad, pk_d_pad) =
            padding_points(slot_index, ivk).expect("test padding points should be valid");
        let psi = rseed.psi(&rho);
        let rcm = rseed.rcm(&rho);
        let cm = note_commitment_point(
            *g_d_pad,
            *pk_d_pad,
            NoteValue::ZERO,
            rho.into_inner(),
            psi,
            rcm.inner(),
        )
        .expect("test padding commitment should be valid");
        let real_nf = derive_note_nullifier(nk, rho.into_inner(), psi, cm)
            .expect("test padding nullifier should be valid");

        assert_eq!(padding.cmx, point_x(&cm));
        assert_eq!(padding.v_raw, 0);
        assert_eq!(padding.gov_null, gov_null_hash(nk, dom, real_nf));
        assert_eq!(requested_nfs, &[real_nf]);

        assert_known(&padding.witness.g_d, |actual| *actual == g_d_pad);
        assert_known(&padding.witness.pk_d, |actual| *actual == pk_d_pad);
        assert_known(&padding.witness.v, |actual| *actual == NoteValue::ZERO);
        assert_known(&padding.witness.rho, |actual| *actual == rho.into_inner());
        assert_known(&padding.witness.psi, |actual| *actual == psi);
        assert_known(&padding.witness.rcm, |actual| actual.inner() == rcm.inner());
        assert_known(&padding.witness.cm, |actual| *actual == cm);
        assert_known(&padding.witness.imt_nf_bounds, |actual| {
            *actual == imt_proof.nf_bounds
        });
        assert_known(&padding.witness.imt_leaf_pos, |actual| {
            *actual == imt_proof.leaf_pos
        });
        assert_known(&padding.witness.imt_path, |actual| {
            *actual == imt_proof.path
        });
        assert_known(&padding.witness.is_internal, |actual| !*actual);
    }

    /// Helper: create 1 to `circuit::MAX_REAL_NOTES` real note inputs with a
    /// shared Merkle tree and anchor.
    ///
    /// Notes are placed at positions 0..n in the commitment tree. Returns
    /// `(inputs, nc_root)` where `nc_root` is the shared anchor.
    ///
    fn make_real_note_inputs(
        fvk: &FullViewingKey,
        values: &[u64],
        scopes: &[Scope],
        imt_provider: &impl ImtProvider,
        rng: &mut impl RngCore,
    ) -> (Vec<RealNoteInput>, pallas::Base) {
        let n = values.len();
        assert!(n >= 1 && n <= circuit::MAX_REAL_NOTES);
        assert_eq!(n, scopes.len());

        // Create notes.
        let mut notes = Vec::with_capacity(n);
        for (idx, &v) in values.iter().enumerate() {
            let recipient = fvk.address_at(0u32, scopes[idx]);
            let note_value = NoteValue::from_raw(v);
            let (_, _, dummy_parent) = Note::dummy(&mut *rng, None);
            let note = Note::new(
                recipient,
                note_value,
                Rho::from_nf_old(dummy_parent.nullifier(fvk)),
                &mut *rng,
            );
            notes.push(note);
        }

        // Extract leaf hashes, padding to 8 with empty leaves.
        let empty_leaf = MerkleHashOrchard::empty_leaf();
        let mut leaves = [empty_leaf; 8];
        for (i, note) in notes.iter().enumerate() {
            let cmx = ExtractedNoteCommitment::from(note.commitment());
            leaves[i] = MerkleHashOrchard::from_cmx(&cmx);
        }

        // Build the bottom three levels of the shared tree (8-leaf tree).
        let l1_0 = MerkleHashOrchard::combine(Level::from(0), &leaves[0], &leaves[1]);
        let l1_1 = MerkleHashOrchard::combine(Level::from(0), &leaves[2], &leaves[3]);
        let l1_2 = MerkleHashOrchard::combine(Level::from(0), &leaves[4], &leaves[5]);
        let l1_3 = MerkleHashOrchard::combine(Level::from(0), &leaves[6], &leaves[7]);
        let l2_0 = MerkleHashOrchard::combine(Level::from(1), &l1_0, &l1_1);
        let l2_1 = MerkleHashOrchard::combine(Level::from(1), &l1_2, &l1_3);
        let l3_0 = MerkleHashOrchard::combine(Level::from(2), &l2_0, &l2_1);

        // Hash up through the remaining levels with empty subtree siblings.
        let mut current = l3_0;
        for level in 3..MERKLE_DEPTH_ORCHARD {
            let sibling = MerkleHashOrchard::empty_root(Level::from(level as u8));
            current = MerkleHashOrchard::combine(Level::from(level as u8), &current, &sibling);
        }
        let nc_root = current.inner();

        // Build Merkle paths and RealNoteInputs.
        let l1 = [l1_0, l1_1, l1_2, l1_3];
        let l2 = [l2_0, l2_1];
        let mut inputs = Vec::with_capacity(n);
        for (i, note) in notes.into_iter().enumerate() {
            let mut auth_path = [MerkleHashOrchard::empty_leaf(); MERKLE_DEPTH_ORCHARD];
            auth_path[0] = leaves[i ^ 1];
            auth_path[1] = l1[(i >> 1) ^ 1];
            auth_path[2] = l2[1 - (i >> 2)];
            for level in 3..MERKLE_DEPTH_ORCHARD {
                auth_path[level] = MerkleHashOrchard::empty_root(Level::from(level as u8));
            }
            let merkle_path = MerklePath::from_parts(i as u32, auth_path);

            let real_nf = note.nullifier(fvk);
            let imt_proof = imt_provider.non_membership_proof(real_nf.inner()).unwrap();

            inputs.push(RealNoteInput {
                note,
                fvk: fvk.clone(),
                merkle_path,
                imt_proof,
                scope: scopes[i],
            });
        }

        (inputs, nc_root)
    }

    /// Helper: build a bundle with explicit scopes.
    fn build_bundle(values: &[u64], scopes: &[Scope]) -> DelegationBundle {
        assert_eq!(values.len(), scopes.len());
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let output_recipient = fvk.address_at(1u32, Scope::External);
        let vote_round_id = pallas::Base::random(&mut rng);
        let van_comm_rand = pallas::Base::random(&mut rng);
        let alpha = pallas::Scalar::random(&mut rng);

        let imt = SpacedLeafImtProvider::new();
        let (inputs, nc_root) = make_real_note_inputs(&fvk, values, scopes, &imt, &mut rng);

        let bundle = build_delegation_bundle(
            inputs,
            &fvk,
            alpha,
            output_recipient,
            vote_round_id,
            nc_root,
            van_comm_rand,
            &imt,
            &mut rng,
            None,
        )
        .unwrap();

        assert_delegation_output_shape(&bundle);
        bundle
    }

    fn build_single_note_bundle_with_precomputed(
        precomputed: &PrecomputedRandomness,
    ) -> Result<DelegationBundle, DelegationBuildError> {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();

        build_single_note_bundle_with_fvk_and_precomputed(&fvk, precomputed, &mut rng)
    }

    fn build_single_note_bundle_with_fvk_and_precomputed(
        fvk: &FullViewingKey,
        precomputed: &PrecomputedRandomness,
        rng: &mut (impl RngCore + CryptoRng),
    ) -> Result<DelegationBundle, DelegationBuildError> {
        let output_recipient = fvk.address_at(1u32, Scope::External);
        let vote_round_id = pallas::Base::random(&mut *rng);
        let van_comm_rand = pallas::Base::random(&mut *rng);
        let alpha = pallas::Scalar::random(&mut *rng);

        let imt = SpacedLeafImtProvider::new();
        let (inputs, nc_root) =
            make_real_note_inputs(fvk, &[13_000_000], &[Scope::External], &imt, &mut *rng);

        build_delegation_bundle(
            inputs,
            fvk,
            alpha,
            output_recipient,
            vote_round_id,
            nc_root,
            van_comm_rand,
            &imt,
            rng,
            Some(precomputed),
        )
    }

    fn make_valid_padded_note_data(rng: &mut impl RngCore) -> PaddedNoteData {
        let rho = Rho::from_nf_old(Nullifier::from_inner(pallas::Base::random(&mut *rng)));
        let rseed = random_seed_for_rho(&rho, rng);

        PaddedNoteData {
            rho: rho.to_bytes(),
            rseed: *rseed.as_bytes(),
        }
    }

    fn assert_delegation_output_shape(bundle: &DelegationBundle) {
        let pi = bundle.instance.to_halo2_instance();
        assert_eq!(pi.len(), 14, "delegation public input shape changed");
        assert_eq!(bundle.instance.gov_null.len(), 5);
        assert_eq!(pi[0], bundle.instance.nf_signed.inner());
        assert_eq!(pi[3], bundle.instance.cmx_new);
        assert_eq!(pi[4], bundle.instance.van_comm);
        assert_eq!(pi[5], bundle.instance.vote_round_id);
        assert_eq!(pi[6], bundle.instance.nc_root);
        assert_eq!(pi[7], bundle.instance.nf_imt_root);
        assert_eq!(&pi[8..13], &bundle.instance.gov_null);
        assert_eq!(pi[13], bundle.instance.dom);
    }

    fn verify_bundle(bundle: &DelegationBundle) {
        // Verify merged circuit.
        let pi = bundle.instance.to_halo2_instance();
        let prover = MockProver::run(K, &bundle.circuit, vec![pi]).unwrap();
        assert_eq!(prover.verify(), Ok(()), "merged circuit failed");
    }

    #[test]
    #[ignore = "long-running Halo2 circuit test; run with `cargo test -- --ignored`"]
    fn test_single_real_note() {
        let bundle = build_bundle(&[13_000_000], &[Scope::External]);
        verify_bundle(&bundle);
    }

    /// Build a bundle without verifying so callers can inspect the circuit
    /// witnesses. Mirrors `build_and_verify` minus the MockProver step and
    /// returns `(bundle, fvk, ak)` so the test can recompute the external IVK.
    fn build_bundle_for_inspection(
        values: &[u64],
        scopes: &[Scope],
    ) -> (DelegationBundle, FullViewingKey, SpendValidatingKey) {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let output_recipient = fvk.address_at(1u32, Scope::External);
        let vote_round_id = pallas::Base::random(&mut rng);
        let van_comm_rand = pallas::Base::random(&mut rng);
        let alpha = pallas::Scalar::random(&mut rng);
        let imt = SpacedLeafImtProvider::new();
        let (inputs, nc_root) = make_real_note_inputs(&fvk, values, scopes, &imt, &mut rng);

        let bundle = build_delegation_bundle(
            inputs,
            &fvk,
            alpha,
            output_recipient,
            vote_round_id,
            nc_root,
            van_comm_rand,
            &imt,
            &mut rng,
            None,
        )
        .unwrap();
        (bundle, fvk, ak)
    }

    #[test]
    fn test_single_real_note_locks_padding_witnesses() {
        // With 1 real note, slots 1..5 must be padding and their (g_d, pk_d)
        // must come from `padding_points(slot_index, external_ivk_scalar(...))`.
        // Catches regressions where the synthetic padding path is silently
        // replaced (e.g. a fallback to `fvk.address_at(...)`) or where the
        // slot index passed to `padding_points` skews off-by-one.
        let (bundle, fvk, ak) = build_bundle_for_inspection(&[13_000_000], &[Scope::External]);
        let ivk = external_ivk_scalar(&fvk, &ak);
        let notes = bundle.circuit.notes_for_testing();
        for slot_index in 1..5 {
            let (expected_g_d, expected_pk_d) =
                padding_points(slot_index, ivk).expect("test padding points should be valid");
            assert_known(&notes[slot_index].g_d, |actual| *actual == expected_g_d);
            assert_known(&notes[slot_index].pk_d, |actual| *actual == expected_pk_d);
        }
    }

    #[test]
    fn test_five_real_notes_uses_no_padding() {
        // With 5 real notes there are no padding slots. Assert that no slot's
        // g_d matches the synthetic padding point for any valid padding slot — this
        // catches an off-by-one in the `n_real..5` iteration boundary that
        // would smuggle a padding point into a real slot (which would silently
        // zero that slot's vote weight in condition 10's `v * (root - anchor)`
        // gate path because padding always has `v = 0`).
        let (bundle, fvk, ak) = build_bundle_for_inspection(&[2_500_000; 5], &[Scope::External; 5]);
        let ivk = external_ivk_scalar(&fvk, &ak);
        let padding_g_ds: Vec<_> = (1..circuit::MAX_REAL_NOTES)
            .map(|i| {
                padding_points(i, ivk)
                    .expect("test padding points should be valid")
                    .0
            })
            .collect();
        let notes = bundle.circuit.notes_for_testing();
        for slot_index in 0..5 {
            for pad_g_d in &padding_g_ds {
                assert_known(&notes[slot_index].g_d, |actual| actual != pad_g_d);
            }
        }
    }

    #[test]
    fn test_padding_points_are_synthetic_and_ivk_bound() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let ivk = external_ivk_scalar(&fvk, &ak);

        for slot_index in 1..5 {
            let (g_d_pad, pk_d_pad) =
                padding_points(slot_index, ivk).expect("test padding points should be valid");
            let real_orchard_addr = fvk.address_at(slot_index as u32, Scope::External);

            // Deref `NonIdentityPallasPoint` to `pallas::Point` for arithmetic and
            // coordinate access; the wrapper enforces the non-identity invariant
            // at construction (`padding_points` -> `assert_non_identity`).
            assert_eq!(*pk_d_pad, *g_d_pad * ivk);
            assert_ne!(
                g_d_pad.to_affine().to_bytes(),
                real_orchard_addr.g_d().to_affine().to_bytes()
            );
            assert_ne!(
                pk_d_pad.to_affine().to_bytes(),
                real_orchard_addr.pk_d().to_bytes()
            );
        }
    }

    #[test]
    fn test_padding_points_reject_impossible_slot_indices() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let ivk = external_ivk_scalar(&fvk, &ak);

        for slot_index in [0, circuit::MAX_REAL_NOTES, usize::MAX] {
            assert!(matches!(
                padding_points(slot_index, ivk),
                Err(DelegationBuildError::InvalidPaddingSlotIndex { slot_index: actual })
                    if actual == slot_index
            ));
        }
    }

    /// Locks the structural property that makes ZCA-450's fix correct: the
    /// hash-to-curve personalization for padding `g_d_pad` is **different**
    /// from Orchard's `KEY_DIVERSIFICATION_PERSONALIZATION`. Domain separation
    /// keeps padding out of Orchard's ordinary diversifier-index derivation; a
    /// point collision with `DiversifyHash(d)` would be treated as a negligible
    /// hash-to-curve collision rather than a deterministic address-universe
    /// overlap. If either constant is ever renamed (here or upstream) so they
    /// coincide, this test fails loudly before a release ships a padding scheme
    /// that re-enters the real-Orchard derivation path.
    ///
    /// Exhaustive testing of the inverse property — that no 88-bit `d`
    /// satisfies `DiversifyHash(d) == g_d_pad_i` — is infeasible (2^88
    /// preimage search), so we lock the construction-time invariant (different
    /// personalization) rather than claiming a formal no-collision invariant.
    #[test]
    fn test_padding_personalization_is_domain_separated_from_orchard() {
        use orchard::constants::KEY_DIVERSIFICATION_PERSONALIZATION;

        assert_ne!(
            PADDING_PERSONALIZATION, KEY_DIVERSIFICATION_PERSONALIZATION,
            "padding personalization must be domain-separated from Orchard's \
             DiversifyHash personalization; otherwise synthetic padding `g_d_pad` \
             can collide with real diversified bases and ZCA-450's fix regresses"
        );
    }

    // ---- Orchard drift tests ----
    //
    // `note_commitment_point`, `derive_note_nullifier`, and `external_ivk_scalar`
    // mirror internal Orchard logic bit-for-bit because Orchard does not expose
    // the corresponding low-level helpers publicly. If Orchard ever changes the
    // bit-encoding, domain personalization, scope handling, or any other input
    // to these primitives, the mirrored helpers in this module will silently
    // desync from in-circuit `NoteCommit` / `DeriveNullifier` / `CommitIvk`
    // (which still consume Orchard's gadgets via `note_commit`, `derive_nullifier`,
    // and `prove_address_ownership`). These tests use real Orchard `Note` /
    // `FullViewingKey` instances as the source of truth and fail loudly on drift.

    /// Builds a real Orchard `Note` for use as ground truth in drift tests.
    fn fixture_real_note(
        scope: Scope,
        rng: &mut impl RngCore,
    ) -> (FullViewingKey, SpendValidatingKey, Note) {
        let sk = SpendingKey::random(rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let recipient = fvk.address_at(0u32, scope);
        let (_, _, dummy_parent) = Note::dummy(rng, None);
        let note = Note::new(
            recipient,
            NoteValue::from_raw(12_500_000),
            Rho::from_nf_old(dummy_parent.nullifier(&fvk)),
            rng,
        );
        (fvk, ak, note)
    }

    #[test]
    fn test_note_commitment_point_matches_orchard() {
        // Locks `note_commitment_point` to Orchard's `NoteCommitment::derive`.
        // The builder uses this helper for padding slots (where g_d/pk_d are
        // synthetic), so any drift in the underlying bit encoding would yield
        // padding commitments that the in-circuit NoteCommit (cond 9) rejects.
        let mut rng = OsRng;
        for scope in [Scope::External, Scope::Internal] {
            let (_fvk, _ak, note) = fixture_real_note(scope, &mut rng);
            let recipient = note.recipient();
            let rho = note.rho();
            let psi = note.rseed().psi(&rho);
            let rcm = note.rseed().rcm(&rho);

            let mirrored = note_commitment_point(
                *recipient.g_d(),
                *recipient.pk_d().inner(),
                note.value(),
                rho.into_inner(),
                psi,
                rcm.inner(),
            );
            let orchard = note.commitment().inner();

            assert_eq!(
                mirrored,
                Some(orchard),
                "note_commitment_point drifted from Orchard NoteCommitment::derive ({scope:?})"
            );
        }
    }

    #[test]
    fn test_derive_note_nullifier_matches_orchard() {
        // Locks `derive_note_nullifier` to Orchard's `Nullifier::derive`. The
        // builder uses this for padding slots; drift would produce padding
        // nullifiers that disagree with in-circuit `DeriveNullifier` (cond 12)
        // and break the IMT non-membership / gov-null derivation (conds 13, 14).
        let mut rng = OsRng;
        for scope in [Scope::External, Scope::Internal] {
            let (fvk, _ak, note) = fixture_real_note(scope, &mut rng);
            let nk = fvk.nk().inner();
            let rho = note.rho();
            let psi = note.rseed().psi(&rho);
            let cm = note.commitment().inner();

            let mirrored = derive_note_nullifier(nk, rho.into_inner(), psi, cm);
            let orchard = note.nullifier(&fvk).inner();

            assert_eq!(
                mirrored,
                Some(orchard),
                "derive_note_nullifier drifted from Orchard Nullifier::derive ({scope:?})"
            );
        }
    }

    #[test]
    fn test_external_ivk_scalar_matches_orchard_address_derivation() {
        // Orchard does not expose `IncomingViewingKey`'s inner scalar, so we
        // check the IVK indirectly via the diversified-address invariant
        // `pk_d = [ivk_external] * g_d` on a real external-scope Orchard
        // address. If `external_ivk_scalar` drifts (wrong personalization,
        // wrong bit-take, wrong rivk scope, missing base_to_scalar), this
        // equation will fail and so will in-circuit condition 11 for padding.
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let ivk = external_ivk_scalar(&fvk, &ak);

        // Sweep several diversifier indices to catch accidental fixed-index
        // shortcuts in the derivation.
        for idx in [0u32, 1, 7, 1234] {
            let addr = fvk.address_at(idx, Scope::External);
            assert_eq!(
                *addr.g_d() * ivk,
                *addr.pk_d().inner(),
                "external_ivk_scalar drifted: [ivk] * g_d != pk_d at diversifier index {idx}"
            );
        }

        // Sanity: the external ivk must NOT validate internal-scope addresses,
        // catching a bug where `rivk(Scope::External)` is silently swapped for
        // `rivk(Scope::Internal)`.
        let internal_addr = fvk.address_at(0u32, Scope::Internal);
        assert_ne!(
            *internal_addr.g_d() * ivk,
            *internal_addr.pk_d().inner(),
            "external_ivk_scalar incorrectly validates an internal-scope address"
        );
    }

    #[test]
    fn test_build_padding_slot_fresh_randomness_populates_strict_witnesses() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let nk = fvk.nk().inner();
        let dom = derive_nullifier_domain(pallas::Base::random(&mut rng));
        let ivk = external_ivk_scalar(&fvk, &ak);
        let imt_proof = test_imt_proof();
        let imt = RecordingImtProvider::returning(imt_proof.clone());

        let padding = build_padding_slot(3, 0, nk, dom, ivk, &imt, &mut rng, None).unwrap();

        let (g_d_pad, pk_d_pad) =
            padding_points(3, ivk).expect("test padding points should be valid");
        assert_known(&padding.witness.g_d, |actual| *actual == g_d_pad);
        assert_known(&padding.witness.pk_d, |actual| *actual == pk_d_pad);
        let generated_padding_values = padding
            .witness
            .rho
            .as_ref()
            .copied()
            .zip(padding.witness.psi.as_ref().copied())
            .zip(padding.witness.rcm.as_ref().cloned())
            .zip(padding.witness.cm.as_ref().copied());
        assert_known(
            &generated_padding_values,
            |(((rho_inner, psi), rcm), cm_witness)| {
                let cm = note_commitment_point(
                    *g_d_pad,
                    *pk_d_pad,
                    NoteValue::ZERO,
                    *rho_inner,
                    *psi,
                    rcm.inner(),
                )
                .expect("test padding commitment should be valid");
                let real_nf = derive_note_nullifier(nk, *rho_inner, *psi, cm)
                    .expect("test padding nullifier should be valid");

                *cm_witness == cm
                    && padding.cmx == point_x(&cm)
                    && padding.gov_null == gov_null_hash(nk, dom, real_nf)
                    && imt.requested_nfs.borrow().as_slice() == [real_nf]
            },
        );
        assert_known(&padding.witness.v, |actual| *actual == NoteValue::ZERO);
        assert_known(&padding.witness.is_internal, |actual| !*actual);
        assert_known(&padding.witness.imt_nf_bounds, |actual| {
            *actual == imt_proof.nf_bounds
        });
        assert_known(&padding.witness.imt_leaf_pos, |actual| {
            *actual == imt_proof.leaf_pos
        });
        assert_known(&padding.witness.imt_path, |actual| {
            *actual == imt_proof.path
        });
        assert_eq!(padding.v_raw, 0);
        assert_eq!(imt.requested_nfs.borrow().len(), 1);
    }

    #[test]
    fn test_build_padding_slot_reuses_selected_precomputed_randomness() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let nk = fvk.nk().inner();
        let dom = derive_nullifier_domain(pallas::Base::random(&mut rng));
        let ivk = external_ivk_scalar(&fvk, &ak);
        let imt_proof = test_imt_proof();
        let imt = RecordingImtProvider::returning(imt_proof.clone());

        let (unused_pd, _, _) = precomputed_padding_note(&mut rng);
        let (selected_pd, selected_rho, selected_rseed) = precomputed_padding_note(&mut rng);
        let precomputed = PrecomputedRandomness {
            padded_notes: vec![unused_pd, selected_pd],
            rseed_signed: [0; 32],
            rseed_output: [0; 32],
        };

        let padding =
            build_padding_slot(4, 1, nk, dom, ivk, &imt, &mut rng, Some(&precomputed)).unwrap();

        let requested_nfs = imt.requested_nfs.borrow();
        assert_padding_slot_matches(
            &padding,
            4,
            nk,
            dom,
            ivk,
            selected_rho,
            selected_rseed,
            &imt_proof,
            &requested_nfs,
        );
    }

    #[test]
    fn test_derive_synthetic_padding_note_matches_manual_derivation() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let nk = fvk.nk().inner();
        let ivk = external_ivk_scalar(&fvk, &ak);
        let slot_index = 3;
        let (_padded_note, rho, rseed) = precomputed_padding_note(&mut rng);

        let derived = derive_synthetic_padding_note(
            nk,
            ivk,
            slot_index,
            rho,
            rseed,
            PrecomputedRandomnessLocation::PaddedNote(0),
        )
        .unwrap();

        let (expected_g_d, expected_pk_d) =
            padding_points(slot_index, ivk).expect("test padding points should be valid");
        let expected_psi = rseed.psi(&rho);
        let expected_rcm = rseed.rcm(&rho);
        let expected_cm = note_commitment_point(
            *expected_g_d,
            *expected_pk_d,
            NoteValue::ZERO,
            rho.into_inner(),
            expected_psi,
            expected_rcm.inner(),
        )
        .expect("test padding commitment should be valid");
        let expected_nf = derive_note_nullifier(nk, rho.into_inner(), expected_psi, expected_cm)
            .expect("test padding nullifier should be valid");

        assert_eq!(derived.g_d_pad, expected_g_d);
        assert_eq!(derived.pk_d_pad, expected_pk_d);
        assert_eq!(derived.psi, expected_psi);
        assert_eq!(derived.rcm.inner(), expected_rcm.inner());
        assert_eq!(derived.cm, expected_cm);
        assert_eq!(derived.cmx, point_x(&expected_cm));
        assert_eq!(derived.real_nf, expected_nf);
    }

    #[test]
    fn test_synthetic_padding_note_parts_matches_padding_slot_derivation() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let nk = fvk.nk().inner();
        let dom = derive_nullifier_domain(pallas::Base::random(&mut rng));
        let ivk = external_ivk_scalar(&fvk, &ak);
        let imt = RecordingImtProvider::returning(test_imt_proof());

        let (padded_note, rho, rseed) = precomputed_padding_note(&mut rng);
        let precomputed = PrecomputedRandomness {
            padded_notes: vec![padded_note],
            rseed_signed: [0; 32],
            rseed_output: [0; 32],
        };

        let padding =
            build_padding_slot(3, 0, nk, dom, ivk, &imt, &mut rng, Some(&precomputed)).unwrap();
        let parts = crate::delegation::synthetic_padding_note_parts(&fvk, 3, rho, rseed).unwrap();

        assert_eq!(
            parts,
            crate::delegation::SyntheticPaddingNoteParts {
                cmx: padding.cmx.to_repr(),
                nullifier: padding.real_nf.to_repr(),
            }
        );
        assert_eq!(imt.requested_nfs.borrow().as_slice(), &[padding.real_nf]);
    }

    #[test]
    fn test_synthetic_padding_note_parts_rejects_impossible_slot_indices() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let (_padded_note, rho, rseed) = precomputed_padding_note(&mut rng);

        for slot_index in [0, circuit::MAX_REAL_NOTES, usize::MAX] {
            assert!(matches!(
                crate::delegation::synthetic_padding_note_parts(&fvk, slot_index, rho, rseed),
                Err(DelegationBuildError::InvalidPaddingSlotIndex { slot_index: actual })
                    if actual == slot_index
            ));
        }
    }

    #[test]
    fn test_build_padding_slot_propagates_imt_errors() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let imt = RecordingImtProvider::failing(ImtError("fixture failure".to_string()));

        let result = build_padding_slot(
            2,
            0,
            fvk.nk().inner(),
            derive_nullifier_domain(pallas::Base::random(&mut rng)),
            external_ivk_scalar(&fvk, &ak),
            &imt,
            &mut rng,
            None,
        );

        assert!(matches!(
            result,
            Err(DelegationBuildError::ImtFetchFailed(ImtError(message)))
                if message == "fixture failure"
        ));
        assert_eq!(imt.requested_nfs.borrow().len(), 1);
    }

    #[test]
    fn test_build_padding_slot_rejects_missing_precomputed_padding_entry() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let ak: SpendValidatingKey = fvk.clone().into();
        let imt = RecordingImtProvider::returning(test_imt_proof());
        let precomputed = PrecomputedRandomness {
            padded_notes: vec![],
            rseed_signed: [0; 32],
            rseed_output: [0; 32],
        };

        let result = build_padding_slot(
            1,
            0,
            fvk.nk().inner(),
            derive_nullifier_domain(pallas::Base::random(&mut rng)),
            external_ivk_scalar(&fvk, &ak),
            &imt,
            &mut rng,
            Some(&precomputed),
        );

        assert!(matches!(
            result,
            Err(DelegationBuildError::MissingPrecomputedPaddedNote {
                index: 0,
                actual: 0
            })
        ));
    }

    #[test]
    fn test_four_real_notes_builds_expected_output_shape() {
        // 3,200,000 x 4 = 12,800,000 → num_ballots = 1, remainder = 300,000.
        build_bundle(
            &[3_200_000, 3_200_000, 3_200_000, 3_200_000],
            &[
                Scope::External,
                Scope::External,
                Scope::External,
                Scope::External,
            ],
        );
    }

    #[test]
    fn test_two_real_notes_builds_expected_output_shape() {
        build_bundle(&[7_000_000, 7_000_000], &[Scope::External, Scope::External]);
    }

    #[test]
    fn test_min_weight_boundary_builds_expected_output_shape() {
        // v_total = 12,500,000 exactly → num_ballots = 1, remainder = 0. Should pass.
        build_bundle(&[12_500_000], &[Scope::External]);
    }

    #[test]
    #[ignore = "long-running Halo2 circuit test; run with `cargo test -- --ignored`"]
    fn test_below_one_ballot() {
        // v_total = 12,499,999 → num_ballots = 0. Circuit should fail
        // (non-zero check on num_ballots causes nb_minus_one to wrap).
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let output_recipient = fvk.address_at(1u32, Scope::External);
        let vote_round_id = pallas::Base::random(&mut rng);
        let van_comm_rand = pallas::Base::random(&mut rng);
        let alpha = pallas::Scalar::random(&mut rng);

        let imt = SpacedLeafImtProvider::new();
        let (inputs, nc_root) =
            make_real_note_inputs(&fvk, &[12_499_999], &[Scope::External], &imt, &mut rng);

        let bundle = build_delegation_bundle(
            inputs,
            &fvk,
            alpha,
            output_recipient,
            vote_round_id,
            nc_root,
            van_comm_rand,
            &imt,
            &mut rng,
            None,
        )
        .unwrap();

        let pi = bundle.instance.to_halo2_instance();
        let prover = MockProver::run(K, &bundle.circuit, vec![pi]).unwrap();
        assert!(prover.verify().is_err(), "below one ballot should fail");
    }

    #[test]
    fn test_three_ballots_builds_expected_output_shape() {
        // 3 notes × 12,500,000 = 37,500,000 → num_ballots = 3, remainder = 0.
        build_bundle(
            &[12_500_000, 12_500_000, 12_500_000],
            &[Scope::External, Scope::External, Scope::External],
        );
    }

    #[test]
    fn test_zero_notes_error() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let output_recipient = fvk.address_at(1u32, Scope::External);
        let imt = SpacedLeafImtProvider::new();

        let result = build_delegation_bundle(
            vec![],
            &fvk,
            pallas::Scalar::random(&mut rng),
            output_recipient,
            pallas::Base::random(&mut rng),
            pallas::Base::random(&mut rng),
            pallas::Base::random(&mut rng),
            &imt,
            &mut rng,
            None,
        );

        assert!(matches!(
            result,
            Err(DelegationBuildError::InvalidNoteCount(0))
        ));
    }

    #[test]
    fn test_five_real_notes_builds_expected_output_shape() {
        // 2,500,000 x 5 = 12,500,000 → num_ballots = 1, remainder = 0.
        build_bundle(
            &[2_500_000, 2_500_000, 2_500_000, 2_500_000, 2_500_000],
            &[
                Scope::External,
                Scope::External,
                Scope::External,
                Scope::External,
                Scope::External,
            ],
        );
    }

    #[test]
    fn test_six_notes_error() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let output_recipient = fvk.address_at(1u32, Scope::External);
        let imt = SpacedLeafImtProvider::new();

        let (inputs, _) = make_real_note_inputs(
            &fvk,
            &[3_000_000, 3_000_000, 3_000_000, 3_000_000, 3_000_000],
            &[
                Scope::External,
                Scope::External,
                Scope::External,
                Scope::External,
                Scope::External,
            ],
            &imt,
            &mut rng,
        );
        // Add a 6th note by extending.
        let mut inputs = inputs;
        let (extra, _) =
            make_real_note_inputs(&fvk, &[3_000_000], &[Scope::External], &imt, &mut rng);
        inputs.extend(extra);

        let result = build_delegation_bundle(
            inputs,
            &fvk,
            pallas::Scalar::random(&mut rng),
            output_recipient,
            pallas::Base::random(&mut rng),
            pallas::Base::random(&mut rng),
            pallas::Base::random(&mut rng),
            &imt,
            &mut rng,
            None,
        );

        assert!(matches!(
            result,
            Err(DelegationBuildError::InvalidNoteCount(6))
        ));
    }

    #[test]
    fn test_missing_precomputed_padded_note_returns_error() {
        let precomputed = PrecomputedRandomness {
            padded_notes: vec![],
            rseed_signed: [0u8; 32],
            rseed_output: [0u8; 32],
        };

        let result = build_single_note_bundle_with_precomputed(&precomputed);

        assert!(matches!(
            result,
            Err(DelegationBuildError::MissingPrecomputedPaddedNote {
                index: 0,
                actual: 0
            })
        ));
    }

    #[test]
    fn test_partial_precomputed_padded_notes_returns_later_missing_error() {
        let mut rng = OsRng;
        let sk = SpendingKey::random(&mut rng);
        let fvk: FullViewingKey = (&sk).into();
        let precomputed = PrecomputedRandomness {
            padded_notes: vec![
                make_valid_padded_note_data(&mut rng),
                make_valid_padded_note_data(&mut rng),
            ],
            rseed_signed: [0u8; 32],
            rseed_output: [0u8; 32],
        };

        let result =
            build_single_note_bundle_with_fvk_and_precomputed(&fvk, &precomputed, &mut rng);

        assert!(matches!(
            result,
            Err(DelegationBuildError::MissingPrecomputedPaddedNote {
                index: 2,
                actual: 2
            })
        ));
    }

    #[test]
    fn test_invalid_precomputed_padded_rho_returns_error() {
        let precomputed = PrecomputedRandomness {
            padded_notes: vec![PaddedNoteData {
                rho: [0xffu8; 32],
                rseed: [0u8; 32],
            }],
            rseed_signed: [0u8; 32],
            rseed_output: [0u8; 32],
        };

        let result = build_single_note_bundle_with_precomputed(&precomputed);

        assert!(matches!(
            result,
            Err(DelegationBuildError::InvalidPrecomputedRho { index: 0 })
        ));
    }

    #[test]
    fn test_single_internal_note_builds_expected_output_shape() {
        build_bundle(&[13_000_000], &[Scope::Internal]);
    }

    #[test]
    #[ignore = "long-running Halo2 circuit test; run with `cargo test -- --ignored`"]
    fn test_mixed_scope_notes() {
        let bundle = build_bundle(
            &[4_000_000, 4_000_000, 3_000_000, 2_000_000],
            &[
                Scope::External,
                Scope::Internal,
                Scope::External,
                Scope::Internal,
            ],
        );
        verify_bundle(&bundle);
    }

    #[test]
    fn test_all_internal_notes_builds_expected_output_shape() {
        build_bundle(
            &[4_000_000, 4_000_000, 3_000_000, 2_000_000],
            &[
                Scope::Internal,
                Scope::Internal,
                Scope::Internal,
                Scope::Internal,
            ],
        );
    }
}