01:05:51 It looks like some of OpenAI's recent math research has resulted in more ideal scaling assumptions for PQC 01:07:59 I'm not too sure how accurate this is, but apparently due to tighter Cohn-Elkies and sphere-packing bounds, you can calculate machine-verified boundaries on high-dimensional lattices. This is in contrast to existing lattice-based NIKE schemes such as SWOOSH, which had to be over-padded to compensate for the possibility of worst-case reduction attacks 01:10:16 Like, basically, it seems you can more tightly bound the LWE error stuff without being super conservative with padding and such 01:13:09 I think this sort of shrinking could also be done with codes used in things like McEliece. It seems there's also a preprint with elliptic curve-related research, which may be able to speed up key exchange 01:13:14 https://github.com/openai/math/blob/main/preprints/Exact-Birch-Swinnerton-Dyer-Formula-from-Low-Selmer-Corank-October-3-2026/exact-bsd-low-selmer-corank.pdf 01:13:39 My bad for overusing words like "seems", "looks like", etc., but I'm not too confident I understand half of this stuff correctly 01:18:20 https://github.com/openai/math/blob/main/preprints/The-Unique-Games-Theorem-September-23-2026/paper.pdf 01:18:56 ^ This one is especially interesting for ZK circuits/protocols