
DeFi Engineer | Solidity, Go, Rust Founder at Cleargate Finance @cleargatefi - financial platform for the machine economy 🥇 1st place, Uniswap Hook Incubator
Prague, Czech Republic
Joined February 2024
- Tweets585
- Following240
- Followers146
- Likes2K
Anton retweeted
Agentic commerce is growing fast.
Cumulative x402 transactions on @base: 58.8k in Q3 2025. 138.5M in Q3 2026.
Transactions under a dollar do not make fiscal sense for a credit card network. Stablecoins that settle for under a cent do, so AI agents can pay per API call.
Anton retweeted
The ideal agentic payment product should be able to answer these questions: was this agent allowed to spend this, and can you prove it later.
Anton retweeted
AI agents can pay now. Nothing makes them pay safely.
We're fixing that - spending controls that a hijacked agent can't break, and guaranteed settlement so merchants keep their money and more.
Powered by stablecoins, but you never see crypto complexity.
Cooking , stay tuned👨💻
Anton retweeted
T-17 DAYS UNTIL ETHONLINE
[███████░░░] loading...
> prize_pool: $100K+
> format: async
> build_mode: start fresh or continuity
$ apply --now
> ethglob.al/OIURI9PFWH
Anton retweeted
Looking for a job.
DeFi protocols built by me are processing thousands of dollars every day. Audit firms have struggled hard and tend to find nothing in my code. Things I build just work.
You know a few blogs that referenced my research, too.
Portfolio below. DMs open.
Anton retweeted
We're Super-Hyper-Exa-Excited to announce that DefraDB V1.0 is released!
Bringing the latest and greatest in Tracability, Governance, and Peer-to-Peer resilience. It's the Database of the future. Come build with us!
stats.source.network/q/RpqCt…
#DefraDB #Source #zerotrust #p2p
Anton retweeted
DeFiMath v3.5.0 → three input ceilings widened to their mathematical limit:
• sqrt: 1.21e42 → 1.158e59 (~10¹⁷×)
• Options MAX_EXPIRATION: 2y → 32y
• Binary MAX_EXPIRATION: 2y → 32y
Same precision, same gas, no API change.
defimath.com
Anton retweeted
Arbitrage auction mechanism based on EigenLayer AVS which reduce LVR for liquidity providers.
• EigenAuction: @ohMySolboy
atriumacademy.notion.site/Ei…
Anton retweeted
138 builders just spent 9 weeks chasing one problem: LP positions that survive volatility.
Friday, we put what they shipped onstage. UHI9 Demo Day brings the capstone hooks live: IL insurance, YieldBasis-style fixed yield, delta-neutral hedging, and fee-smoothing.
📅 Friday, June 19 · 11:00 AM Eastern
RSVP ↓
Anton retweeted
Don’t judge an account by its follower count.
An account with a couple hundred followers can be someone who changes your life.
An account with 30,000 followers can be trying to extract from you.
Treat everyone equally and kindly in the first interaction.
Anton retweeted
If you have API keys in your code, even private repos, now is the time to double check and change them...
We are investigating unauthorized access to GitHub’s internal repositories. While we currently have no evidence of impact to customer information stored outside of GitHub’s internal repositories (such as our customers’ enterprises, organizations, and repositories), we are closely monitoring our infrastructure for follow-on activity.
Anton retweeted
Hey @Support @stripesupport @premium Could you help me with a problem? It looks like your service has prohibited me from paying for my X subscription. And it has been like this for a year already. May I ask which rule or term did I break?
Anton retweeted
Lazarus Group Just Released “Mach-O Man” – A Brand-New Native macOS Malware Kit Targeting Fintech, Crypto, and High-Value Executives
You get an “urgent” meeting invite over Telegram for a Zoom, Teams, or Google Meet call. The link leads to a convincing fake website that tells you to copy and paste one simple command into your Mac’s Terminal to “fix the connection issue.”
You run it… and Mach-O Man has just taken over your Mac.
ABRAXAS $100 MILLION OIL ARBITRAGE: EXPLAINED
Abraxas Capital just closed out their shorts on $130M of Crude Oil. Last night, they were paying $600 MILLION per year in funding to maintain their $130M position.
Here’s why they might have been paying >$1M per day for this trade:
Anton retweeted
Today is a monumentous day for quantum computing and cryptography. Two breakthrough papers just landed (links in next tweet). Both papers improve Shor's algorithm, infamous for cracking RSA and elliptic curve cryptography. The two results compound, optimising separate layers of the quantum stack. The results are shocking. I expect a narrative shift and a further R&D boost toward post-quantum cryptography.
The first paper is by Google Quantum AI. They tackle the (logical) Shor algorithm, tailoring it to crack Bitcoin and Ethereum signatures. The algorithm runs on ~1K logical qubits for the 256-bit elliptic curve secp256k1. Due to the low circuit depth, a fast superconducting computer would recover private keys in minutes. I'm grateful to have joined as a late paper co-author, in large part for the chance to interact with experts and the alpha gleaned from internal discussions.
The second paper is by a stealthy startup called Oratomic, with ex-Google and prominent Caltech faculty. Their starting point is Google's improvements to the logical quantum circuit. They then apply improvements at the physical layer, with tricks specific to neutral atom quantum computers. The result estimates that 26,000 atomic qubits are sufficient to break 256-bit elliptic curve signatures. This would be roughly a 40x improvement in physical qubit count over previous state-of-the-art. On the flip side, a single Shor run would take ~10 days due to the relatively slow speed of neutral atoms.
Below are my key takeaways. As a disclaimer, I am not a quantum expert. Time is needed for the results to be properly vetted. Based on my interactions with the team, I have faith the Google Quantum AI results are conservative. The Oratomic paper is much harder for me to assess, especially because of the use of more exotic qLDPC codes. I will take it with a grain of salt until the dust settles.
→ q-day: My confidence in q-day by 2032 has shot up significantly. IMO there's at least a 10% chance that by 2032 a quantum computer recovers a secp256k1 ECDSA private key from an exposed public key. While a cryptographically-relevant quantum computer (CRQC) before 2030 still feels unlikely, now is undoubtedly the time to start preparing.
→ censorship: The Google paper uses a zero-knowledge (ZK) proof to demonstrate the algorithm's existence without leaking actual optimisations. From now on, assume state-of-the-art algorithms will be censored. There may be self-censorship for moral or commercial reasons, or because of government pressure. A blackout in academic publications would be a tell-tale sign.
→ cracking time: A superconducting quantum computer, the type Google is building, could crack keys in minutes. This is because the optimised quantum circuit is just 100M Toffoli gates, which is surprisingly shallow. (Toffoli gates are hard because they require production of so-called "magic states".) Toffoli gates would consume ~10 microseconds on a superconducting platform, totalling ~1,000 sec of Shor runtime.
→ latency optimisations: Two latency optimisations bring key cracking time to single-digit minutes. The first parallelises computation across quantum devices. The second involves feeding the pubkey to the quantum computer mid-flight, after a generic setup phase.
→ fast- and slow-clock: At first approximation there are two families of quantum computers. The fast-clock flavour, which includes superconducting and photonic architectures, runs at roughly 100 kHz. The slow-clock flavour, which includes trapped ion and neutral atom architectures, runs roughly 1,000x slower (~100 Hz, or ~1 week to crack a single key).
→ qubit count: The size-optimised variant of the algorithm runs on 1,200 logical qubits. On a superconducting computer with surface code error correction that's roughly 500K physical qubits, a 400:1 physical-to-logical ratio. The surface code is conservative, assuming only four-way nearest-neighbour grid connectivity. It was demonstrated last year by Google on a real quantum computer.
→ future gains: Low-hanging fruit is still being picked, with at least one of the Google optimisations resulting from a surprisingly simple observation. Interestingly, AI was not (yet!) tasked to find optimisations. This was also the first time authors such as Craig Gidney attacked elliptic curves (as opposed to RSA). Shor logical qubit count could plausibly go under 1K soonish.
→ error correction: The physical-to-logical ratio for superconducting computers could go under 100:1. For superconducting computers that would be mean ~100K physical qubits for a CRQC, two orders of magnitude away from state of the art. Neutral atoms quantum computers are amenable to error correcting codes other than the surface code. While much slower to run, they can bring down the physical to logical qubit ratio closer to 10:1.
→ Bitcoin PoW: Commercially-viable Bitcoin PoW via Grover's algorithm is not happening any time soon. We're talking decades, possibly centuries away. This observation should help focus the discussion on ECDSA and Schnorr. (Side note: as unofficial Bitcoin security researcher, I still believe Bitcoin PoW is cooked due to the dwindling security budget.)
→ team quality: The folks at Google Quantum AI are the real deal. Craig Gidney (@CraigGidney) is arguably the world's top quantum circuit optimisooor. Just last year he squeezed 10x out of Shor for RSA, bringing the physical qubit count down from 10M to 1M. Special thanks to the Google team for patiently answering all my newb questions with detailed, fact-based answers. I was expecting some hype, but found none.
































