Paper 2026/1479

Conjectures and Barriers for RS-MCA

Przemek Chojecki, ulam.ai
Abstract

As a companion to the proved bounds in "Shortening Bounds for Reed-Solomon MCA", we formulate the complete finite Reed-Solomon mutual correlated agreement (MCA) problem and a pole-aware conjectural positive-density profile envelope. An exact first-match compiler and realized-image moment and incidence inequalities isolate the payments required for a safe certificate without confusing supports, pairs, rays, and affine slopes. We prove a ceiling-normalized moment obstruction, a projective incidence theorem and benchmark dimension diagnostic, and a moving-scale consequence of the previously proved implication from a Sidon payment through the Balog-Szemer\'edi-Gowers theorem and Boolean-cube growth. Exact unsafe edges, repository audits, and numerical margins lead to four direct adjacent conjectures - two MCA and two auxiliary list inequalities - whose safe sides still require primitive-fiber, residual-projection, algebraic-routing, and add-back payments. In a collision-nonbinding, subexponential-budget identity-candidate branch, we conjecture a non-oracular exhaustive atlas whose exact unsafe--safe bracket, through a proved crossing reduction, yields \(\delta^*_{C_n,\mathrm{off,sup}}=1-\rho_n-g^*(\rho_n,\log_2 |{\mathbb B_n}|)+o(g_n^*)\); the general identity lower route instead uses an exact pole-adjusted target, and no matching bracket is claimed for the unrestricted smooth or circle problem.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
Reed–Solomon codesmutual correlated agreementproximity gapsProximity Prizelist decodingadditive combinatorics.
Contact author(s)
prz chojecki @ gmail com
History
2026-07-23: approved
2026-07-20: received
See all versions
Short URL
https://ia.cr/2026/1479
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/1479,
      author = {Przemek Chojecki},
      title = {Conjectures and Barriers for {RS}-{MCA}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1479},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1479}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.