I just confirm we exist.

A table listing total operations, number of qubits, and Toffoli-gate count for Google's low-gate and low-qubit implementations, and Trail of Bits' implementation. The Trail of Bits implementation beats Google's on every metric.

Two weeks ago, Google published a paper proving in zero-knowledge that they had an efficient implementation of Shor's algorithm.

Today, Trail of Bits can prove that we have an even better implementation which beats Google's on all metrics! 🫢

blog.trailofbits.com/2026/04/17/w...

I am trying to understand the cryptographic protocols used by the EU age verification app - and currently I am failing.

Is anyone able to extract how the age verification is supposed to work on a cryptographic level?

Sec. 3.4 describes issuing and presentation of attestations, but ...

Sadly, it appears Michael Rabin passed away on April 14. Among other achievements, Rabin received the Turing Award with Dana Scott in 1976 for their paper "Finite Automata and Their Decision Problems", a highly influential work in automata theory.
www.haaretz-evel.co.il/%D7%9E%D7%99...

A cluttered and complicated chart relating qubit counts to qubit error rates, comparing today's devices to cryptographic attacks.

Overdue quantum landscape update: sam-jaques.appspot.com/quantum_land...

A 2d chart can only say so much. tl;dr new results are still overhyped, but definitely worth taking seriously. This chart is based on surface codes and a big question now is whether new codes can be practical (=>useless chart)

Abstract. The Ethereum Foundation recently announced the Proximity Prize which aims to resolve some open problems that play an important role in the design of succinct proof systems. This paper reviews the open problems relevant to the Proximity Prize. We focus on some grand challenges relating to list decoding bounds, proximity gaps, correlated agreement, and mutual correlated agreement,as they relate to proof systems and Reed–Solomon codes. Along the way we survey the known results on these topics.

Open Problems in List Decoding and Correlated Agreement (Gal Arnon, Dan Boneh, Giacomo Fenzi) ia.cr/2026/680

Not not not

by brute force

Gödel's Loophole - Wikipedia

(Solved) Gödel's Loophole is an "inner contradiction" in the Constitution of the US which Gödel postulated in 1947. The loophole would permit US to be legally turned into a dictatorship. It has been called "one of the great unsolved problems of constitutional law"
en.wikipedia.org/wiki/G%C3%B6...

his name should be named

Just kidding, of course it is CCS for me. Though some papers from last CCC sound interesting enough (Witness Encryption and NP-hardness of Learning, Space-bounded quantum interactive proof systems)

*looking at my draft and thinking if it is easier to sell it as a CCC or a CCS paper*

This year we are cooked - PKC, Crypto, TCC are in the USA, STOC and FOCS in the US, COLT in the US, Asiacrypt is in the Hong Kong (I prefer to go to the HK). Alternatives? CCC in Lisbon and CCS in The Hague

New Advances Bring the Era of Quantum Computers Closer Than Ever | Quanta Magazine Two research groups say they have significantly reduced the amount of qubits and time required to crack common online security technologies.

I already posted earlier links, here's a very timely quanta summary!
www.quantamagazine.org/new-advances...

"A child offloading a task they've never learned to perform is not making a choice. They're skipping a developmental step that was never developed. The capacity doesn't exist yet. The foreclosure may be permanent—and [b/c] they have no independent baseline, they cannot recognize what they're losing"

This site can’t be reached

there be dragons

A very nice explainer why "if you're so worried about quantum computers, why haven't they factored 21 yet?" isn't a very convincing argument. Look at the labels of the graph, and how extremely close the various lines are for factoring 21 and 2048 bit numbers. Polynomial scaling remains […]

Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, w...

...we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. ... the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, arxiv.org/abs/2603.28627

Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations Ryan Babbush,1, ∗ Adam Zalcman,1, † Craig Gidney,1, ‡ Michael Broughton,1 Tanuj Khattar,1 Hartmut Neven,1 Thiago Bergamaschi,1, 2 Justin Drake,3 and Dan Boneh4 1Google Quantum AI, Santa Barbara, CA 93111, United States 2Department of Computer Science, University of California Berkeley, Berkeley, CA 94720, United States 3Ethereum Foundation, Zeughausgasse 7a, 6300 Zug, Switzerland 4Department of Computer Science, Stanford University, Stanford, CA 94305, United States (Dated: March 30, 2026) The expected emergence of cryptographically relevant quantum computers (CRQCs) will represent a singular discontinuity in the history of digital security, with wide ranging impacts. This whitepaper seeks to elucidate specific implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and potential mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem over the secp256k1 curve, the core of modern blockchain cryptography. We demonstrate that Shor’s algorithm for this problem can execute with either ≤ 1200 logical qubits and ≤ 90 million Toffoli gates or ≤ 1450 logical qubits and ≤ 70 million Toffoli gates. In the interest of responsible disclosure, we use a zero- knowledge proof to validate these results without disclosing attack vectors. On superconducting architectures with 10−3 physical error rates and planar connectivity, those circuits can execute in minutes using fewer than half a million physical qubits. We introduce a critical distinction between “fast-clock” (such as superconducting and photonic) and “slow-clock” (such as neutral atom and ion trap) architectures. Our analysis reveals that the first fast-clock CRQCs would enable “on-spend” attacks on public mempool transactions of some cryptocurrencies. We survey major crypto…

> We demonstrate that Shor’s algorithm...can execute with either ≤ 1200 logical qubits and ≤ 90 million Toffoli gates or ≤ 1450 logical qubits and ≤ 70 million Toffoli gates

research.google/blog/safegua...

quantumai.google/static/site-...

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known p...

4색 정리 새로운 증명이 arXiv에 올라왔습니다.
New proof of the four color theorem
by
Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup
arxiv.org/abs/2603.24880

The System That Decides What Science Gets Published Is Breaking Down The peer review system that validates scientific research is trapped in a self-defeating cycle. A new mathematical model shows why—and what comes next.

Some first-rate science writing: For this story, @jdrakephd.bsky.social carefully read our recent paper and then we spent a very fun 90 minutes or so talking on zoom. His article that gets right to the heart of our model, explains it clearly, and then explores why it will matter in the future.

Why mathematicians are boycotting their biggest conference Mathematicians are threatening to boycott the field’s largest, most prestigious gathering this summer if it takes place in the U.S., as currently planned. Every four years since the turn of the twent...

a petition cites the recent American military actions in Venezuela and Iran, the suspension of visas from 75 countries and the continued presence of federal ICE agents across major U.S. cities as contrary to the ICM’s goal of fostering “a sense of international unity amongst mathematicians.”

Major conference catches illicit AI use — and rejects hundreds of papers The papers’ watermarks allowed organizers to detect use of large language models in peer review.

www.nature.com/articles/d41...

Gerd Faltings of Germany Wins 2026 Abel Prize in Mathematics Gerd Faltings proved a conjecture that had been unsolved for six decades, using connections between numbers and geometry.

The German mathematician Gerd Faltings is the winner of this year's Abel Prize, an honor that is regarded as mathematics’ version of the Nobel Prize. He proved a conjecture that had been unsolved for six decades, using connections between numbers and geometry.

Learning Functions of Halfspaces We give an algorithm that learns arbitrary Boolean functions of $k$ arbitrary halfspaces over $\mathbb{R}^n$, in the challenging distribution-free Probably Approximately Correct (PAC) learning model, ...

Well, this seems like a big deal. arxiv.org/abs/2603.087...

"This is the first algorithm that can PAC learn even intersections of two halfspaces in time 2^o(n)."

Our group in Tartu (me, @jannosiim , Roberto Parisella etc) have an opening for up to 3 positions (postdoc or PhD) in ZK. See the link below for more information
crypto.cs.ut.ee/Main/ZKPosit...

Pkc 2026 paper by @jannosiim.bsky.social (group member)

Maiara F. Bollauf - PhD in lattice-based cryptography The Cryptography Group at the Institute of Computer Science at the University of Tartu invites applications for a PhD position in lattice-based cryptography. The successful candidate will work on the ...

Our group in Tartu will have several new PhD positions this year. The first one on the web is this (Lattice-based cryptography, supervised by Maiara Bollauf)

sites.google.com/view/maiarab...

We are cucumber. We are legion