Max Resnick retweeted
I am happy to announce our work "Practical Post-Quantum Secure Publicly Verifiable Secret Sharing and Applications" has been accepted at ACM PQQS 2026. (acm-pqqs.github.io/pqqs2026/…) In this work, we show that in a publicly VSS with a non-interactive dealer, NIZKs(for correct dealing) can be completely avoided by combining lattice-based IBE + a verifiable complaint phase between the receivers. This removes the necessity for a lattice-based NIZK for post-quantum PVSS and is useful for post-quantum secure applications over the blockchain. This is a joint work with @aniketpkate (Mysten Labs) @pratyaycrypto (Hashgraph) @sinharo (Hashgraph) and @thehumzasaleem. Paper link: eprint.iacr.org/2026/813
5
30
1,851
Max Resnick retweeted
Just posted a survey of pseudorandom codes! They're a fascinating new crypto primitive equivalent to robust and quality-preserving watermarks. The survey is a handbook for researchers & has many open questions. Enjoy! eprint.iacr.org/2026/2162
1
12
60
3,601
I think we are up to 5 papers this week? how many more are coming?
It turns out all you need to deploy an encrypted mempool (via Batched Threshold Encryption) is an off-the shelf DKG. No CRS required. Ciphertext overhead is 2G1 + G2 + 2F and partial decryptions are a single G1 element. Decryption runs in O(B log^2 B) time.
5
1
36
3,762
Max Resnick retweeted
Alpenglow is live on testnet ⛰️🎉
41
83
346
72,604
Max Resnick retweeted
Check out our latest cryptography paper, Batched and Weighted Threshold Encryption with Silent Setup. Building on BTX, this scheme supports many desirable properties of an encrypted mempool: ⚡ Weighted decryption (ideal for Proof-of-Stake blockchains) ⚡ Silent setup (key generation no longer requires interaction between parties) ⚡ Batch and index independence (more user friendly and fewer constraints on decryption) We’re excited about the future of encrypted mempools! Paper link: eprint.iacr.org/2026/2087 Authors: Amit Agarwal, Champ Chairattana-Apirom (Category Labs intern ‘26), @sourav1547, Babak Poorebrahim Gilkalaye
25
47
205
26,346
Big week for results about weighted batched threshold encryption if you are into that sort of thing. And we are only halfway through the week :)
10
1
29
4,591
New paper alert! 🚨 Weighted Batched Threshold Encryption with Efficient DKG w/ Alexander Frolov, @AditiPartap97, and @ErtemNusretTas In multi proposer consensus, transactions should be hidden until “valency”, the point of no return at which the consensus outcome has been decided. The cleanest way to achieve this property is with threshold encryption. But existing schemes forced difficult tradeoffs between batched, weighted, and efficient schemes. I asked the @a16zcrypto research summer interns if they could come up with a new scheme that was weighted, batched, performant, and didn’t require a trusted setup. Turns out they did!!! With some optimizations, I was able to get decryption for up to 16 simultaneous proposals to run in ~40ms on 12 cores with thousands of virtual shares and decryption shares that are small enough to fit in a single UDP packet along with the rest of the vote data. This leaves enough performance headroom room on my dev box to run a full Solana validator at the tip with the remaining cores!!! These results, along with other recent work in threshold encryption are finally pushing threshold encryption into the realm of practicality for use in the Solana protocol. We still have some more optimizations to try so we might be able to push it even lower!
16
12
103
33,432
Max Resnick retweeted
fun story: ~3y ago when we first constructed STE, we thought we also had a weighted construction but it turned out to be broken everyone would always ask: but what about weights? (cc @MaxResnick among many others) i'd hoped to solve it and add it to my thesis but just never managed to dedicate the time. nor did I have a magical stroke of genius lol but thanks to ai and all the other great researchers whose work helped me understand the problem much better, i finally managed to get (some?) closure many more open questions, but this was a personal favorite and of course, many thanks to @_patrickogrady and @commonwarexyz for their unwavering support and encouragement
Today, I'm excited to share @commonwarexyz's new SOTA result on weighted threshold encryption with silent setup. For the first time, the CRS size and public key of each party is O(W) group elements (where W bounds the total committee weight).
7
46
3,026
Max Resnick retweeted
Today, I'm excited to share @commonwarexyz's new SOTA result on weighted threshold encryption with silent setup. For the first time, the CRS size and public key of each party is O(W) group elements (where W bounds the total committee weight).
3
8
77
7,448
Max Resnick retweeted
Look we've tried Uranium 235 with k_eff of 0.1, 0.2, 0.3, and none of them have had a "recursive self-propagating neutron chain reaction". If you were right, we would see some smaller explosions before 0.9. Your prediction of explosion past the critical point is unfalsifiable!
18
39
461
10,567
Max Resnick retweeted
Transaction V1 (SIMD-0385) is live on mainnet-beta. Max transaction size grows from 1,232 to 4,096 bytes. ZK proofs, large multisigs, BLS signatures, and confidential transfers that required multiple transactions now fit in one atomic operation. V1 also moves resource requests (compute unit limit, priority fee, loaded accounts data size, heap size) into the transaction header instead of compute budget instructions.
17
57
254
103,290
Bonding period for arxiv papers @a1lon9
A modest proposal: any mathematician can only write/post on arxiv at most 3 papers per year, just pick your best ones
3
10
2,045
Max Resnick retweeted
There once lived a mathematician named Petrov. Petrov was working on a problem. The problem was very difficult, and so Petrov worked on it for twenty-three years. At first Petrov was young and worked on the problem quickly. Then he grew older and worked on it more slowly. Toward the end, he hardly worked on it at all. He mostly just sat in front of it and looked. The problem, meanwhile, wasn’t going anywhere either. Every morning Petrov got up at half past seven, drank some tea, and sat down to work on the problem. At twelve o’clock, Petrov would get up from the table and say: “No.” Then he would have lunch. After lunch Petrov would sit down with the problem again, and at six o’clock he would say: “No again.” And so the day would pass. One day Petrov’s wife asked him: “Petya, what will happen when you solve the problem?” Petrov was frightened. He had never thought about it. “When I solve it,” Petrov said, “then it will become clear.” And he sat down to work on it again. Five years later, Petrov’s wife asked him again: “Well?” “What?” “Has it become clear?” “Not yet.” That was the end of the conversation. Petrov’s colleagues treated the problem with great respect. One professor would say: “A very important problem.” Another professor would say: “An exceptionally important problem.” A third professor said nothing, because he himself did not understand the statement of the problem. But whenever anyone asked him about it, he would frown and say: “There’s something considerably subtler going on there.” For this, the third professor was held in especially high regard. Petrov wrote seven papers about the problem. The first was called “Some Remarks on the Question.” The second was called “Some Further Remarks on the Question.” The third was called “On the Impossibility of Certain Remarks on the Question.” Petrov wrote the fourth in English, which made it seem especially serious. Nobody read the fifth. The sixth was read by one man in Canada, but it later turned out that he had confused Petrov with another Petrov. Petrov decided not to publish the seventh. It was the best one. Several more years passed. Petrov developed gray hair. Then he developed more gray hair. Then he developed less hair. The problem did not change in the slightest. One day, a computer appeared at the institute. The computer was installed in a separate room. At first Petrov paid no attention to it. “A machine,” Petrov would say. Then the computer began writing papers. Petrov became interested. Then the computer began proving theorems. Petrov became concerned. “What sort of theorems?” he asked. “Various ones,” he was told. Petrov did not like this. “My problem is beyond it anyway,” Petrov said. And, just in case, he closed the door to his office. A week later, a young researcher named Sidorov knocked on Petrov’s door. “Come in,” said Petrov. Sidorov came in. “Pyotr Nikolaevich,” Sidorov said, “the computer has solved your problem.” Petrov looked at Sidorov. Then at the window. Then at Sidorov again. “Which problem?” “Yours.” “I have lots of problems.” In fact, Petrov had only one problem. “That one,” Sidorov said. “Impossible.” “Possible.” “It solved it incorrectly.” “We checked.” “Who did?” “The computer.” “The computer checked the computer?” “Yes.” Petrov thought about this. “That’s not serious,” he said. Sidorov then placed a printout in front of Petrov. The printout was four hundred and eighty-three pages thick. Petrov looked at the first page. Then at the second. Then at page four hundred and eighty-three. On page four hundred and eighty-three there was a little square. Petrov became very angry. “I could have put a square there too,” he said. “The square isn’t the point,” Sidorov said. “Then why is it there?” Sidorov did not know. The next day there was a seminar. The computer did not attend. This reassured Petrov somewhat. Sidorov gave the talk. For two hours he explained the proof. Petrov shook his head the entire time. After the first hour, he said: “There’s a mistake here.” “Where?” Sidorov asked. Petrov pointed. It turned out to be the page number. Twenty minutes later, Petrov said again: “There’s a mistake here.” This time it turned out to be a paper clip. After that Petrov was silent for a while. At the end of the seminar, the director of the institute stood up and said: “Colleagues, an extraordinary event has taken place.” Everyone applauded. Petrov applauded too, because at first he had not understood what the director was talking about. Then he understood and stopped. The director continued: “A problem that remained open for more than forty years has been solved.” “Twenty-three years,” Petrov said. “What?” “I worked on it for twenty-three years.” “Very good,” said the director. “Then you must be especially pleased.” Petrov was not pleased in the slightest. After the seminar, everyone went to have tea. The computer was not given any tea. Petrov saw a certain justice in this. The next morning Petrov came to the institute as usual. At half past eight he entered his office, took off his coat, sat down at his desk, and took out a notebook. Then he remembered that the problem had been solved. He closed the notebook. A minute later, he opened it again. Then he closed it again. At ten o’clock Petrov went out into the corridor. “Sidorov!” he shouted. Sidorov came over. “What am I supposed to do now?” “What do you mean?” “The problem is solved.” “Take another one.” Petrov was astonished. “What do you mean, another one?” “Another problem.” Petrov looked at Sidorov as though Sidorov had suggested that he take another surname. “That was my problem.” “Now it’s solved.” “That is exactly why it was mine.” Sidorov did not understand and walked away. Petrov returned to his office. Twenty-three notebooks lay on his desk. In the first notebook, it said: “Let us try to prove the following.” In the last notebook, it said: “Let us try another way.” Petrov stared at those words for a long time. Then he turned the page. The page was blank. It was the first completely correct page in twenty-three years. At noon, out of habit, Petrov said: “No.” But this time nobody had asked him anything. A month later, the director summoned Petrov. “Pyotr Nikolaevich,” the director said, “we need to talk.” “About the problem?” “No.” Petrov immediately understood that the conversation was going to be bad. “You see,” said the director, “computers solve a great many problems now.” “I’ve noticed.” “And they do it quickly.” “That is their weakness.” “Why?” “They don’t have time to understand what they’re doing.” The director wrote this sentence down on a piece of paper. Petrov brightened. But the director was only testing his pen. “In any case,” the director said, “your position is being eliminated.” “Why?” “Optimization.” “What does that mean?” “It means your position no longer exists.” Petrov thought about this. “And me?” “You still exist.” “Without a position?” “Yes.” For a long time Petrov could not understand how a person could exist without a position. Then he remembered that the problem had existed for twenty-three years without a solution, and this reassured him somewhat. On his last day at work, Petrov packed his books into a box. There were too many books. So he left half of them behind. Then he thought about it and left the other half behind too. As a result, Petrov left the institute carrying an empty box. At the door he met Sidorov. “Pyotr Nikolaevich, where are you going?” “Home.” “What’s the box for?” Petrov looked at the box. “I don’t know.” And he gave it to Sidorov. At home his wife asked: “Well, what happened today?” “Nothing.” “And the problem?” “Solved.” “Congratulations.” “There’s nothing to congratulate me for.” “Why?” “I didn’t solve it.” “Who did?” “The computer.” His wife thought for a moment and said: “Then it’s a good thing you’re finally free.” Petrov was frightened again. He had never been free before. The next day Petrov woke up at half past seven, drank some tea, and sat down at the table. There was nothing in front of him. He sat there until twelve. At twelve, Petrov said: “No.” Then he had lunch. After lunch he sat down at the table again. At six o’clock he said: “No again.” This continued for another three days. On the fourth day, his wife asked: “What are you solving now?” Petrov wanted to answer, but could not. So he took a blank sheet of paper and wrote: “Problem. Find a problem that a computer will not be able to solve.” Petrov looked at what he had written and, for the first time in a long while, felt good. At that moment, the telephone rang. It was Sidorov. “Pyotr Nikolaevich,” he said, “the computer has just come up with a list of seventeen such problems.” Petrov put down the phone. Then he walked over to the window. The window was closed. Petrov thought for a moment and decided not to open it. It was the first decision the computer had not taken away from him. Source: translation of Boris Bilich
46
92
980
123,331
Epic timeout call by minter
2
4
1,818
Honestly none of you would have called that he is so goated
1
4
597
what scares me about pacing the frontier is what it means for tempo’s development roadmap
9
54
8,030
Max Resnick retweeted
If the Longhorns pull this out, do NOT forget that Steve Sarkisian went for it on 4th-and-9 from his own 42, down 20 points, because he was trying to win a football game rather than trying to avoid being blown out.
51
671
23,586
436,192
See you in the top 10 ap
1
10
2,097
Good half
10
1,595