Derivations
Each formula names its implementation surface; the viz beside it computes it. Theory →
Time-Delay Embedding
Implementation: TimeDelayEmbedder<D>.
- DSL workspace: \(D=3\);
tau=0is normalized to1. - A point is emitted only after enough samples exist.
Euclidean Distance
Implementation: ManifoldPoint<D>::distance. Used by manifold neighborhoods, Vietoris-Rips, lazy witness and block metadata.
Block Centroid
Implementation: BlockMetadata<D>::from_points, for \(B = \{x_1,\ldots,x_n\}\).
Block Radius
Distance Variance
With \(\bar{d}\) the mean point-to-centroid distance. Theory →
Concentration
Zero-norm terms are skipped by implementation guards.
Cauchy-Schwarz Upper Bound
Implementation: BlockMetadata<D>::upper_bound_score. Bound below threshold → block pruned without inspecting its points. Theory →
Sparse Event Trigger
Implementation: SparseScheduler<D>::should_wake, with \(\Delta(t) = \|\mu(t)-\mu(t_{last})\|_2\) and adaptive threshold \(\epsilon(t)\).
Governor Update
Implementation: GeometricGovernor::adapt, a clamped proportional-derivative step on \(\ln\epsilon\) with \(e(t) = \mathrm{clamp}(1 - R_{actual}/R_{target}, \pm 1)\), \(R_{actual} = \Delta(t)/\epsilon(t)\). A steady \(\Delta\) settles at \(\epsilon^* = \Delta/R_{target}\). Theory →
Binary Shape Heuristic
Implementation: crates/aether-core/src/topology.rs. Density and approximate loop count are compared against fixed thresholds.
Heuristic gate with tests; not a production malware detector or complete authentication system. Theory →