Findings library

Finding · hosted from the CENTL repository

Research library · Finding

Finding

This folder is written by the hunt. You do not need to know Python.

Source in the repository

This folder is written by the hunt. You do not need to know Python.

The only commands you need

From the CENTL folder:

./centl es

That opens the menu. Or, without the menu:

./centl es go

That is the long hunt. It remembers a seed (where it stopped) so it never starts from scratch. It runs until you press Ctrl+C. Letters are collected as they appear; the hunt does not stop on the first one.

./centl es go --from 0
./centl es go --origin
./centl es go 0
./centl es go --from 20000000000
./centl es go 20000000000
./centl es go --from 2e9
./centl es go --random

starts another hunt at 0 or at any number you choose. The hunt you already had keeps its cursor. Findings still go in this shared library. Resume a named hunt with ./centl es go --hunt NAME. List them with ./centl es hunts.

If you type go in a second terminal while the first hunt is still running, that second process joins as a sibling and takes the next free windows. It does not reset the first.

./centl es look
./centl es letters
./centl es seed

look shows the latest findings. letters shows only the rarest files, each with its letter number. seed shows the cursor.

The infinite hunt

Let s be the number scanned_through in findings/seeds/current.json, and let Δ be the window (default 50 000). The hunt is the sequence of intervals

(s, s+Δ],   (s+Δ, s+2Δ],   (s+2Δ, s+3Δ],   …

with no last interval. s begins at the start factor (0, a number you typed, or a random integer). After each interval, s moves forward. Ctrl+C stops the engine and writes s. The next go starts at s.

A finished interval is not a proof of the conjecture.

Letter numbers

Every letter has a number printed at the top of its file.

That number is not assigned by a machine, a clock, or a person. It is the first 128 bits of SHA-256 of a fixed description of what was found (the rule, and the prime). Anyone who finds the same letter, on any computer, at any time, computes the same number.

If you and someone else both find the same unsolved prime, you will both hold the same letter file name and the same letter number. Compare them.

A worldwide serial number (#1, #2 in the order of discovery) cannot work without a shared counter. This can.

The start factor is not part of the letter. Two hunts that begin in different places and later meet the same prime write the same letter.

What the three stamps mean

stampfoldermeaning
GOODgood/A solid, checked identity or a new construction. Worth keeping.
GREATgreat/A hard prime escaped the small theorems, or a Type I rescue, or a new depth record, or a whole bound was cleared. This is the remaining shape of the conjecture.
LETTERletters/An unsolved hard prime, a broken a,b ≤ 11 window, or a claimed universal proof. Collect them. Read them.

The rules are written in HOW-GRADES-WORK.md. They are mechanical. The computer is not guessing.

How to check a finding yourself

Open the file. If it shows

4/n = 1/x + 1/y + 1/z

ask CENTL:

./centl es solve n

or compute 4xyz and n(yz + xz + xy) with any exact calculator. They must be equal.

What is not in here

Ordinary easy identities (n even, n ≡ 3 mod 4, k = 3 or 7) are not copied into these folders. They are logged in log.jsonl only when they meet a filing rule. The library is meant to stay readable.