Astra's n^1/400 approximation hardness could enable crypto assuming P≠NP
thomasahle · x · 2026-09-03
In a technical thread, thomasahle notes Astra also showed n^(1/400) approximation hardness from 3-SAT, which could be used for cryptography that is hard assuming P≠NP — still a cool outcome.
He adds that one "just" needs to show some problem is Exp-hard, which can be true even if P=NP, though it is likely harder. The best unconditional circuit lower bound remains Astra's n⁴/log n for the permanent.
More from Research
- Action Chunking Boosts Contrastive RL Even in Fully Online RL, Study Finds — ben_eysenbach · 2026-09-03
- Coding models are running out of data — PL researchers propose 'intent computing' as the fix — LingmingZhang · 2026-09-03
- davidad Backs Call to Ban Naive RLVR: 'Everything Should Be Model-Graded' — davidad · 2026-09-03
- Computerphile Deep Dive: How Watermarks Track AI-Generated Content — Computerphile · 2026-09-03
- TrafficLab 3D builds digital-twin traffic visualizations from CCTV footage and Google Maps — tom_doerr · 2026-09-03
- SOCO benchmark debuts at ECCV 2026: 1M+ pairs probe how vision models grasp object structure — HirokatuKataoka · 2026-09-03