Submit a claim

What to send

C1 “I factored this specific N”

• Exact integers N,p,q.
• The asserted input class.
• A statement of whether the claim is only “non-trivial factors” or specifically “prime factors.”

One-multiplication self-adjudication applies to instance claims only and never promotes a generality verdict.

C2 “I have a fast general factoring algorithm”

• Frozen executable or source hash, dependency versions, parameters, libraries, and allowed preprocessing.
• Supported input class and size range, stated in bits.
• Claimed success probability.
• Predeclared wall-time, memory, hardware, retry, and other resource ceilings.
• A full classical/quantum resource model, including preprocessing and postprocessing.

C3 “I have a polynomial-time classical factoring algorithm”

• All C2 materials.
• A mathematical specification of the algorithm.
• A bit-complexity proof and success-probability analysis.
• Complete accounting for every subroutine, oracle, precomputation, advice string, precision requirement, memory cost, and verification step.

C4 “My quantum method factors N with resources R”

• Declare the actuality level: analytic resource estimate, classical simulation, logical/component experiment, or physical-hardware execution.
• Give logical and physical qubit counts, error model, connectivity, code and code distance, gate/cycle counts, runtime, decoding, feed-forward, retries, success probability, and all classical costs.
• Disclose circuit generation, compilation, target-specific preprocessing, and whether any stage received p, q, the order, or an answer-derived hint.

Freeze the claim first

For C2–C4 operational claims, freeze the source or container hash, dependencies, code, parameters, libraries, hardware, timeout, memory, success probability, preprocessing, retry policy, and supported input distribution before any challenge number is revealed.

1. Freeze the claim first. Record the source/container hash, dependencies, code, parameters, libraries, hardware, timeout, memory, success probability, allowed preprocessing, retry policy, and supported input distribution.
2. Fix the target class. State size in bits. The default target is N=pq, with independently generated primes of comparable bit length and no advertised algebraic special form.
3. Only then generate and reveal the challenge. Use registrar-controlled randomness. Commit to the generation record and keep the factors sealed from the claimant and operator, or discard them after generation.
4. Run the frozen submission. Give it only N and the predeclared budget. Record every retry, timeout, failure, and parameter-change request.
5. Require a falsifiable output. Accept only an exhibited non-trivial factor. Re-multiply locally. Do not accept screenshots, decimal approximations, hashes of alleged factors, or “nearly converged” output.
6. Test generality as a distribution. Repeat across multiple fresh targets and increasing sizes before assigning a general-performance grade. Publish failures as well as successes.

Human review

Nothing is published automatically. Watcher discovery does not bypass human review. A frozen submission is checked against the gate for the class it actually claims.

Email the Register intake.

A failed frozen claim can be revised, but the revision is a new claim. The old result is not silently rewritten.