Each card says whose work it is, exactly what Aska Digital contributed, and how far the evidence goes. None of it is peer reviewed yet, and every card says so.
GeometryAska Digital
From a doodle to the densest packing of balls.
PreprintNot peer reviewed
Aska Digital’s own work: founding member Ahraz Arifuddin with a team of AI agents.
16,240exact certificate coefficients, all ≥ 0, rule out any collision along the fold
SiteRepositoryPreprint v2 (Zenodo)
PACKING DENSITY ALONG THE FOLDρ 0.7405
Computed in your browser from the fold’s exact formula, from the open scaffold (22.3%) to π/√18 ≈ 74.05%, the densest packing possible.
Astronomyeumemic + Aska
Faint shadows in old starlight: 665 small-planet candidates in public NASA data, as of 14 Oct 2026.
Candidates · not confirmedNot peer reviewed
Founding member eumemic’s project. Aska built the first version of the project's website and contributed nine more merged pull requests (proposed changes the project's owner reviewed and accepted), among them four pipeline fixes; one fix (PR #6) led to a re-search that added 120 counted candidates.
MODEL · 3.18-DAY SIGNALΔ −398 ppm
A planet crossing TIC 4206066, the star that inspired the method, modelled from its published dip: 398 parts per million (the star dims by 0.04%) for 1.7 hours. Depth exaggerated.
665candidates on 14 Oct 2026; none confirmed
SiteRepository
AlgorithmsDoug Colkitt + crowd
A public race of people and AI agents to multiply huge numbers in fewer than n log n steps.
n log n is the best speed proven so far for multiplying two n-digit numbers. κ (kappa) measures how far below it a method gets: the work grows like n·(log n)1−κ, so a bigger κ is faster. Conditional means it holds only if an unreviewed, machine-written paper is right.
Conditional · maintainer-reviewedNot peer reviewed
Founding member Doug Colkitt’s project (CrocSwap). Aska built the live race tracker that grew into this site, and submitted two small claims that were later superseded.
LOG₂ κ · DATED 23 SEP → NOWlog₂κ −9.22
Every reviewed record, from the AI-written paper’s 2⁻¹⁸² to today, on a halvings scale. All rest on that unreviewed paper.
RepositoryRace tracker (feed of 11 Oct)The story
MathematicsMembers + crowd
OpenAI published 722 machine-written maths papers. Here is what people and their agents did next.
Mostly conditionalNot peer reviewed
OpenAI published 722 machine-written papers in 372 families. Founding members eumemic, Doug Colkitt, rohanarun and Ryan Shea then built on 7 of those families, alongside many others.
THE 372 FAMILIES7 built on by members
One square per family of OpenAI’s papers. links a Lean scope document by 7 Octno such documentfounding members built on itLean is a program that checks proofs step by step; a scope document is a plan for such a check, not a finished one.
722machine-written papers in 372 families on day one; 235 families then linked a Lean scope document (242 by 7 Oct)
openai/mathMath, faster (essay)
CircuitsSwapnil Jain + Aska
A claimed way to compute a basic transform on bits (the GF(2) Möbius transform) with fewer one-bit XOR steps than Yates’ 1937 recipe, for astronomically large inputs.
Not peer reviewed · AI-refereed only
Swapnil Jain’s repository. Aska wrote and ran the full-network check behind Theorem 2 (merged PR #1).
PASCAL MOD 2 · N = 32row 31 · 32 inputs
The transform’s matrix, computed here. The claimed saving only appears when the input size has billions of digits.
0 / 3,456,000failures in Aska’s full-network check
RepositoryAska PR #1
CryptographySwapnil Jain + Aska
Fewer logic gates (the tiny on/off circuits chips are built from) for the arithmetic inside AES, the cipher that protects most web traffic.
Lean-verifiedTested on every inputNot peer reviewed
Swapnil Jain’s repository. Aska contributed verified multipliers for more binary fields (merged PR #1; not records).
GATES vs DEPTH−5 gates at depth 6
Each new circuit is checked on all 65,536 input pairs and proved in Lean. Hollow mark: the 2010 record.
117 → 112gates at depth 6, the 2010 record’s depth
RepositoryAska PR #1