Enum RecoveryLaw 

pub enum RecoveryLaw {
    GeneratorOrder {
        ell: u64,
        a: u32,
    },
    DescendingKernels {
        ell: u64,
    },
    ImagesReproduced,
    KeyspaceTreePartition {
        ell: u64,
        a: u32,
    },
    AutOrbitClosure,
}

A law the recovery invoked — auto-formalized as a re-checkable obligation, not prose. The recovery engine does not merely return an answer; it pops out the rules and laws it relied on, each of which SecretRecovery::verify re-derives from scratch.

Variants

GeneratorOrder

The secret kernel generator has order exactly ℓᵃ.

Fields

ell: u64

a: u32

DescendingKernels

The unfolded chain is a connected ℓ-isogeny steps, each quotienting an order-ℓ subgroup.

Fields

ell: u64

ImagesReproduced

Pushing the auxiliary torsion basis through the chain reproduces the published images (the defining property of the recovered isogeny).

KeyspaceTreePartition

The ℓ-adic tree recursion (auto-partitioning the keyspace by digit, sharing prefixes) recovers the same secret as the flat enumeration — the partition is faithful.

Fields

ell: u64

a: u32

AutOrbitClosure

E₀/⟨K⟩ ≅ E₀/⟨ι(K)⟩ under the automorphism ι: recovering one kernel recovers its whole orbit.

Implementations

impl RecoveryLaw

pub fn statement(&self) -> String

The formalized statement of the law — the “learning” the recovery pops out.

Trait Implementations

impl Clone for RecoveryLaw

fn clone(&self) -> RecoveryLaw

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RecoveryLaw

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for RecoveryLaw

fn eq(&self, other: &RecoveryLaw) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RecoveryLaw