i break things.

Chile
Joined January 2023
Ya está disponible el curso de blockchain desde 0 que dicté para el Diplomado de Postgrado USACH 🏰 ▶️5 clases en vivo por Zoom ▶️15 horas de video HD ▶️219 diapositivas ▶️15 Contratos Inteligentes ▶️Laboratorio interactivo Sepolia Leer más👉 cbaeza.com/blog/curso-blockc…
🤖 Made with AI
2
2
6
180
baeza.eth retweeted
if you have a qwen3.5 4b around, please try steering neurons L14 N8949 +1 and L13 N7956 -1 now you have evil qwen recipe: dose × median(‖resid‖ leaving layer L, tokens 1:) / ‖W_down[:, n]‖` at the down_proj at every input
451
1,180
658
20,542
3,611,625
baeza.eth retweeted
Solidity v0.8.38 is out. This release fixes a low-severity bug in the Yul optimizer, speeds up the Yul optimizer, and warns about identifiers in Yul and inline assembly that are going to be reserved starting from the Amsterdam EVM version.
4
17
7
91
4,405
In 2025, we published a bold proposal to use fusion reactors for gold production. And now we’ve done it: Mercury transmuted into stable gold, using fusion neutrons, at 10x the record set by CERN in 2025. We’ve reduced alchemy to a series of difficult but tractable engineering problems.
175
542
430
5,109
1,280,299
Just in case you needed a reminder, here is why half the internet still runs PHP.
125
218
32
3,080
312,790
baeza.eth retweeted
banger tshirt idea
-----BEGIN RSA PRIVATE KEY----- 4 -----END RSA PRIVATE KEY-----
73
1,287
113
13,420
226,342
I don't recommend anyone scramble to move their funds to new wallets today. But we should take the risks to cryptography from AI-accelerated math seriously, and minimize our exposure to not just quantum-vulnerable cryptography, but also potentially AI-vulnerable cryptography. The core new area of risk from this viewpoint is, unfortunately, ML-DSA / FHE / lattices. (and it's also another reason, along with quantum, why ECDSA might fall even faster than expected, hence the "fresh address" recommendation) So far most people have been in the mode of thinking "elliptic curves broken, hashes safe, lattices safe". But there is a good chance that the concrete security of lattices will take serious hits from the next two years of AI math. The basic threat model is: factoring is something that naively takes 2^(n/2) time, but over decades smart people have found and optimized number field sieves, and degraded that to 2^O(n^(1/3)), which is why RSA keys and signatures need to be ~400 bytes (and not 64 bytes). What if there are skeletons in the closet like that, both for elliptic curves and lattices, that we are simply not smart enough to discover - but bots soon will be? This is a major part of the reason why for the past year ethereum's lean roadmap has been going in the "hash-only" direction: no lattices, no ML-DSA, no Falcon, no lattice-based commitments inside ZK proofs, etc. Signatures in lean ethereum are all hash-based, either WOTS or SPHINCS-. For signatures and proofs, we already know how to go hash-only. The bigger challenge is for *public-key encryption* - and this goes far beyond blockchains. Secure communication, anonymizing protocols, lots of things need public-key encryption. And unfortunately there are long-standing mathematical theorems showing why public-key encryption cannot be done with hashes alone. You have to have some kind of trapdoor object that has at least one form of usable "structure" - either group theory (incl. isogenies) or lattices or code-based or potentially in the future even more newfangled and spooky things (local mixing?). But for anything that has structure, you should assume that AI will make at least some progress in breaking that structure. Here, one reasonable inference is that if you want to make something plausibly long-term secure, multiply the key sizes by 10. To me that's a very plausible world and something not at all extreme to predict. If AI will bring us 50 years of math in 2 years, then that 50 years of math may very plausibly include a "naive factoring -> GNFS" level of improvement to our ability to break lattices. In that world, lattices will still exist, but they will have to be significantly bigger to guarantee the same level of safety. And at those new larger sizes, hash-based constructions will beat lattice-based constructions on concrete efficiency in every use case where hash-based constructions are possible at all. Theoretically, of course it's possible that hashes are broken too (eg. P = NP would imply that). But I think P = NP is very unlikely. And intuitively, it's much more likely that a mathematical object has exactly no exploitable structure (like hashes are intended to), than that a mathematical object has exactly ~3 forms of exploitable structure (for elliptic curves: associativity, Schoof, pairings) and not some secret fourth form of structure we have not yet discovered that greatly degrades its security (for elliptic curves, ECDLP and pairing security). Similar for LWE, SVP, RLWE and the zoo of lattice problems. For this reason, we do not yet see any reason to worry and start padding the byte size of hashes (if we start to worry more, we would pad the round count first before doing anything to the byte size). Concrete TLDR, my own personal views: * Hash-based > lattice-based, in those situations where hash-based is possible at all * For anything lattice-based, be much more paranoid on param sizes. Remember that blockchains are only a small portion of the cryptography story; this point goes far beyond blockchains and applies to eg. access to websites, secure messaging, Tor / VPNs ... * For privacy protocols, strongly favor NOT putting encrypted notes onchain. Instead, send them offchain through some third-party mechanism. * If it's not difficult for you, keeping your funds in addresses which have not yet been used to make a transaction is a good idea. If it's easy for you, do it. **But be careful about migrations; I personally have lost more money in botched migrations than I have lost in all hacks combined**. * For multisig wallets, doing confirmations offchain is better than onchain, because this way the signatures of signer wallets do not get exposed to the public, so if ECDSA falls to AI much faster than expected, at least the multisig "gracefully degrades" to a 1-of-1 where the 1 is whoever was gathering the signatures - a much better place to be than "anyone can take the money" firefly.social/post/x/210783…
1,244
1,905
890
11,201
3,927,589
Introducing Unity Spark — a new way to create a game, iterate on it with others, publish it, and play it - all without writing a line of code. You'll build with artist-created assets from the Unity Asset Store, and then you can take your game to the next level by refining it in a new web-based editor. Prompt it. Perfect it. Publish it. Inspired games, with artist-created assets, built on Unity. Closed beta coming soon.
302
306
419
3,689
1,003,420
baeza.eth retweeted
🚨NEW EXPERIMENT 🚨 Playground is an experimental gaming platform that lets you create your own games with zero coding experience. If you can think it, you can play it. Go to labs.google/playground to learn more! Available to users 18+ in the US.
1,207
3,682
1,629
34,675
7,018,484
baeza.eth retweeted
Today I call upon the blockchain industry to calmly begin planning for "bunker mode". My personal recommendation is to set in motion a controlled mass migration of assets to fresh addresses, i.e. addresses whose pubkeys remain hidden behind a hash. Holders, starting with large and sophisticated ones, should consider moving the bulk of their funds to addresses that have never signed a transaction. And when they do sign one, they should also move remaining funds to a new address (possibly generated from the same seed phrase). Don't rush. While I believe there is cause for action a rushed migration would do more harm than good. Don't panic either. Moving assets to protected addresses is a simple, preventative step which does not require new cryptography or new wallets. IMO it is now reasonable to brace for the possibility that ECDSA breaks before qday, in the worst case in months not years. By "break" I mean fast private key recovery (e.g. in one week) on available hardware (e.g. a large GPU cluster). Recent days have been humbling for human mathematical intuition. Long-held, unquestioned hypotheses have fallen. This includes the n log(n) bound for integer multiplication and the 3SUM conjecture. In hindsight, May's unexpected disproof of the Erdős unit distance conjecture was our warning shot. Yesterday's OpenAI drop made it clear that mathematical superintelligence is upon us. They say there are weeks where decades happen. We are about to live through weeks where centuries of mathematical progress happen. Could our magic 64-byte ECDSA signatures be too good to be true? Was it just security through obscurity all this time? Elliptic curves feel especially vulnerable to superintelligence. Curves carry rich structure, with room for fancy tricks like Schoof, Frobenius, pairings. (By contrast, hashes are designed to minimise algebraic structure.) Separately, as Ewin Tang can attest, an efficient quantum algorithm sometimes foreshadows an efficient classical one. We should be open to the possibility of a classical counterpart to Shor that breaks elliptic curves and RSA at once. Also noteworthy is the striking under-representation of cryptographic breakthroughs among the 722 mathematical results OpenAI published. I've witnessed first-hand the US government censoring academic quantum cryptanalysis results. Backroom interventionism is my base case. I urge large, sophisticated actors to lead by example. Project11's "risq list" (bitcoin-risq-list.projecteleven[.]com) is a great tracker of exposed BTC pubkeys. Binance, Bitbank, Robinhood, Bitfinex, and Tether have an opportunity to harden their cold storage. Next month I'll address institutions in London in a live Q&A (forum.ethereuminstitutional[.]org/london-2026). Again, please do not rush. Wallets holding under 50 BTC enjoy partial cover from "Satoshi's shield", i.e. his 20K exposed addresses that hold 50 BTC each. Load-bearing signers like oracles and L2 security councils should consider rotating ECDSA pubkeys with every signed message and/or multi-signing with a hash-based schemes like SPHINCS. Exiting bunker mode safely will require post-AI cryptography. My inclination is to go all-in on hash-based cryptography and avoid structured mathematical assumptions entirely, whether from curves, lattices, or isogenies. A single battle-tested hash (e.g. from the SHA or BLAKE families) yields plausible post-AI security. The Ethereum roadmap on strawmap[.]org fully embraces hash-based cryptography with end-to-end formal verification as a response to the quantum threat. Those timelines must now be revisited and accelerated in light of mathematical superintelligence. I'll be pushing for maximum defensive acceleration.
5,958
6,265
2,292
25,558
6,654,755
NYSE announces tokenized stock trading platform. Wallstreet is going onchain. #tokenization #token2049
110
575
88
2,591
324,389
baeza.eth retweeted
Atomic synchronous composability is no longer a promise. History made on mainnet: the first atomic cross-chain L1->L2 transaction ever 🔥 And this is only the beginning for EEZ ... 🚀 @etheconomiczone
83
132
49
736
123,087
today we're releasing apex-flash-1, our first open-weights model for security research post-trained on real vulnerabilities we found and got paid for. we are also releasing the abliterated variant for researchers who want fewer refusals in their own authorized workflows. how we built it: cantina.security/apex-flash
91
170
59
1,513
294,583
baeza.eth retweeted
Security Update: We are responding to a security incident affecting part of our infrastructure. At this time, we have identified no immediate threat to MetaMask wallets. As a precaution, we are proactively exiting affected validators within our non-custodial staking operations, in coordination with clients, partners and security advisors. We’ll share further updates as appropriate. metamask.io/news/user-update…
390
639
398
2,577
1,550,710
The cryptographic world computer: vitalik.eth.limo/general/202… My attempt to express in somewhat concise terms the true meaning of basically everything planned to happen to Ethereum starting from the fork after Hegota. It's really not just a blockchain anymore. It's a hybrid architecture that combines together blockchains and modern cryptography, to enable much more powerful properties. FOCIL, EIP-8288, Lean consensus, state management, formal verification, advanced mempool improvements (including privacy), and the longer-term specter of obfuscation all mentioned.
588
1,001
508
5,716
1,502,207
baeza.eth retweeted
We are devasted to hear about the recent exploit and can imagine how difficult this must be for everyone involved. THORChain is decentralized and permissionless like Bitcoin, Ethereum, and BNB Chain. What responsibility should Bitcoin, Ethereum, and BNB Chain bear when handling known stolen funds? @star_okx @GracyBitget
THORChain and Stolen Funds: The Industry Needs Answers After the $1.46B @Bybit_Official hack last year, nearly $1.2B in stolen funds was reportedly traced through @THORChain as the attackers moved assets across chains. Today, following another major security incident at @Bitget , we are once again observing Bitget Exploiter funds being sent into the THORChain for asset swaps and cross-chain transfers. The question is no longer: “Does THORChain know these funds are associated with hackers?” The attacker addresses have already been publicly flagged and are being actively tracked by exchanges, blockchain security/aml firms, and the wider crypto industry. The real question is: When a protocol is aware that funds originate from a publicly identified major hack, yet continues to facilitate large-scale cross-chain swaps, how should the industry view this under the banner of “decentralization”? Decentralization should not become a blanket excuse when dealing with known stolen funds. If, after every major crypto hack, attackers can continue using THORChain as a route to move funds from ETH → BTC, BNB → BTC, and across other chains, the industry needs to seriously ask: What responsibility should THORChain bear when handling known stolen funds? @GracyBitget @xiejiayinBitget @benbybit
372
156
193
1,275
804,006
baeza.eth retweeted
🚨SOLIDITY-AUDITOR V4 IS NOW OPEN SOURCE (MIT LICENSE) A single command now gets up to 85% recall on High severity findings from multi-week contests from last year. This used to cost protocols tens of thousands - we made it FREE, so any dev can build more safely. by PAG team🫡
50
67
22
519
45,254
New post on Eth Research! Snappy with a memory: ~40% less gossip traffic By: - Nashatyrev 🔗 ethresear.ch/t/26078 Highlights: - Compressing the entire gossip stream with shared context (instead of per-message Snappy) significantly reduces inbound bytes: ~73% of today’s bytes for a default node and ~63% for an all-subnets node using LZ77-in-Snappy-format with a 64 KiB history. - Most of the gain comes from cross-message redundancy: the repeated topic string and repeated AttestationData across a slot effectively become short back-references, leaving an attestation largely as signature + indices (~117 bytes). - A 64 KiB-history, Snappy-format LZ77 stream compressor gets big wins on consensus gossip: attestations compress to ~42% and aggregates to ~63% of current wire size in both default and all-subnets scenarios. - The approach is practical to integrate: it can be added as an optional negotiated protocol (e.g., /snappy-stream/meshsub/1.2.0) that decompresses back into the existing gossipsub RPC stream with today’s ssz_snappy payloads—no changes to message IDs, validation, or the rest of the gossip stack required. - Performance and safety look acceptable: decoding is essentially as fast as current Snappy plus a history buffer (same decompression-bomb bound); live tests showed large reductions on attestation-heavy streams (~43–44% wire bytes in a hub-and-spoke setup), while CPU and memory costs are predictable (64 KiB history per peer direction plus tables; compression is costlier than decompression but still a few percent of a core across several peers in rough estimates). ELI5: Normally, each gossip message gets squeezed (compressed) by itself, like packing each toy into its own small box. This research asks: what if we pack a whole stream of messages together, so we can reuse patterns we’ve already seen? Because many gossip messages repeat the same pieces (like the same topic name and the same attestation details), keeping a short “memory” of the recent past lets the compressor say “same as before” instead of sending the full data again. That can cut a lot of network traffic, especially for nodes that listen to many attestation subnets.
2
2
1
11
2,545