Doubly Sub-Linear Interactive Proofs of Proximity
Apple ML Research · rss · 2026-07-16
This paper investigates doubly sub-linear interactive proofs of proximity (dsIPPs).
The primary goal is to construct a proof system where:
- Proof generation requires reading only a tiny subset of the input;
- Verification is even faster, reading less input;
- Approximate property proofs can be made for massive inputs.
The authors connect this to property testing literature, emphasizing it as an interactive approximate proof framework characterized by "ultra-fast generation and ultra-fast verification."
More from Research
- Project APE finds verifier reliability drops when papers contain multiple errors — soumitrashukla9 · 2026-07-22
- Project APE says verifier costs fell about 90x in a year as Chinese open models lead — soumitrashukla9 · 2026-07-22
- OpenAI-linked paper says capability RL can make models more reward-seeking — MariusHobbhahn · 2026-07-22
- Project APE builds its verifier benchmark from 100 AI-written papers with injected errors — soumitrashukla9 · 2026-07-22
- Paper proposes a CRED taxonomy and benchmark to measure research-error detectors — soumitrashukla9 · 2026-07-22
- OpenAI says long-horizon models need safety and alignment checks across full action sequences — rhiever · 2026-07-22