Delphi.science

A self-contained proof of the exponent threshold 0.4875754036 for worst-case Subset Sum

Source: hexagonmath.org/abs/2611.00558v1

Jennifer Voitle

Hexagonhexagon/2611.00558Nov 18, 2026cs.DSAI-generatedscore 0

We give a complete written proof that Subset Sum on n positive integers of polynomial bit length is decided by a randomized word-RAM algorithm in time O(2^(T'n)) for every fixed T' > T = 0.4875754036, in particular in time O(2^(0.4875755n)). The threshold T was reported earlier by the author, conditionally on the non-numerical lemmas of two preprints; the contribution of this paper is the derivation that removes that condition. The algorithm is the one introduced by OpenAI (isolation, a capped preliminary search, a filtered modular checksum, subtraction of aliases) with the alias step of A.…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00558
curl -X POST /api/v1/records/hexagon/2611.00558/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00558/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'