research: kernel scaling under repeated cubic folds #33
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Open questions from the kernel review (aborted mid-run) — measure before more axiom-6/7-heavy features build on the kernel:
p.x = √2/4,p.x = (√2+√3)/8), dobeloch6/beloch7stay usable? Rational-input baselines exist; the algebraic-input probe was interrupted.Deliverable: a small benchmark suite over representative fold sequences (budget: a 20-step model with cubic folds stays interactive) and a verdict on whether ADR 0012 needs adjusting. Feeds #23's
real_rootsfindings.Answered by #41 (FLINT qqbar backend + 3.6 roots-first). Measured verdict in
notes/2026-07-03-33-verdict.md: axiom 7 with algebraic inputs is fixed (√2/4: >120s → 5ms; (√2+√3)/8: never completed → 0.113s), stacked cubics are interactive through round 3 (0.068s). Round 4 (degree-81 minimal polynomials) remains a genuine wall — it grinds in FLINT's canonical representation too, so it is a property of exact arithmetic at that degree, not of our pipeline; documented in the note and ADR 0013. The 20-step-with-a-few-cubics budget is met as long as cubic folds don't stack more than three deep, which no classical construction does.