The count of references and the reach they buy
reference-reach is one function. Everything below came out of it during this
build, at arguments taken from the essays rather than invented for this page — so a figure
here is the same figure a reader meets in an essay, and when the generator changes, this
page changes with it.
At its defaults
view: "map", depth: 2
view: "ladder"
view: "third"
What it checked while it drew
Collected by running this generator with a listener on the assertions, not written here. The count is how many separate times this build put that claim to the test.
- 141 times as many references buys 8.0 times the reach ×2
- 565 references from 2 folds, and the largest disc that avoids all of them ×1
- 800 of those folds — three in a thousand — already bring the worst-covered spot from 0.089 of a sheet to 0.014 ×1
- 9 references from 1 fold, and the largest disc that avoids all of them ×1
- the radius is measured on a stated grid, so the true value lies between what is printed and that number plus half a cell diagonal ×1
- the third round specifies 378,614 folds and 274,300 of them are distinct, which is past what any closure here can be computed at ×1
Where it is called
Changing this generator changes every figure on this list, which is what makes the list worth publishing rather than keeping in a check script.
How far from the nearest reference
One fold puts nine reference points on a square sheet and two folds put five hundred and sixty-five. That is sixty-three times as many points, and it brings the worst-covered spot on the paper from a third of a sheet away to a twelfth — four times closer. A count of references is not a measure of what a fold buys, because a set of points can be arbitrarily crowded and still leave most of the sheet out of reach.
The third fold cannot be listed
Two folds from a bare square reach five hundred and sixty-five reference points. The third round specifies three hundred and seventy-eight thousand folds, of which two hundred and seventy-four thousand are distinct — and the crossings of those with each other run to the tens of billions. The closure stops being computable at exactly the depth a folder starts working at, and what can be said instead is a bound rather than a list.
Every generator · The axioms and construction field · The patterns a reader can fold