Skip to main content

StructureLedger

Struct StructureLedger 

Source
pub struct StructureLedger { /* private fields */ }
Expand description

The dictionary’s claim ledger: every structural claim the discovery stack makes, each with its own e-process. Serializable — evidence resumes across corpus shards (#973) by persisting the ledger, not by refitting. Calling StructureLedger::certify at ANY data-dependent stopping time yields a valid certificate; that is the entire point.

Implementations§

Source§

impl StructureLedger

Source

pub fn new() -> Self

Source

pub fn register(&mut self, kind: ClaimKind) -> usize

Register a claim and return its ledger index. Idempotent on the claim kind: re-registering an existing claim (a resumed shard loop re-announcing its claim surface) returns the existing index and PRESERVES its accumulated evidence — a fresh e-process here would silently discard the stream’s history.

Source

pub fn absorb_log(&mut self, idx: usize, log_e_value: f64) -> Result<(), String>

Absorb one conditionally-valid log e-value for claim idx (a universal-inference shard ratio, a frozen-prior log-BF — the caller’s contract is per-source, documented on the producing gate).

Source

pub fn claims(&self) -> &[StructuralClaim]

Source

pub fn absorb_probe_outcome( &mut self, idx: usize, log_lik_alt_on_outcome: f64, log_lik_null_on_outcome: f64, ) -> Result<(), String>

The likelihood half of the probe-design loop (work-plan step 4): after running a planned probe (ProbePlancrate::inference::steering::steer_delta), evaluate the REALIZED outcomes under both hypotheses’ predictive densities and absorb the log-ratio into the contested claim’s e-process.

Validity contract: both predictive densities must be FROZEN before the probe outcome is observed — which the design loop satisfies by construction, since both hypotheses’ dictionaries were fitted before the probe was even chosen. For a composite null, the null density must be the honest constrained fit (the same rule as split_likelihood_log_e_value, which this delegates to); for a simple null the predictive density is the sup. Probe outcomes are new data by construction (the model was steered to produce them), so they compound validly with the claim’s prior shard evidence.

Source

pub fn certify(&self, alpha: f64) -> StructureCertificate

The dictionary certificate: e-BH over the ledger’s CURRENT e-values at level α. FDR ≤ α over the confirmed set under arbitrary dependence — atoms sharing every token is fine — and valid at any stopping time because each entry is an e-process. Claims not confirmed are CONTESTED, never rejected (demote-never-reject); they keep their evidence and are the inputs to the probe-design loop.

Trait Implementations§

Source§

impl Clone for StructureLedger

Source§

fn clone(&self) -> StructureLedger

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for StructureLedger

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for StructureLedger

Source§

fn default() -> StructureLedger

Returns the “default value” for a type. Read more
Source§

impl<'de> Deserialize<'de> for StructureLedger

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Serialize for StructureLedger

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V