I think @fhenix should just open a proper neobank that’s respectful of people’s privacy.
I’m guessing right now people settle for this crap because they want the yield and there are no others options.
Well, there are.
AI makes the old web3 privacy tradeoff harder to defend. Public state was manageable when the adversary was mostly human, slow, and capital-constrained. Agents can scrape every mempool pattern, wallet behavior, liquidation condition, governance vote, and bridge route. FHE matters because it gives applications a way to compute on encrypted inputs instead of asking users to reveal everything before the protocol can act. @fhenix is working on the part that is hardest to retrofit later: private execution as a primitive. Privacy added after product-market fit usually becomes a compliance checkbox. Privacy in the execution model changes what can be built.
look at what’s pumping.
no longer just random memecoins.
the narrative is clear - ai.
and its risks make us finally talk about privacy and quantum resistance.
love how @fhenix is solving the lack of privacy in web3 with FHE - a tech that lets you process data without ever decrypting it.
started listening to this interview.
highly recommend if you want to know where the next crypto era is heading 👇
The $12.5B AI data privacy market forecast sounds like spend on governance, DLP, and consent tooling. Useful, but weak.
For enterprises, the hard problem is running inference or agents over sensitive data without exposing it to the model, vendor, or logs.
AI data privacy is the next hot topic.
The global AI data privacy market is currently valued at $12.5 billion.
By 2034, this market is expected to grow to $24.3 billion, exhibiting a CAGR of +7.9%.
As enterprises seek to integrate AI, regulatory pressure and sizable privacy controls must be addressed.
On top of this, skilled professionals who understand both artificial intelligence and data protection law are scarce, creating another bottleneck to AI adoption.
We expect to see much more attention on the AI data privacy industry over the next 12 months.
AI adoption is accelerating, but we are still early.
@0xSweep it would be interesting to measure the biological age impact of crypto versus other professions to evaluate if it’s an accelerate of aging processes
10 million people, surrounded by enemies.
Two spots in the global top 10 for entrepreneurship. The Technion and Tel Aviv University, right next to Stanford, MIT, and Harvard.
This isn’t luck - it’s a deeply rooted culture of resilience and excellence.
Israel’s integration into European and global research programs is not a favor, a political gesture, or charity. It is earned through pure merit. Our scientists and researchers are there because they bring irreplaceable value to global progress. 🇮🇱✨
#Innovation #Research #Tech #Israel @TechnionLive@TelAvivUni@IsraelinEU@EUinIsrael
My biggest concern is that this timeline ignores additional accelerations enabled by non-linearly improving AI agents.
How much of the 2030-2032 timeline is based on conservative assumptions we're making today, but that could be completely invalidated in the next 12-24 months?
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.
.@AngieMKTmom is truly the best. Professional, kind, way smarter than she cares to admit, and works harder and harder every day.
@fhenix will wins because those are our team members
as you might know I came into web3 from journalism - so I’ve done a lot of interviews with founders in the past
my (super biased) opinion on this one:
1/ @GuyZys is a genius I’m proud to be working with
2/ ADHD folks win
3/ quantum-safe tech wins
highly recommend to listen till the end…🍿
זה ההר שתבחרו למות עליו? אני הכי קפלניסט שיש בימינו, אבל ככה תחזירו אותי להיות ביביסט.
אין לכם מושג מה המשמעות כשיש ילד על הרצף, גם בתפקוד גבוה. הזילות במצב מרתיחה.
אתם יודעים כמה עולה קלינאית תקשורת, מרפאה בעיסוק, טיפול רגשי, טיפול התנהגותי, וכיוצ״ב בכל חודש?
אני יכול לשלם על זה פרטי. אחרים לא. מצאתם על איזו אוכלוסיה להתלבש.
@teachthemx3 That’s one of my concerns with education apps in general. We’re trying to discretize math knowledge too much so it cleanly fits in an app / in a data set where students get it right or wrong (and thus AI can train on it and ‘assist’).
Double edged sword