Reproduce “Hardness Self-Amplification in Linear Algebra and Fine-Grained Cryptography” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Geoffroy Couteau, Nikolas Melissaris, Thejas Radhika Sajith
The authors amplify a linear-systems solver that succeeds on an inverse-polynomial fraction of random instances. Cheap, rank-n^0.32 matrix and right-hand-side updates preserve the solution and yield success on every right-hand side for all but a 2^-n^0.32 fraction of invertible matrices. The result supports a fine-grained one-way-function implication under almost-worst-case hardness, not unconditional existence.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.