みずばり1.7

[みずばり1.7 @mi2valley]

Jevはwaitlist制だった
登録Done。楽しみ

https://t.co/JvmmMYVwRj

[みずばり1.7 @mi2valley]

先輩がすごいって言うのでキャッチアップします

緊急で社内Jev勉強会を開催したらアイデアがバンバン出て頭が柔らかくなった - LayerX エンジニアブログ https://t.co/mLxyD0KgVb

[みずばり1.7 @mi2valley]

@optimisuke そういうことです！笑
完璧な角度です👍

[みずばり1.7 @mi2valley]

オデュッセイア面白すぎました
2回目行きます

[Lean @leanprover]

@AnthropicAI has shared the first end-to-end, computer-checked proof of Fermat's Last Theorem: 13 million lines of Lean, 29,500 intermediate theorems. Their announcement calls it "the largest Lean proof ever constructed."

See also Kevin Buzzard's blog post about the proof: https://t.co/lom08Euj3y

🔗 Anthropic's announce post: https://t.co/3N46u1GOtd
🔗 The code: https://t.co/ZiWpXiZBFM

#LeanLang #LeanProver #FLT

[みずばり1.7 @mi2valley]

すごい

[「進撃の巨人」公式アカウント @anime_shingeki]

◤◢◤◢◤◢◤◢◤◢◤◢◤◢
　　　　　9月9日
　「#進撃の巨人の日」制定
◤◢◤◢◤◢◤◢◤◢◤◢◤◢

『進撃の巨人』の連載開始日である
9月9日が日本記念日協会により
「進撃の巨人の日」として正式に認定されました！

制定を記念して、9月9日に各種企画を実施予定🔥
続報をお見逃しなく。
https://t.co/JIJqG3A37E

#aotday

[みずばり1.7 @mi2valley]

映画ちいかわ観てきた、ほんとに怖かったです

[みずばり1.7 @mi2valley]

すごい、再開してたの知らなかった

[WHITE ASH のび太 @Nobita_VoGt]

WHITE ASH再始動します！

SHINJUKU LOFT 50th ANNIVERSARY
WHITE ASH One Man Live 2026
“GO BACK TO WHITE”

日時：2026.8.9(日)
場所：新宿LOFT
open / start：16:00 / 17:00
チケット：5,500円(税込)

イープラス・プレオーダー
2026.4.4(土) 10:00 〜
https://t.co/4tJWroZrqt

[みずばり1.7 @mi2valley]

欲しい

[「進撃の巨人」公式アカウント @anime_shingeki]

◥◣楽天カードに、心臓をささげよ！◢◤

楽天カードに進撃の巨人デザインが新登場！
⚔エレン＆リヴァイデザイン
🛡調査兵団紋章デザイン

2種から悔いが残らないデザインを自分で選べ💳

詳細はこちら▷https://t.co/MSonkTR8xT
#shingeki

[みずばり1.7 @mi2valley]

AAでフルハウス完成したのにクワッズがいた
しかも3人別々のフルハウスが完成してる…

ゲームで良かった

#エッジポーカー

[みずばり1.7 @mi2valley]

VIVANT難しくなってきた
どういうこと？

[みずばり1.7 @mi2valley]

3Dプリンターでペンローズの三角形印刷してみた

[みずばり1.7 @mi2valley]

レイダースやってる
サーモンランで倒し方知ってると有利だな

[Keisuke Fujii @fgksk]

表面符号、エラー訂正ゲーム、syndrome sweeperを作りました。伝説の研究者ランクを目指そう。

https://t.co/YlE7GIAQ7T

[みずばり1.7 @mi2valley]

始まりがめっちゃボヘミアンラプソディで食卓の雰囲気も似てた笑

観終わった後にマイケルの甥っ子が演じてると聞いてびっくり。
声は混ぜてるみたい。

子役の子も凄すぎた。

#映画マイケル

[みずばり1.7 @mi2valley]

👀

[Cloudflare @Cloudflare]

We're opening the waitlist for our Monetization Gateway, which will allow you to charge for any web page, dataset, API, or MCP tool behind Cloudflare. The charges will settle in stablecoins over the x402 open protocol. https://t.co/pvICtEIixj

[みずばり1.7 @mi2valley]

久しぶりに自分の論文見たら引用数ちょっと増えてて面白い

[みずばり1.7 @mi2valley]

笑いと感動！
#劇団四季 #BTTF

[Justin Drake @drakefjustin]

Today a crazy quantum story just got wilder.

On March 31, the Google Quantum AI team published a landmark result on Shor's algorithm for elliptic curve cryptography. Technically, the paper was a bombshell: a dramatic 10x improvement over the state-of-the-art. As a stunt and wakeup call to the blockchain space, those optimisations were illustrated on secp256k1, the elliptic curve underlying Bitcoin and Ethereum signatures.

But perhaps the most striking part of the paper was sociological, not technical. Instead of following standard academic process, the optimisations were kept secret, hidden behind a zero-knowledge (ZK) proof. Google's accompanying blog post mentions they "engaged with the U.S. government". The ZK proof demonstrates the existence of algorithmic improvements without leaking details. Academic censorship with ZK, a historic first!

As a co-author of the Google paper I witnessed some of the context surrounding this censorship. To be honest, multiple aspects of that context don't sit well with me. As much as I believe the general public ought to know more, I am limited in my ability to whistleblow. Though let me be clear about one thing: the Google team's professionalism has been absolutely exemplary, and they deserve nothing but praise.

Censorship has a way of backfiring. The Streisand effect, where an attempt to bury something only draws more attention to it, is exactly what's unfolding today. First, Google's key optimisation has been rediscovered by the French. And in a thrilling turn of events, a collaborative Shor-at-home challenge just launched. The initiative, available at ecdsa[.]fail, breached a new Shor world record in a matter of hours.

Let's start with the rediscovery. Just two months after Google's paper, French quantum expert André Schrottenloher cracks the main secret optimisation. His paper, titled "Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms", landed on the arXiv today. Big congrats to André, who beat several other nerdsnipped experts to it. In a blog post also published today, Craig Gidney, the world expert on Shor optimisations, revealed that he'd been sitting on this very optimisation for a whole year under censorship pressure.

Interestingly, André missed a handful of minor optimisations, both from Google's original publication and from improvements found since. It's plausible there's still plenty of juice left to squeeze out of Shor, and this is exactly what the ecdsa[.]fail challenge is about. The verifier program developed for the ZK proof does double duty, automatically filtering for valid submissions. Dozens of compounding small and micro improvements are rolling in. As of the time of writing there's an 8.4% improvement to Google's circuit, as measured by the product of logical qubit count and Toffoli gate count. Nice!

The nerdsnipping ran deeper than anyone expected. Over the last few weeks it became clear it extended well beyond André and other quantum experts. Behind the scenes, a small army of amateurs quietly got to work. Inspired by Karpathy-style autoresearch, they turned AI on Shor. Ironically, the verifier program for the ZK proof makes an ideal reward function for AIs. The barrier to entry for this modern style of research is refreshingly low, with several non-experts, even a teenager, finding nice optimisations. Get in touch if you'd like to join a Telegram group with fellow autoresearchers :)

Part 2: neutral atoms and qday

The story doesn't end with Google. On the same day Google went public, a stealthy startup called Oratomic published its own Shor paper in a coordinated release. It made a splash, ultimately becoming the most upvoted paper on scirate[.]com, a website ranking arXiv papers.

Oratomic's claim was wild. By building on Google's logical optimisations and applying custom physical optimisations for neutral atoms, they claimed just 10K physical qubits were sufficient to run Shor's algorithm on secp256k1. That number is mind-bogglingly low.

Knowing essentially nothing about neutral atoms when Oratomic's paper landed, I was intrigued and decided to learn more about the tech. I fell straight down the rabbit hole and spent a couple hundred hours on the topic. I got a little obsessed and watched every YouTube video I could find and spoke to a bunch of experts.

My conclusion? The tech is real, very real. Even Google recently decided to start a neutral atom lab, a notable pivot from their sole focus on superconducting qubits. If you care about qday, i.e. the day a quantum computer will break the first piece of cryptography in production, neutral atoms demand your attention. I shared some of my learnings on Shor and neutral atoms in a 30min talk at the ZKProof cryptography conference. You can find it on YouTube by searching "zkproof neutral atom".

Here's an interesting observation about this duo of breakthrough papers: neither Google nor Oratomic say a word about what their results mean for qday. No timelines. Zero. Nada. That is especially baffling given that the whole point of whitehat quantum cryptanalysis is to inform qday estimations and help the general public make good decisions.

So let me attempt to partially fill the silence, similarly to what Scott Aaronson did in his April 29 post. Given everything I know, including scary non-public information, I now put the odds of qday by 2032 at 50%. 10% by 2030.

Anecdotally, the US government has its own date: 2035. Originating at the NSA and later adopted by NIST, it's when branches of the US government will be disallowed from using quantum-vulnerable cryptography. In plain language: with hindsight, that date is a joke and should be discounted entirely. I don't see how NIST avoids being forced to pull it forward by years.

Part 3: post-quantum cryptography

There are good reasons to sound the alarm today, but please do not panic. Rushing carelessly towards immature post-quantum cryptography is a recipe for disaster. IMO a good target date for migration is 2029, roughly 3.5 years out. 2029 happens to be the date selected by Google, Cloudflare, and the Ethereum Foundation.

These days most of my time goes to safely migrating Ethereum towards post-quantum cryptography as part of the broader lean Ethereum effort. There's a lot to do. We need to rip out and replace BLS signatures at the consensus layer, KZG commitments at the data layer, and ECDSA signatures at the execution layer.

The plan to get there is compelling, and is based on hash-based cryptography. Within the Ethereum Foundation we've developed a Swiss army knife called leanVM (github[.]com/leanEthereum/leanVM) powered by the magic of hash-based SNARKs. Thanks to truly exceptional work by Emile, Thomas, and others, its performance is derisked. Regarding security, leanVM is a jewel, a minimal zkVM crafted for end-to-end formal verification and maximum security.

Want to help? There are two $1M initiatives. First, the Proximity Prize (proximityprize[.]org). Solve a long-standing mathematical conjecture in coding theory, improve hash-based SNARKs, and go home a millionaire. Second, the Poseidon Initiative (poseidon-initiative[.]info), offers $1M for breaking Poseidon, the SNARK-friendly hash function.