Crate entropy_conservation 

Entropy Conservation

Core mathematical framework implementing the Conservation of Verification Entropy — the meta-law discovered across all PLATO/SuperInstance experiments.

Principle: Every closed system of verification (tests, proofs, type checks) has a conserved quantity H — the verification entropy.

H = -Σ pᵢ log pᵢ, where pᵢ is the probability that verification path i is exercised.

Conservation law: dH/dt ≤ 0 (entropy never increases in a well-structured system).

Re-exports

pub use conservation::ConservationReport;

pub use conservation::EntropyViolation;

pub use entropy::VerificationEntropy;

pub use flow::EntropyFlow;

pub use flow::ModuleId;

pub use gradient::GradientSuggestion;

pub use gradient::GradientDescent;

pub use hodge::HodgeDecomposition;

pub use persistence::PersistenceDiagram;

pub use spectrum::SpectralAnalysis;

Modules

conservation

Conservation law enforcement: track H over code changes, detect entropy-increasing commits, compute entropy gradient.

entropy

Shannon entropy, Rényi entropy (order α), Tsallis entropy, and verification-entropy calculation from test-coverage vectors.

flow

Entropy flow between modules: which modules export/import entropy, flow conservation in dependency graphs (Kirchhoff’s current law).

gradient

Entropy gradient descent: suggest code changes that reduce H.

hodge

Hodge decomposition of entropy flow on the verification graph.

persistence

Persistence homology of entropy landscapes.

spectrum

Spectral analysis of the entropy graph.

Enums

EntropyError

Error type for entropy-conservation operations.