Every valid n-residue set needs modulus N≥2^n−2^floor(log2 n); the super-increasing construction is optimal.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
Every valid n-residue set needs modulus N≥2^n−2^floor(log2 n); the super-increasing construction is optimal. Open residue: Exact proposed optimum for every n≥2.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 4/5
For each n this is a finite modular subset/multiset-sum search, and violations have tiny explicit certificates.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 4/5
Verification note
CP-SAT/exhaustive search over residue sets and collision constraints; export a set or a proof of infeasibility. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.