Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper) profile picture

Cryptographer and Theoretical Computer Scientist @unisalerno. Juventino. Views are solely mine.

Salerno, Campania, Italy
Joined April 2009
Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)Photo by Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ (@giuper)
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
I lectured on the "ETH false" (#3SAT in subexponential time) result in my grad complexity class at CMU today. Didn't have time in 80 mins to do the full proof, but I hope I got across the main plan, and some of the basic TCS ingredients going into it. youtu.be/_HlQGMcQWhA
7
72
7
490
36,635
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
#ETH: I hit the annoying max-chat-length, so good time to pause. cs.cmu.edu/~odonnell/some_etโ€ฆ Still badly written, but I'm happy with this progression of ideas for # 3SAT (sparse permament) in time ~2^(n/sqrt(log n)). It's 5-page overview, 10 pages of stuff, 5 page bonus appendix.
3
7
76
6,869
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
An internal model at OpenAI has produced a claimed refutation of ETH! Russell Impagliazzo, Mohan Paturi, and I have been asked to help organize an open and independent examination of this claim. 1/4
299
753
540
7,392
3,722,515
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Avi Wigderson surveys the recently departed Michael Rabin's research eccc.weizmann.ac.il/report/2โ€ฆ
17
45
7,423
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Dolevโ€“Strong is arguably the most well-known consensus protocol, yet in about 45 years no deterministic protocol improved on its O(n^3) communication. With @komasito55 & Ling Ren, we get O(n^2 log^4 n) for Byzantine Broadcast, t<n faults, O(t) rounds: eprint.iacr.org/2026/2504
5
9
1
88
5,366
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Some magical progress towards "magic state" in quantum! Our @GoogleQuantumAI team has demonstrated "magic state cultivation" on physical hardware for the first time. The result is a 40x error reduction on our Willow processor vs. previous methods, achieving a state-of-the-art 99.99% logical fidelity. It's another step towards useful, error-corrected quantum computers to help solve the hardest problems. The result is published in Science today, watch the video below to see how it works
422
1,106
233
9,301
691,140
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
In case people think I am advocating for not being cautious, or thinking that AI won't be an issue for any cryptography, that's not the case. Let me word what I think would be a balanced approach regarding AI and crypto. 1/n
9
55
5
287
31,908
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Ese premio, que se llama Nobel, nunca alcanzรณ a ganar un Borges.
65
1,297
46
2,669
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
human: "god, why did you do that to integer multiplication?" god: "do what?" human: "nlogn. didn't you craft math to be elegant? beautiful?" god: 'the fuck's a log?"
32
181
8
9,700
294,181
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
I've been working on a tool to help humans write and understand game-hopping security proofs. It's just for "pen-and-paper" reasoning, not a formal verification tool. 1/3
2
13
59
2,230
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Suppose you have n integers, and you want to decide whether some three of them sum to zero. It's not hard to solve this problem in O(n^2) time (think how to do it, the dumbest algorithm takes O(n^3) time!) and for a long time it was thought that getting time O(n^{1.999999}) is not possible. This hardness assumption was shown to imply many other interesting hardness results. Not anymore! Claude obtained the O(n^{1.9992}) time algorithm together with a Lean proof, and the algorithm was checked and digested by Josh Alman and Virginia Williams who are leading experts in fine-grained hardness, so my a priori estimate that it's 99.99%-likely to be correct. My mind is just absolutely blown! It's crazy that in such simple to state problems progress is still possible after decades of many smart people thinking hard about them.
13
67
13
846
102,716
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
The Alon-Yuster-Zwick color coding trick can be used to get 2^{O(sqrt(n))} size depth-3 AC circuits for every symmetric Boolean function!! arxiv.org/pdf/2609.34029 Just the latest exhibit that "circuit lower bounds are hard to prove because they are false"
5
28
4
181
17,349
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
New paper with Eshan Chattopadhyay, Chin Ho Lee, Shachar Lovett, Avishay Tal and Emanuele Viola: Exponential correlation bounds for polynomials and polylog-seed PRGs for AC0[2] eccc.weizmann.ac.il/report/2โ€ฆ
1
10
5
95
35,595
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
WOW!! Zeta(5) is irrational! Here's a Lean formalization: github.com/mo271/zeta5 Amazing what we'll learn (with AI help)
23
91
17
495
74,771
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
2
15
2
83
7,622
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Outstanding progress towards the Unique Games Conjecture posted by Yumou Fei, Dor Minzer, and Shuo Wang: eccc.weizmann.ac.il/report/2โ€ฆ ๐Ÿ‘€
4
35
3
213
46,989
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
โ€œConverting an abundance of proofs into human understanding may become one of the central challenges of our fieldโ€
Some thoughts on AI and Theory. 1. To a first approximation, theoretical computer science has been organized around a few major open questions. Much of our work has been motivated by developing approaches to answer these questions. 2. Such โ€œproblem-motivatedโ€ work has often led to theory-building focused on identifying a general principle that unifies a class of theorems. But much of that theory-building also involved proving new, difficult theorems. 3. Thus, while itโ€™s true that problem-solving was strongly correlated with building understanding, drawing connections, and eventually developing general theories, it would be disingenuous not to admit that our community, perhaps disproportionately in retrospect, focused on and celebrated problem-solving. This was not arbitrary, and was quite defensible. Being able to make progress on central technical questions usually correlated with taste, creativity, persistence, and depth of understanding. Much of our reward structure therefore implicitly relied on the fact that producing an important proof was good evidence that someone possessed these harder-to-observe qualities. 4. It seems likely that we will soon have AI tools available to us that can prove many such theorems in a short time. The cost of obtaining proofs for well-posed mathematical questions will likely fall dramatically. The โ€œscarceโ€ intellectual work will likely shift both upstream: to questions, models and theories, definitions, and conjectures, and downstream: to interpretation, synthesis, explanation, and theory-building. 5. But as long as we believe in humans being meaningfully in charge of our collective decisions and fate, building human understanding of our science (and of science more generally) will remain an essential goal. I plan to expand on this important aspect soon. 6. Historically, finding a solution to an important problem and understanding its significance, implications, and connections were entangled. Finding a proof usually required researchers to discover the right concepts along the way. A dramatic reduction in the time and effort required to prove theorems could break that coupling. We could end up with many more true statements and proofs without a commensurate increase in understanding. Converting an abundance of proofs into human understanding may become one of the central challenges of our field. 7. As a result, I expect the high-level goals of theoretical computer scientists to change. In fact, the advent of powerful theorem provers might help us construct new theories and explore new models far more easily and rapidly, and significantly expand the domains where our models and theories apply. In that sense, the space for theoretical work may significantly expand rather than contract. 8. Thereโ€™s a high human cost to the disruption that we are likely heading into. Many in our field, and in mathematical communities more broadly, are coming to terms with it. The range of opinions and reactions among mathematicians and theoretical computer scientists is a natural part of this evolution in our thinking as we collectively work through it. Some concrete efforts (including one at @SimonsInstitute) are already underway to think through the immediate scientific and institutional questions arising during this transition.
2
19
1,304
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
Sorry, @xkcd .
14
235
17
1,186
40,864
Giuseppe Persiano ๐Ÿ‡ฎ๐Ÿ‡น ๐Ÿ‡ช๐Ÿ‡บ retweeted
This reference list for Navier Stokes blowup is outrageous. No Chen-Hou, no Alpoge-Buckmaster, no Cรณrdoba and Martรญnez-Zoroa, no Elgindi. They are not properly attributing any previous work to the problem
62
456
46
5,774
405,177