Function recover_secret_recursive2 

pub fn recover_secret_recursive2(
    e0: &Curve2,
    basis_a: (&Point2, &Point2),
    ell: u64,
    a: u32,
    basis_b: (&Point2, &Point2),
    images: (&Point2, &Point2),
) -> Option<(Vec<u64>, BigInt, Point2)>

Structured images → generator recovery. Walks the ℓ-adic keyspace tree (auto-partitioning by digit) rather than the flat list, returning the recovered ℓ-adic digits, the secret s = Σ dₖ·ℓᵏ, and its generator. Same answer as recover_secret2 — but the recursion is the digit-by-digit structure the Castryck–Decru Kani oracle prunes with a per-digit split-test.