CollatzX
Computes Collatz trajectories, stopping-time features, parity ratios, and near-miss rankings for bounded runs.
Inspect CollatzXProofX is an open Python research toolkit for ranking candidates, running bounded experiments, and publishing replayable ledgers. It is a search system, not a proof system.
A ProofX run evaluates a finite set of candidates under a fixed command, budget, seed, and code revision. If no counterexample is found, the result is reported as unrefuted at that budget.
The useful artifact is the ledger: every evaluated candidate, feature vector, near-miss score, strategy label, and seed.
Computes Collatz trajectories, stopping-time features, parity ratios, and near-miss rankings for bounded runs.
Inspect CollatzXCounts prime-pair partitions and ranks sparse even-number families by Hardy-Littlewood deficit.
Inspect GoldbachXRuns numerical diagnostics around zeta zeros, prime-counting approximations, and Keiper-Li coefficients.
Inspect RiemannXResult pages should be read as run summaries. A table can show what a specific configuration found; it does not certify a conjecture.
No. ProofX runs bounded searches and records the results. A negative run means no counterexample was found under that configuration.
Trust the command, code revision, dependency environment, and ledger more than any summary sentence. Summaries are only views over run data.
The root ProofX repository now includes a small Lean 4 package for bounded certificates. Germinal remains a separate vendored Lean 4 project.
Founder
Building ProofX as a small, open research codebase for reproducible mathematical experiments and careful public reporting.