You know that option we explicitly bundled into our signed legal agreement in the last round, yeah... now that its in the money, would you mind not excercising it so we can close this Sequoia round?
The recent advances in model capabilities are great for people who use math as a tool to do things and terrible for people who do math to do math.
-trades execute at bbo mid 😬😬😬😬
if i understand correctly, trades on @papertrade_xyz execute at the bbo mid precompile of their block inclusion
so that means when hyperevm hits the 3M gas limit 2s after launch on 10/10 and everyone needs to switch to big blocks, which take 1 min, everyone will be trading on a bbo mid 1 min in the future (ie/ you do not know what price you’re going to be executed at unless you’re a psychic)
doesn’t that undo the USP of 0 slippage? I guess the price delta in that 1 min will sometimes go for you, so it might avg to 0
regardless, this is probably the last time someone seriously tries to experiment on hyperevm (you can only burn your hand at the furnace so many times), so I really hope @izebel_eth makes it work
this is also the use case for @Enter_Elysium, but they won’t have precompiles upon launch afaik, although it should be a non-negotiable for a future upgrade imo since the only reason hyperevm exists is for precompiles
Max Resnick retweeted
Decentralized thoughts on how to take greater advantage of locality in BFT 🌎🌍🌏
with lead author Antoine Murat, and with Clément Burgelin, @jneu_net
decentralizedthoughts.github…
Max Resnick retweeted
1/ Short thread of quick visual explainers for the most significant or surprising results from tonight’s OAI math drop
First, the headline is the major breakthrough on Reimann. It’s not a solution to the hypothesis, but it’s a huge tightening on the bounds
🤖 Made with AI
This is like when Vinod did his first press conference as the owner of the Seahawks and spent half the time talking about how much of a Steelers fan he was.
Optimal strategy in Pace results in non 0 probability of catastrophy. But the leaderboard is weighted by realized catastrophy instead of probability of catastrophy. This leads to lots of variance in scoring. Similar to continuation problem game I posted about on here.
Roll a 6 sided die, you can choose to stop and get the average of all your previous scores or keep going. What is the optimal stopping rule?
How does this impact optimal strategy in the subgame.
Max Resnick retweeted
lol
We built a game to demonstrate the difficulty of pacing the frontier, based on a new paper from @andrewjkoh and @DrewFudenberg
Play online now and work your way up the leaderboard!
Max Resnick retweeted
the @fomo team discovered and reported this ring of validators for engaging in malicious behavior. cleaning up the chain one validator at a time.
Another wave of SFDP rejections just happened. These validators were part of 3 clusters I have previously documented on gossip.solstack.app, and are now out of the program.
Phase sybil group remains active.
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
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
I think we are up to 5 papers this week? how many more are coming?
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

























