PFProof FactoryOpen mathematics research
AI-assisted mathematics research

Mathematical research
in progress.

Proof Factory seeks to contribute useful mathematics, no matter how small or large. This site shows the work underway, what is planned next, and the attempts made so far.

RESEARCH OPERATIONS

Current schedule

Updated 2026-08-12 20:23 UTC
System degradedNo pass currently runningoverdrive: consuming the remaining weekly allowance ahead of the calendar paceopen-problem program has no completed attempt in more than 3 hours
Hard research queueBetween runs

Exact-problem queue

Next dispatch scheduled

Current pass
Idle
Next run
Calculating…
Last result
No Progress
Open-problem programBetween runs

Discovery queue

Next dispatch scheduled

Current pass
Idle
Next run
Calculating…
Last result
No Progress
Experiment lifecycle · running: 0 · checkpointed: 0 · completed awaiting review: 4 · validated: 6 · stopped with reason: 53
WORK UNDERWAY

Ongoing work

R(5,5) twice hourly · focused open-problem campaign 12× daily
exact optimumActive / ongoing

Exact covering number C(12,6,4)

Determine the minimum number of 6-subsets of a 12-point set needed to cover every 4-subset. The maintained range is 40 <= C(12,6,4) <= 41; either a verified 40-block cover or a complete independently checked exclusion of 40 settles the exact value.

Difficulty 7/109 attempts · 2 open leads
Latest: The global extension ledger closed at 47/47. All 47 hash-pinned frontier nodes are UNSAT with drat-trim-replayed DRAT proofs; all 47 CNFs regenerate byte-identically from their (blocker, leaf) pair; all 47 pass an independent cardinality-encoding audit written against a different code path than the builder; 45 of 47 also passed a third from-scratch re-replay (s-r0-4 and s-r1-0 kept their proof-time replay plus hash match only - a redundancy shortfall, not a gap). The link blocker grew from 9 to 20 orbits; all 20 carry independently re-checked residual-extension UNSAT certificates, the blocker's 15,120 clauses are exactly the union of the group images of those 20 links (no clause blocks anything uncertified), and the chain 9 subset 13 subset ... subset 20 is strictly nested, so earlier closures remain valid. The nine inherited base orbits, which carried an invalidated_proof incident, a NOT VERIFIED checker verdict and one UNKNOWN/null-proof record, were re-proved from scratch, 9/9. Hardest node s-r0-2 needed seven rounds of orbit discovery, a 643 s solve, a 2.18 GB DRAT proof and a 1,173 s replay. No solve anywhere in the campaign - 20 orbit residuals plus all 47 nodes - returned SAT, so the constructive track is subsumed: there is no 40-block cover. With the preserved 41-block witness, C(12,6,4) = 41.
exact optimumActive / ongoing

Ramsey number R(5,5)

Determine R(5,5), the least n such that every graph on n vertices contains either a 5-clique or an independent set of size 5. The current range is 43 <= R(5,5) <= 46. A graph on 43 vertices with neither structure proves R(5,5) >= 44; a complete checked finite exclusion at an order proves the corresponding upper bound.

Difficulty 9/1019 attempts · 7 open leads
Latest: The exact record-21 residual formula contains 196998 Ramsey clauses, 1914 row-lex clauses, and 8 supplied-class blocks. CaDiCaL proved it UNSAT in 3.802 seconds. Two separately invoked fresh builds of pinned drat-trim verified the 2728822-byte proof. This is a rigorous propositional exclusion of one narrow frozen-core quotient, not a new Ramsey bound. Full independent semantic census replay remains incomplete at 7/656 hosts.
exact optimumTried — still open

Exact covering number C(15,5,3)

Determine the minimum number of 5-subsets of a 15-point set needed to cover every 3-subset. The maintained range is 54 <= C(15,5,3) <= 55; either a verified 54-block cover or a complete independently checked exclusion of 54 settles the exact value.

Difficulty 5/10129 attempts · 3 open leads
Latest: Two exhaustive encodings agree that every one of the 52,155,333 legal strict degree-preserving 3-for-3 exchanges from the pinned degree-18 defect-nine family has final defect at least ten. The seed is a strict local minimum for this move. This is local progress only; the exact range remains 54 to 55.
exact optimumTried — still open

Exact covering number C(15,6,3)

Determine the minimum number of 6-subsets of a 15-point set needed to cover every 3-subset. The maintained range is 30 <= C(15,6,3) <= 31; either a verified 30-block cover or a complete independently checked exclusion of 30 settles the exact value.

Difficulty 5/10129 attempts · 6 open leads
Latest: A corrected bounded audit found no VeriPB/CakePB executable or source-name candidate in PATH and five declared roots, and the installed GitHub connector exposed no repository for either checker. An independent traversal reproduced the result, preserved the epoch-128 calibration hashes, and rejected five receipt mutations. No target formula or cube ran; 30 <= C(15,6,3) <= 31 is unchanged.
research softwareTried — still open

Refactor Iris-Lean TreeMap proofs to use `simp_to_model`

In `Iris/Std/HeapInstances.lean`, replace the bespoke TreeMap proof steps identified by issue #127 with the Lean standard library's `simp_to_model` automation, retaining the same public theorems and making the proofs robust against TreeMap implementation changes.

Difficulty 3/1025 attempts · campaign 7/25+ · 2 open leads
Latest: The exact Iris PR proof compiled through the real 22-job HeapInstances closure under the exact Lean PR compiler with lockstep Qq/Batteries revisions. A separate checker then verified both public signatures, tactic presence, removal of bespoke helpers, absence of proof escapes, and downstream usability. A prior immutable run records a successful 259-job full Iris build under the source-identical v4.32 bridge backport. The patch is candidate-ready but remains externally blocked on the upstream Lean bridge.
Open-problem programTried — still open

A divisor-function record beyond 24

Let τ(n) count the positive divisors of n. Is there some n > 24 such that max over m < n of (m + τ(m)) is at most n + 2?

Difficulty 4/102 attempts · 0 open leads
Latest: No candidate was found. The C search exactly checked every n in [25, 10^7], with minimum R(n)-n equal to 3 at n=35. A separate Python trial-division audit agreed through 200,000 and recovered the known terms 5, 8, 10, 12, 24. This does not improve the stronger reported human computational bounds.
NEXT IN QUEUE

Planned work

exact optimumQueued

Exact covering number C(17,8,3)

Determine the minimum number of 8-subsets of a 17-point set needed to cover every 3-subset. The maintained range is 17 <= C(17,8,3) <= 18; either a verified 17-block cover or a complete independently checked exclusion of 17 settles the exact value.

Difficulty 6/100 attempts · 0 open leads
Latest: No research pass yet.
exact optimumQueued

Exact covering number C(18,11,4)

Determine the minimum number of 11-subsets of a 18-point set needed to cover every 4-subset. The maintained range is 18 <= C(18,11,4) <= 19; either a verified 18-block cover or a complete independently checked exclusion of 18 settles the exact value.

Difficulty 6/100 attempts · 0 open leads
Latest: No research pass yet.
formalizationQueued

Correct two faithfulness bugs in DeepMind's Lean proof benchmark

Correct the formalized statements for PB-Basic-028 and PB-Advanced-010 in the Superhuman benchmark: represent tangency to the closed segment AB rather than the full affine line in PB-Basic-028, and exclude or correctly handle the documented degenerate case in PB-Advanced-010, preserving valid CSV structure and documenting the semantic change.

Difficulty 3/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #458

Let $[1,\ldots,n]$ denote the least common multiple of $\{1,\ldots,n\}$. Is it true that, for all $k\geq 1$,\[[1,\ldots,p_{k+1}-1]< p_k[1,\ldots,p_k]?\]

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #488

Let $A$ be a finite set and\[B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}.\]Is it true that, for every $m>n\geq \max(A)$,\[\frac{\lvert B\cap [1,m]\rvert }{m}< 2\frac{\lvert B\cap [1,n]\rvert}{n}?\]

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #617

Let $r\geq 3$. If the edges of $K_{r^2+1}$ are $r$-coloured then there exist $r+1$ vertices with at least one colour missing on the edges of the induced $K_{r+1}$.

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #672

Can the product of an arithmetic progression of positive integers $n,n+d,\ldots,n+(k-1)d$ of length $k\geq 4$ (with $(n,d)=1$) be a perfect power?

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #699

Is it true that for every $1\leq i<j\leq n/2$ there exists some prime $p\geq i$ such that\[p\mid \textrm{gcd}\left(\binom{n}{i}, \binom{n}{j}\right)?\]

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #723

If there is a finite projective plane of order $n$ then must $n$ be a prime power? A finite projective plane of order $n$ is a collection of subsets of $\{1,\ldots,n^2+n+1\}$ of size $n+1$ such that every pair of elements is contained in exactly one set.

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
open-problem subresultQueued

Erdős problem #742

Let $G$ be a graph on $n$ vertices with diameter $2$, such that deleting any edge increases the diameter of $G$. Is it true that $G$ has at most $n^2/4$ edges?

Difficulty 7/100 attempts · 0 open leads
Latest: No research pass yet.
RUN HISTORY

Completed research passes

Newest first · complete records retained
2026-08-12 20:23 UTCHard research queue · 17 min

Exact covering number C(15,6,3)

Fail-closed bounded acquisition audit for the retained CaDiCaL-to-VeriPB/CakePB calibration before any C(15,6,3) target cube

What this run accomplished

A corrected bounded audit found no VeriPB/CakePB executable or source-name candidate in PATH and five declared roots, and the installed GitHub connector exposed no repository for either checker. An independent traversal reproduced the result, preserved the epoch-128 calibration hashes, and rejected five receipt mutations. No target formula or cube ran; 30 <= C(15,6,3) <= 31 is unchanged.

Next: Do not rerun this acquisition scan unless new hash-pinned checker inputs are supplied.

2026-08-12 20:04 UTCHard research queue · 23 min

Exact covering number C(15,5,3)

Complete coverage-aware enumeration of every strict degree-preserving 3-for-3 exchange from the hash-pinned degree-18 defect-nine family.

What this run accomplished

Two exhaustive encodings agree that every one of the 52,155,333 legal strict degree-preserving 3-for-3 exchanges from the pinned degree-18 defect-nine family has final defect at least ten. The seed is a strict local minimum for this move. This is local progress only; the exact range remains 54 to 55.

Next: Do not repeat or enlarge this exact 3-for-3 census; its finite neighborhood is closed.

2026-08-12 19:40 UTCHard research queue · 19 min

Exact covering number C(15,6,3)

Audit and qualify the hidden CaDiCaL 1.7.3 VeriPB-format emitter on a transparent two-clause contradiction before attempting any target PB cube.

What this run accomplished

CaDiCaL 1.7.3's previously missed --lratveripb path emitted a deterministic 129-byte VeriPB 2.0 proof for a transparent two-clause contradiction. Independent exact semantics, four proof mutations, a satisfiable base mismatch, two mode controls, and a nine-file rerun passed. VeriPB and CakePB remain unavailable, so this is emitter-only infrastructure progress; no target cube ran and 30 <= C(15,6,3) <= 31 is unchanged.

Next: Acquire project-scoped hash-pinned VeriPB 3.0.2 and a compatible CakePB revision from official sources.

2026-08-12 19:20 UTCHard research queue · 17 min

Exact covering number C(15,5,3)

Matched balanced-totalizer re-encoding of residual rows 343 and 414 at seed 0 and 25000 conflicts, with independent regeneration and DRAT-to-LRAT replay.

What this run accomplished

The matched totalizer compressed both formulas and replayed row 414 with much less proof effort, but row 343 remained UNKNOWN. The predeclared gate failed, no new assignment was excluded, and 54 <= C(15,5,3) <= 55 remains unchanged.

Next: Implement two independent exact 3-for-3 candidate counters around the hash-pinned defect-nine seed.

2026-08-12 19:01 UTCHard research queue · 18 min

Exact covering number C(15,6,3)

Test the exact joint point/pair/triple-cover Venn-cell projection for the fixed labelled complete surplus graph H=3K5 and overlapping subsets S={0,1,2}, T={2,3,4}.

What this run accomplished

The exact overlap-one two-subset Venn projection for labelled H=3K5 is feasible. A producer found a 30-block type vector over 18 types; a separate all-5005-block reconstruction verified all 29 rows, rejected five mutations, and the producer reran byte-identically. This closes only one automorphism orbit of an aggregate relaxation and leaves 30 <= C(15,6,3) <= 31 unchanged.

Next: Do not run another arbitrary subset-pair Venn sample.

2026-08-12 18:42 UTCHard research queue · 25 min

Exact covering number C(15,5,3)

Literal twelve-distinct-4-set residual decomposition on nine deterministic quantiles of the 353 coincident-link survivors, with DRAT-to-LRAT replay and exact attachment-fibre binding.

What this run accomplished

A deterministic nine-row literal residual pilot found one replay-verified local exclusion. Interface row 414 passes all previous capacity checks but cannot be decomposed into twelve distinct residual 4-sets; this removes its complete 547-orbit fibre from the rooted [3^5] frontier. Two rows are locally SAT and six remain UNKNOWN, so no global branch or covering number is decided.

Next: Implement one materially different proof-producing encoding for row 343 and the row-414 control while keeping seed 0 and 25000 conflicts fixed.

2026-08-12 18:15 UTCHard research queue · 28 min

Exact covering number C(15,6,3)

Exhaustively project any putative 30-cover onto the intersection-size histogram of one point subset S, eliminate the four triple-type totals through the third binomial moment, and test whether this restricts the internal pair-surplus mass H(S).

What this run accomplished

Exact one-subset intersection-histogram enumeration found that all 124 degree/cut-compatible (s,H(S)) pairs survive. Independent bitset DP, all-32768-subset identity checks, five mutations, and a byte-identical producer rerun passed. The result closes only this H(S)-aggregate route; C(15,6,3) remains between 30 and 31.

Next: Keep the exact remaining 38705-profile parent-rich ownership union blocked until explicit human approval of that scope.

2026-08-12 17:47 UTCHard research queue · 29 min

Exact covering number C(15,5,3)

Exact marked-automorphism quotient of every rooted [3^5] pair-excess skeleton placement against all 353 surviving coincident-link interfaces.

What this run accomplished

The complete rooted [3^5] attachment family for all 353 surviving B interfaces was reduced exactly from 5,436,200 labelled relative placements to 471,270 marked-automorphism orbits. An independent signature-group implementation reproduced every canonical representative and checked every orbit count by Burnside's lemma. No orbit, interface, skeleton profile, or 54-cover was excluded; the exact range remains 54 <= C(15,5,3) <= 55.

Next: Derive and pre-count a placement-specific residual 4-set decomposition filter on the 471,270 canonical representatives.

2026-08-12 17:16 UTCHard research queue · 18 min

Exact covering number C(15,6,3)

derive global block-pair intersection moments and squeeze the square mass Q of pair surplus against the collision mass R of triple excess

What this run accomplished

Global block-pair intersection moments give two exact identities and the necessary interval 15+ceil(Q/3)<=R<=floor(115+7Q/6). Independent reconstruction and four mutation controls passed. All 50 saved marginal witnesses pass with wide margins, so the lemma is retained but unstructured sampling is redirected. The covering range remains 30 through 31.

Next: Request explicit approval for the exact remaining 38705-profile parent-materialization scope, then reconcile the full 62437-profile ownership union.

2026-08-12 16:57 UTCHard research queue · 26 min

Exact covering number C(15,5,3)

Matched native-PB completion telemetry on eight canonical-hash-selected q=6 optimal point links, comparing multiplicity-five-pair normalization with complete root-link fixing.

What this run accomplished

The eight-class q=6 full-root-link native-PB pilot failed its predeclared twofold propagation gate. All 16 runs were UNKNOWN, no decision ratio was at most 0.5, no 54-cover was found, and no link was excluded. The exact range remains 54 <= C(15,5,3) <= 55.

Next: Obtain human approval for the exact successor scope before dispatch.

2026-08-12 16:30 UTCHard research queue · 17 min

Exact covering number C(15,6,3)

Replace the failed 55-selector third-block orbit DNF in the fixed-first, fixed-r=2-second incidence branch by eleven within-class monotonicity implications, prove exact weight-six equivalence, and run the frozen two-seed CaDiCaL comparison.

What this run accomplished

The eleven-implication encoding exactly realizes the 55 canonical third blocks in the fixed-r=2 branch and is materially smaller than the failed selector DNF. Independent validation passed. Nevertheless, both seed-paired CaDiCaL conflict-rate ratios were below one, all runs were UNKNOWN, and no witness or proof was produced; the maintained range is unchanged.

Next: Close the third-block quotient family for the present CaDiCaL no-proof protocol.

2026-08-12 16:11 UTCHard research queue · 20 min

Exact covering number C(15,5,3)

Exact pair-count compatibility test coupling all 353 surviving coincident-mark interfaces to the three omitted triangle/doubled-edge pair-excess skeleton profiles.

What this run accomplished

All 1059 coincident-mark interface/profile cells survive the exact pair-count relaxation. The result is independently checked and reproducible, but it neither constructs nor excludes a 54-block cover. The maintained range remains 54 <= C(15,5,3) <= 55.

Next: Obtain human approval for the exact scope of a bounded canonical full-root-link pilot before dispatching it.

2026-08-12 15:50 UTCHard research queue · 19 min

Exact covering number C(15,6,3)

Exact third-block stabilizer quotient inside the fixed-first, fixed-r=2-second incidence branch, realized as one selector-DNF CNF and compared against the retained r=2 baseline.

What this run accomplished

An exact two-anchor stabilizer quotient reduced the distinguished third-block domain from 5005 labelled blocks to 55 representatives throughout the complete fixed-r=2 branch. Independent reconstruction passed. The 55-selector DNF realization failed the frozen two-seed CaDiCaL gate and produced no witness or proof.

Next: Encode the 55 canonical blocks with eleven within-colour adjacent implications rather than 55 selectors and independently prove equivalence using exact column weight six.

2026-08-12 15:29 UTCHard research queue · 19 min

Exact covering number C(15,5,3)

Complete symmetry classification and point-capacity filtering of the missing triangle/coincident-mark two-link interface.

What this run accomplished

The complete triangle/coincident-mark interface was classified into exactly 575 isomorphism types. A sound point-capacity test independently rejects 222 and leaves 353. Combined with the prior ordered-distinct-mark corpus, the interface decomposition now covers all 41 pair-excess skeleton profiles. No skeleton profile, 54-cover, or exact value was settled; the maintained range remains 54 <= C(15,5,3) <= 55.

Next: Generate an exact compatibility ledger between the 353 B survivors and the three triangle-only skeleton profiles.

2026-08-12 15:09 UTCHard research queue · 15 min

Exact covering number C(15,6,3)

Tested whether balanced-totalizer CNF with direct ASCII-LRAT can certify a global exact-incidence contradiction before applying that proof stack to covering cubes.

What this run accomplished

The global incidence-balance LRAT discriminator failed its 16 MiB gate. Independent checks confirmed the formula and rejected the incomplete prefix. No legitimate covering case was eliminated, so 30 <= C(15,6,3) <= 31 remains unchanged.

Next: Do not repeat the already-qualified degree-13 or global-balance controls with unchanged totalizer/direct LRAT.

2026-08-12 14:53 UTCHard research queue · 18 min

Exact covering number C(15,5,3)

Proof-capable exact residual C(13,4,2) kernels for both sides of three fixed two-link survivor representatives.

What this run accomplished

Six exact local residual kernels were generated and independently reconstructed. Both sides of the maximum representative are SAT with directly checked 12-block witnesses; four minimum/median sides remain UNKNOWN at the fixed cap. No type was excluded and the exact range remains 54 <= C(15,5,3) <= 55.

Next: Build independently counted coincident-mark and seven-common-triple interface corpora for the three omitted skeleton profiles.

2026-08-12 14:34 UTCHard research queue · 18 min

Exact covering number C(15,6,3)

Exact first-hit ownership classification of all unordered two-block partial root links across the five forced target-degree profiles, with an independent composition-table multiplicity audit.

What this run accomplished

The depth-two first-hit discriminator passed exactly: 18933 forced-representative coordinates collapse to 250 colored unordered-pair orbits with counts 14,43,30,92,71, and a separate composition-table checker covers all 2003001 labelled pairs per profile. The predeclared empirical depth-four projection is 76434, but comparison with validated global frontiers shows the owner map is ordinary symmetry bookkeeping, not additional completion-case elimination. No complete link, cover, or UNSAT certificate was produced, so 30 <= C(15,6,3) <= 31 remains unchanged.

Next: Retain the 250-key owner manifest as exact coverage infrastructure; do not extend the catalogue merely to increase depth.

2026-08-12 14:15 UTCHard research queue · 20 min

Exact covering number C(15,5,3)

Exact pointwise residual-pair capacity prefilter over the complete 3770-row ordered-distinct-mark two-link corpus, guarded by an independent 41-skeleton scope audit.

What this run accomplished

A proved point-capacity prefilter and independent implementation reject exactly 1599 of the 3770 ordered-distinct-mark two-link interfaces, leaving 2171 survivors in 25 strata. Hash checks, four mutations, and byte-identical regeneration pass. A scope audit retains three of 41 pair-excess skeleton profiles requiring coincident-mark or seven-common-triple interfaces, so the exact covering number remains 54 to 55.

Next: Generate canonical DIMACS for both residual sides of the 25 selected survivor rows and validate a frozen Iorio side-kernel semantic control.

2026-08-12 13:53 UTCHard research queue · 18 min

Exact covering number C(15,6,3)

Derive and independently audit a first-hit stabilizer-orbit decomposition of the five forced 12-block root-link degree profiles, without solver search.

What this run accomplished

The PB proof route was held because its pinned producer/replayers are absent and revision-conflicted. A solver-free redirect established and independently checked 2,4,3,6,5 stabilizer orbits for the five forced root-link profiles. Whole-orbit first-hit ownership reduces aggregate residual selector coordinates from 40020 to 18933. No link tail or global cover was classified, so 30 <= C(15,6,3) <= 31 remains unchanged.

Next: Build a depth-two canonical augmentation pilot from all twenty first-hit tails, preserving earlier-orbit absence and the forced representative.

2026-08-12 13:35 UTCHard research queue · 24 min

Exact covering number C(15,5,3)

Exact S_13 capacity census for the distinct two-link local-completion prefilter, with a maintained-cover semantic control and independent VF2/orbit-stabilizer reconstruction.

What this run accomplished

The stale fixed-pair rerun was rejected. The distinct two-link capacity gate passed: exactly 94 unmarked union-13 six-triple types and 3770 ordered-distinct-mark types were independently validated. No residual kernel was solved, so 54 <= C(15,5,3) <= 55 remains open.

Next: Do not rerun the closed 754-target fixed-pair relaxation.

2026-08-12 13:09 UTCHard research queue · 17 min

Exact covering number C(15,6,3)

Exact pre-solve size and equivalence audit of the proposed joint local-moment/triple-excess shared-support model for fixed H=3K5.

What this run accomplished

The proposed joint local-admissibility/triple-excess shared-support route was falsified at preflight. For H=3K5 its natural formulation has 43260 variables and 430535 nonzeros, and exact incidence tightness proves that its 30-support threshold is already the original fixed-H 30-cover problem. Independent reconstruction and mutation controls passed; no solver search was run and 30 <= C(15,6,3) <= 31 is unchanged.

Next: Do not instantiate or solve the natural shared-support joint model.

2026-08-12 12:52 UTCHard research queue · 24 min

Exact covering number C(15,5,3)

Complete exact enumeration of every legal degree-preserving 2-for-2 neighbor of the hash-pinned degree-18 defect-nine seed.

What this run accomplished

The pinned degree-18 defect-nine seed is a strict local minimum under degree-preserving 2-for-2 moves. There are 40,809 incidence-compatible cells, 38,941 legal nonidentity exchange occurrences, and exact minimum neighbor defect ten. No cover or global exclusion was obtained.

Next: Do not repeat or enlarge the same 2-for-2 census.

2026-08-12 12:26 UTCHard research queue · 19 min

Exact covering number C(15,6,3)

Apply exact per-block intersection moments to lift-test two frozen pair-surplus/triple-excess controls, and certify unsupported required triples by exhaustive local enumeration.

What this run accomplished

A universal per-block four-moment lemma was implemented as an exact lift filter. It retained only 169 and 167 of 5005 candidate blocks for the two named epoch-114 H/e controls and found required triples with zero eligible support, proving those two stored excess vectors do not lift. Independent DP reconstruction, a cyclic boundary control, four mutations, and a byte-identical rerun passed. Neither complete H nor any global cover case was excluded, so 30 <= C(15,6,3) <= 31 is unchanged.

Next: Design one bounded joint model coupling e pair marginals to local block admissibility for control-3K5 or control-2C15.

2026-08-12 12:06 UTCHard research queue · 24 min

Exact covering number C(15,5,3)

Complete exact-degree union-crossover census over all unordered pairs in the fixed stored labelled alignments of 91 validated degree-18 defect-ten representatives.

What this run accomplished

The complete fixed-alignment two-parent union census produced a directly and independently checked degree-18 defect-nine 54-block family. It classified 12,210 proper occurrences and proved local minimum ten over 2692 deep occurrences. The gain is shallow from one parent, so the exact crossover corpus is exhausted and the next route is local repair from the new seed. No 54-cover or exclusion was obtained.

Next: Extract the defect-nine child from best-certificate.json.

2026-08-12 11:42 UTCHard research queue · 17 min

Exact covering number C(15,6,3)

Compiled the source-verified labelled type-(5^4,4^10) C(14,5,2)=12 root link into sequential-unary selector CNF and ran matched forced and unforced CaDiCaL controls.

What this run accomplished

The frozen unseeded sequential-unary root-link selector search failed its known-SAT five-second qualification. Forced SAT and independent model validation passed, but the unforced arm timed out. No unknown type or global case was classified, so 30 <= C(15,6,3) <= 31 is unchanged.

Next: Prove and check the S4 x S10 normalization: the four degree-5 points contribute 20 incidences, forcing a selected block with h in {2,3,4}.