Formal methods: the convexity proof + property sweeps, wired into verify

Paul: "What can you do with the kernel using formal or verifiable methods?" engine/invariants.js answers with an epistemic ladder (docs/INVARIANTS.md): PROVEN > SWEPT > GATED-ELSEWHERE > EARS.

• The centerpiece is a real proof, not a sample: resolveMulti's scalar paths are weighted means (Sigma w = 1), so every blend is a convex combination of anchor endpoints

• The sweeps (seeded, deterministic, falsifiability-tested): totality over all anchors + 155,268 exhaustive state-level pair resolutions, constrain idempotence, duration-solver contract, snare-law's…

• Findings — the product: (1) bpm is consumer-UNBOUNDED (nothing clamps tempo anywhere; a bpm-300 anchor would sail through — filed)

Verified: verify.sh grows a fourth concurrent suite: prove (quick, ~15s; the wait loop learned to count to four).

▶ Play it: Seismic Ultimatum → Non Euclidean Court — a shuttle between the two genres this change names — the blend is the point https://stellate.app/?genre=dubstep&seed=8386&path=1379.18248,1109.13089&xdur=0.145

6d1b9db https://github.com/aboard-io/stellate/commit/6d1b9db2f6c563d649be1b72d5fcd81649c0eade