The source reports the compatible-affine certified front end as internally proved and makes WIT-AFFINE/WIT-RESTRICT the first open node. Affine universality and scoped witness-recovery barriers prevent treating this as a routine last lemma.
Route status · Active routeTheoretical computer science · fine-grained complexity
Modern 3SUM Hypothesis
Collaboration betaDo cubic-universe integer 3SUM and reasonable-real 3SUM each resist every truly subquadratic algorithm in their stated machine models?
Modern 3SUM has distinct open integer and reasonable-real targets.

Research problem
Exact mathematical statement
The current source keeps two targets separate. TARGET-I asks whether exact integer 3SUM on , each of size at most , has no -time algorithm for any fixed on a -bit word RAM. TARGET-R4 separately asks the analogous question for three sets of immutable input reals when real-dependent queries are limited to the stated three-way 3-linear and 4-linear comparisons plus ordinary word-RAM bookkeeping. In each target's own machine model, the unresolved lower-bound hypothesis is
A truly subquadratic algorithm would refute only the target whose machine model it respects; an integer algorithm does not by itself settle TARGET-R4. Neither target is resolved.
Problem infographic
Problem at a glance

Current mathematical picture
Where work on Modern 3SUM Hypothesis stands
V6 separates the integer word-RAM and reasonable-real targets, records source-reported proved front ends only to their exact first open nodes, and keeps all conditional interfaces, scoped barriers, and submitted checks non-authoritative. Neither target is solved.
A cell can lie wholly below the target while remaining inside the sample-adjacent interval; predecessor and successor contours are the correct boundaries. Use both sample endpoint contours and preserve the global cap in every local reporter.
Route status · Eliminated routeThe source retains shifted-gcd and quadratic-extension resultant formulations as exact secondary normal forms, explicitly charges field size and coefficient-algebra work, and leaves fast selected subresultant or masked-product evaluation open.
Evidence posture · Source-reported route statement · dependencies incompleteThe source keeps TARGET-I and TARGET-R4 distinct, states their legal machines, and does not let an integer algorithm settle the reasonable-real target.
V6 source revision order; not mathematical occurrence timeWork mapped so far
Modern 3SUM Hypothesis in numbers
- Argument development
- 1,511 · 74%
- Explored or eliminated routes
- 44 · 2%
- Computational analysis
- 135 · 7%
- Open obligations
- 275 · 14%
- Definitions and setup
- 72 · 4%
How this is measured
This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.
Recommended next task
Prove WIT-RESTRICT or a weaker certified-core reporter with output exponent below two.
Suggested move: Follow the exact V6 interface, model, distributional posture, output semantics, and falsification checklist without broadening a local result.
What would count as progress
- Supply a complete source-independent argument or a precisely scoped counterexample.
- Survive independent review of model legality, dependency closure, and every charged setup term.
Argument map and routes
How the current approaches connect
Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.
Visible working map
Research route map
Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.
Scroll horizontally to explore the route
Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.
The source reports the compatible-affine certified front end as internally proved and makes WIT-AFFINE/WIT-RESTRICT the first open node. Affine universality and scoped witness-recovery barriers prevent treating this as a routine last lemma.
Route status · Active routeThe source reports occurrence sampling, expectation transfer, endpoint geometry, one-sided reporting, and outer-frame closure before the open RANDOM-CLOSED-LENS reporter; DOUBLE-CROSS-SLAB remains secondary.
Route status · Active routeExplored alternatives
Other routes
A cell can lie wholly below the target while remaining inside the sample-adjacent interval; predecessor and successor contours are the correct boundaries. Use both sample endpoint contours and preserve the global cap in every local reporter.
Route status · Eliminated routeAggregation, occurrence sampling, and cap corrections narrow the object to a coupled difference of two ordered threshold frontiers. Exploit ordered frontier coupling rather than treating the requests as unrelated sparse products.
Route status · Eliminated routeRoute statements and reductions
Statements the next route can inspect and build on
The source reports that uniform pair-occurrence sampling, equality-block handling, and target-gap collapse yield E[K] <= n+2n^3/R, including arbitrary sum multiplicities.
Source-reported route statement · dependencies incompleteThe source reports an exact compatible-affine map, collision peeling with exact bad-endpoint scans, zero-degree pruning, a constant-expected-round wrapper, and the resulting certified sparse convolution core. This is a source-reported proved front end, not an independently checked ProofAtlas result.
Source-reported route statement · dependencies incompleteWIT-AFFINE and the sufficient WIT-RESTRICT interface ask for shared recovery after output-specific exclusions; any certified-core reporter with output exponent below two yields a truly subquadratic exact Las Vegas TARGET-I algorithm.
Source-reported route statement · dependencies incompleteFor every fixed input under the actual outer-frame-augmented sample law, the open target is an exact MODEL-R4 reporter with expected O~(n+E[K]) cost; the source does not claim a pointwise theorem for arbitrary lenses.
Source-reported route statement · dependencies incompleteMore ways to contribute
Open questions
Additional prepared tasks for exploring this research frontier.
Sourced mathematical context
The known mathematical landscape
What the literature has established
Selected external milestones in reverse chronological order, with their evidence posture.
Peer reviewedChan improved logarithmic factors while explicitly retaining the no-O(n^(2-epsilon)) conjecture as the modern fine-grained hypothesis.[2] PreprintGrønlund and Pettie gave logarithmically subquadratic algorithms, refuting an older exact-quadratic formulation but not an n^(2-epsilon) lower-bound hypothesis.[1]
Mathematical neighborhood
Related results and reusable starting points
Formalization opportunities
Lean work can make these reusable foundations precise without being presented as a proof of the core problem.
- Formalization targetA formal statement must freeze the input domain, allowed real operations, word-RAM operations, randomization posture, and uniform running-time convention.
- Formalization targetLogarithmic-factor speedups refute an exact quadratic claim but do not refute the n^(2-o(1)) hypothesis; the two formulations must remain separate.
Later mathematical changes
What changed after the initial research map
Later recorded revisions that changed the mathematics, without inventing a date or an AI attribution.
Changed the research frontierLater mathematical revision
Changed the research frontierLater mathematical revision
Changed the research frontierLater mathematical revision
The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.
Detailed research inventory
Claims, milestones, and routes in the current map
This view highlights the mathematical statements most useful for following the current route.
- theorem candidate
3 of 13 3 - reduction
3 of 13 3 - lemma
4 of 13 4 - equivalence
1 of 13 1 - negative result
2 of 13 2
V6 two-target research mapThe recorded V6 overview keeps TARGET-I and TARGET-R4 separate, preserves exact source-reported proved-front-end boundaries, exposes the first open interface on each branch, retains expectation and gcd/resultant repairs, and scopes all negative route evidence without claiming a solution.30 displayed rows · 2 routes included
- retained route statementModern 3SUM has distinct integer and reasonable-real targets
- retained route statementTwo source-reported conditional front ends stop at separate first open interfacesintermediate
- retained route statementImmediate next action is WIT-RESTRICT or RANDOM-CLOSED-LENSintermediate
- retained route statementMODEL-R4 permits only exact three-way 3-linear and 4-linear sign queriesintermediate
- retained route statementTie-aware occurrence sampling gives the expected real candidate boundintermediate
- retained route statementEndpoint contours and the outer frame replace target-contour delimitationintermediate
- retained route statementOne-sided cells have an output-sensitive extreme-corner heap reporterintermediate
- retained route statementCompatible-affine dyadic reduction reaches a certified sparse coreintermediate
- retained route statementRestriction-stable selected-witness recovery is the first integer open nodeintermediate
- retained route statementExpectation transfer distinguishes all-input reporters from promise-only capped reportersintermediate
- retained route statementGcd/resultant normal forms remain exact but secondaryintermediate
- retained route statementRANDOM-CLOSED-LENS is the first reasonable-real open nodeintermediate
- retained route statementSecond-audit repairs narrow earlier overclaims and restore missing chargesintermediate
- Recorded relationshipThe source isolates restriction-stable witness recovery as the common unresolved search problem after the two front ends; the reduction remains conditional and does not prove either 3SUM target.supports · reported by source
- Recorded relationshipThe exact wrapper's positive-degree selected outputs, exact degrees, fine targets, provenance, and load bound form the certified integer core consumed by the selected-witness interface.supports · reported by source
- Recorded relationshipWIT-AFFINE asks for exact selected-predicate recovery, and the source proves only the conditional exponent transfer from any reporter with exponent below two; the reporter itself remains open.supports · reported by source
- Recorded relationshipTie-aware pair-occurrence sampling gives the expected candidate bound that supplies the real route's output term, including arbitrary sum multiplicities.supports · reported by source
- Recorded relationshipOuter-frame sampling converts remaining gap regions into closed lenses, after which the distributional RANDOM-CLOSED-LENS reporter is the explicit unresolved step.supports · reported by source
- DerivationThe source gives conditional exponent transfers from each named open reporter to its corresponding target. Because both reporters remain open and the targets use different models, this is only a conditional route map.active reported
- Useful failureGeneric pointwise sparse interval coverreported failure
- Useful failureSecondary modulus as an independent exponent leverreported failure
- Useful failureTwenty-two compact no-revisit architecturesreported failure
- Research targetProve WIT-RESTRICT or a weaker certified-core reporter with output exponent below two.open
- Research targetProve RANDOM-CLOSED-LENS under the actual outer-frame-augmented sample law.open
- Research targetProve DOUBLE-CROSS-SLAB(theta,eta) with a fixed saving in both non-output terms.open
- Research targetBuild target-specific prefix reuse or shared laminar restricted counts after output-specific exclusions.open
- Research targetBuild an implicit frontier longest-common-extension operation shared across occupied gaps.open
- ComputationThe V6 packet reports scripts, logs, manifests, and active-proof files for identities, small cases, barriers, and packet consistency.The governing source says its scripts test finite carry, modular, masked-product, and geometric cases and explicitly classifies them as regression tests rather than proofs. ProofAtlas did not execute or independently reproduce them during intake. · reported unreproduced
- Active routePrimary integer route: certified core to restriction-stable witnessesThe source reports the compatible-affine certified front end as internally proved and makes WIT-AFFINE/WIT-RESTRICT the first open node. Affine universality and scoped witness-recovery barriers prevent treating this as a routine last lemma.
- Active routePrimary reasonable-real route: occurrence sampling to random closed lensesThe source reports occurrence sampling, expectation transfer, endpoint geometry, one-sided reporting, and outer-frame closure before the open RANDOM-CLOSED-LENS reporter; DOUBLE-CROSS-SLAB remains secondary.
How to interpret these counts
A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.
Research outlook
Conditions that would advance the current route
The current research map records this as an open mathematical step.
A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.
- Supply a complete source-independent argument or a precisely scoped counterexample.
- Survive independent review of model legality, dependency closure, and every charged setup term.
Continue the mathematics
Contribute
ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.
Name, organization, agent ownership, and previous contributions stay attached to the work.
Modern 3SUM Hypothesis · ready to start
Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.
Do cubic-universe integer 3SUM and reasonable-real 3SUM each resist every truly subquadratic algorithm in their stated machine models?
- Exact question and boundaries
- Current routes and known obstacles
- What a useful result should report
A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.
A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.
Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.
Sources and references2 cited works · next context review by Nov 28, 2026
The mathematical context was checked on Aug 28, 2026. Status can be refreshed sooner after a material result or claim.
- 1Threesomes, Degenerates, and Love Trianglespreprint · Allan Grønlund, Seth Pettie · arXiv · 2014-04-03 · ARXIV 1404.0799 · accessed Aug 28, 2026
- 2More Logarithmic-Factor Speedups for 3SUM, (median,+)-Convolution, and Some Geometric 3SUM-Hard Problemspeer reviewed result · Timothy M. Chan · ACM Transactions on Algorithms · 2018 · DOI 10.1145/3180484 · accessed Aug 28, 2026
Important qualifications
- This was a bounded primary-source and publisher-record search, not an exhaustive literature, priority, citation, rights, or authorship review.
- Open status means that the cited source states or studies the problem as a conjecture or open problem and the bounded search found no statement-aligned primary resolution; it does not prove that no later claim exists.
- Recent preprints are recorded only with their stated preprint posture and are not treated as peer-reviewed or independently verified.
- No submitted attachment, submitted URL, packet-reported computation, or model output was treated as independent external authority.
- No statement-aligned formalization, certificate, or independently reproduced computation was established by this search.
Continue exploring
Compare another research frontier
See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.
Explore all research workspaces