CryptDoc. CompSci@National University of Singapore. 🇸🇬👨🏻‍💻 #Cypherpunk1991 @NUSComputing #ABCD_Engineer (AI, Blockchain, Cryptography, Distributed Sys)

Central Region, Singapore
Joined April 2016
There’s something that the education system lacks that somehow being in the blockchain industry has force one to come to understand that is very important. There’s a difference of intelligence between doing well in English language comprehension, understanding what you read, and the comprehension, thinking and evaluating what it actually is, be it truth or not, etc. some say it’s literature, it’s an art, but I say it’s actually more logical then an art.
18
Kenneth G | 振豪|恭一 retweeted
I'm still way more worried about concrete security breaks found by AI than theoretical improvements like breaking the exponential time hypothesis. I have yet to see a complexity theory result that actually matters in practice.
17
3
4
87
17,104
Kenneth G | 振豪|恭一 retweeted
We're glad to support wallet tools advancing privacy. So given this past week of attacks and exploits, it's worth emphasizing: privacy and security can't be isolated goals. You can worry less about an attacker utilizing your onchain history against you when privacy is a default.
The Kohaku team is working hard to make privacy a normal part of Ethereum. And we're all here for it. Their SDK, including integrations with @RAILGUN_Project, @0xprivacypools, and @TornadoCash, is becoming more and more mature. Now it's time for wallets to do their part. At @ambire, we've spent the past few months exploring the Kohaku SDK, testing integrations with different privacy protocols, and working closely with the team to share feedback and improve the integration. A lot of work happens behind the scenes, but we've never been closer to our first integration. Can't wait to watch @EFDevcon and see privacy in action in Ambire, presented by two of the best in the game: Nico and Vitalik.
18
25
5
201
11,959
Kenneth G | 振豪|恭一 retweeted
Doom scrolling? Level up instead - new game drop on Arcade.Gov 🎮
770
1,371
296
7,955
695,467
Kenneth G | 振豪|恭一 retweeted
Software Verification in Lean (SVIL) comes to Stanford University on Saturday, November 7. Co-organized by Beneficial AI Foundation and Lean FRO, it is a day of public lectures on advancing Lean’s software verification ecosystem toward production use, with a focus on end-to-end verification of security-critical systems. Talks will cover Rust verification with the Aeneas framework, low-level software verification, and formally verified OS kernels. Speakers include Max Tegmark, Shaowei Lin, Leonardo de Moura, Jonathan Protzenko, Andres Erbsen, and Mike Dodds. In-person space is limited. Non-local and waitlisted registrants will receive a livestream link, and recordings will be available afterward. Program and registration: beneficial-ai-foundation.git…
4
57
2
348
21,090
Kenneth G | 振豪|恭一 retweeted
I sketched out a lattice cryptography curriculum. I suspect it's not really possible to teach it unless the student's elementary linear algebra is fresh, and the student has a basic understanding of computational complexity such as NP-Completeness. If you have those two subjects down, then lattice cryptography is quite easy. I'm probably going to have to target those two subjects first because I'm not aware of any resource that provides the necessary practice but also doesn't have an uneccesarily wide scope. (For example, you don't need to know least squares or SVD, and I think turing machines are a waste of time for 99.99% of programmers).
Vote for what you want to learn next
31%lattice based crypto
16%lean4
13%PLONK
39%show results
67 votes • Final results
4
3
45
2,033
Kenneth G | 振豪|恭一 retweeted
Is Ethereum ready for the quantum threat? On the latest Ready for Merge podcast, EF cryptographer @asanso broke down the aggressive timeline and massive architectural shifts required to migrate Ethereum to PQ cryptography. 🧵👇
6
13
71
2,902
Kenneth G | 振豪|恭一 retweeted
This weekend we launched EthLib, a Lean4 library for Ethereum! The goal is to bring Ethereum's primitives, specifications and theorems into one place, building a shared foundation for formally specifying and proving things about Ethereum. github.com/ethereum/EthLib
15
55
7
307
12,725
Kenneth G | 振豪|恭一 retweeted
Too many hacks in the last 24h. If you do one thing today, do this 👇 > Update everything: browsers, OS, phones, desktop apps > Limit web browsing this week, don't click random links > Avoid untrusted Wi-Fi, use your hotspot > Watch out for phishing emails > iPhone 11-16? Turn Bluetooth off until Apple patches land > Devs: update all your repos S/O to @Eito_Miyamura for this practical checklist Stay safe everyone
26
20
3
134
23,148
Kenneth G | 振豪|恭一 retweeted
Claude Security now keeps up with your code as it changes. Connect your repositories once. Claude runs a deep first scan, then re-scans as changes land, so findings stay close to the current state of your code. In public beta on Claude Enterprise.
382
568
228
11,066
839,278
Kenneth G | 振豪|恭一 retweeted
Starting next week, sessions across Claude web, desktop, and mobile apps will run in auto mode by default on Pro, Max, and Team plans. Rather than asking you to approve each step, an automated check blocks risky actions. Switch back to manual anytime.
Starting August 14, auto mode will be the default permission mode in Claude Code for Pro, Max, and Team users. Auto mode reviews shell commands and actions with a separate classifier. In testing, it caught 89% of dangerous commands. Manual approval caught 14%.
812
850
494
21,038
2,775,922
Kenneth G | 振豪|恭一 retweeted
This is an excellent post. My only addition is that 1-of-2 signatures with lattices and hash can help a lot if the blockchain can quickly shut down one of them in case a break is found. This removes the need to migrate funds if it happens, and has a small cost over just lattice.
A few reflections on the lattice vs. hash-only debate that our recent Aerie post sparked: 1. Cryptographic ossification for blockchains was never safe. Until the day we know with certainty that P ≠ NP, that finding short vectors in lattices is intractable, that Keccak effectively behaves like a random oracle in deployed SNARKs, and that every single bug has been eliminated from our codebases, blockchains cannot ossify. That is simply not how safe systems are built. Issues will arise, and the system will have to respond. It’s a double standard to reject lattices because blockchains are hard to upgrade if lattices break, while counting on upgrades if AI breaks your hash function or finds a critical zkVM bug. The best counterargument is that hash-only designs are more agile: if your hash function breaks, just swap out the hash. But we must aspire to a higher level of agility than this. Indeed, as I cover next, if SNARK recursion itself turns out to degrade security, the proposed hash-only blockchain designs would need to be rethought from the ground up. 2. The real security debate is not lattices vs. hashes — it is lattices vs. building everything on SNARK recursion. That’s because “hash-only” is not really hash-only: it rests on hashes plus the soundness of deep SNARK recursion. Ethereum’s roadmap relies on exactly that: hash-based aggregation needs recursion to keep up with a slot’s worth of signatures, and EIP-8288 would send other signature schemes and users’ own proofs through the same recursive pipeline. In contrast, Aerie proves a slot’s worth of signatures on one laptop without any recursion. All deployed post-quantum SNARKs rely on the Random Oracle Methodology (via Fiat–Shamir) to establish their security. This is an idealization we know fails in the real world: we have explicit counterexamples where “SNARKs” coming out of this methodology are totally insecure when instantiated with any concrete hash function. We generally ignore these counterexamples in part because they only arise when proving contrived, self-referential statements about the very hash function used by the SNARK verifier. But proving statements about the verifier’s own hash function is the exact thing you do in SNARK recursion. That’s why the security of recursive SNARKs can’t be established even in the random oracle model. On top of that, the standard security proofs for recursion (in other models) suffer an “extractor runtime” blowup that is exponential in the recursion depth, suggesting that security may degrade as more recursion is applied. Yet Ethereum’s own EIP-8288 enables unlimited-depth recursion, even as it lists soundness of recursive SNARKs as a trust assumption. Proofs in more idealized models avoid the blowup, but they mainly tell us that an attack on SNARK recursion would have to exploit the concrete hash function, which is exactly what the Fiat–Shamir attacks above do. To be clear, we don’t know of any outright attacks on SNARK recursion, and I very much hope it is secure. But some of us who have studied the question have a lingering sense that an attack may be possible in some settings. And if AI is going to supercharge cryptanalysis, there is no reason to expect it to spare Fiat–Shamir for SNARKs, let alone SNARK recursion, both of which have had far less scrutiny than lattices. So, I do not concede that a “recursion everywhere” hash-only approach is clearly more conservative than one built on standard lattice assumptions. 3. “Just wrap everything in a hash-based SNARK” (like EIP-8288) faces challenges. Aggregating signatures and proofs off-chain into a single block-level proof is a powerful design independent of the hash-only vs. lattice debate, and I am not telling people to avoid it. But claiming, as Vitalik Buterin did this week, that users can run whatever cryptography they want locally and wrap it in a client-side leanVM proof glosses over major hurdles. For example, leanVM today is a minimal VM designed almost entirely to prove hash-based signatures and recursion, not general-purpose computation. And binary-field SNARKs like leanVM remain slow at proving the integer multiplications that lattice cryptography does en masse. I am optimistic that many of these zkVM challenges can be met (including via my own work, binary-field Twist and Shout, which are now implemented in Magnetar). But regardless, if lattices can make aggregation simpler and faster, then they should be leveraged. We need to be agile no matter what. 4. For chains whose reason for existence is privacy, I truly struggle to understand the pushback. Public-key encryption (and fast single-server PIR) cannot be built from hashes alone, at least not in any black-box way. If lattices break, it is going to be very, very hard for these chains to provide acceptable levels of privacy and functionality. For a project whose entire reason for existence is privacy, a loss of confidentiality is an existential failure. Next to that, a second signature upgrade (after the first one, from elliptic curves alone to, hopefully, a hybrid lattice scheme) is easy. Summary: We don’t know for sure what is secure and what isn’t. We are all weighing unquantifiable risks against each other, and we do not need to agree on a total order on them. But hash-only solutions face many open engineering challenges, and they are not more “conservative” in the way some have argued. Some of those challenges are entirely prosaic and have nothing to do with bugs or cryptography, like hardware support for custom schemes whose hash function is still undecided. I hope we can overcome those challenges within the appropriate timelines, but they must be acknowledged and portrayed realistically. Overall, cryptographic agility and defense in depth (e.g., hybrid signatures) are the answer, which is why we are building both lattice-Jolt and hash-Jolt. In practice, the positions are less polarized than social media discourse suggests: for example, StarkWare is working to make Falcon verification cheap (falcon.provably.fast/), which is great to see. Here is the (apparently) controversial take I am sticking to: Conditioned on agility, whenever lattices make systems simpler or more functional, we should embrace them rather than default to “hash-only” designs. Lattices are what the rest of the world will depend on, with decades of study and hardening behind them, and at the system level, less functional often means less secure. Where hash-only designs are just as simple and functional, by all means use them.
1
1
40
3,025
Kenneth G | 振豪|恭一 retweeted
A few reflections on the lattice vs. hash-only debate that our recent Aerie post sparked: 1. Cryptographic ossification for blockchains was never safe. Until the day we know with certainty that P ≠ NP, that finding short vectors in lattices is intractable, that Keccak effectively behaves like a random oracle in deployed SNARKs, and that every single bug has been eliminated from our codebases, blockchains cannot ossify. That is simply not how safe systems are built. Issues will arise, and the system will have to respond. It’s a double standard to reject lattices because blockchains are hard to upgrade if lattices break, while counting on upgrades if AI breaks your hash function or finds a critical zkVM bug. The best counterargument is that hash-only designs are more agile: if your hash function breaks, just swap out the hash. But we must aspire to a higher level of agility than this. Indeed, as I cover next, if SNARK recursion itself turns out to degrade security, the proposed hash-only blockchain designs would need to be rethought from the ground up. 2. The real security debate is not lattices vs. hashes — it is lattices vs. building everything on SNARK recursion. That’s because “hash-only” is not really hash-only: it rests on hashes plus the soundness of deep SNARK recursion. Ethereum’s roadmap relies on exactly that: hash-based aggregation needs recursion to keep up with a slot’s worth of signatures, and EIP-8288 would send other signature schemes and users’ own proofs through the same recursive pipeline. In contrast, Aerie proves a slot’s worth of signatures on one laptop without any recursion. All deployed post-quantum SNARKs rely on the Random Oracle Methodology (via Fiat–Shamir) to establish their security. This is an idealization we know fails in the real world: we have explicit counterexamples where “SNARKs” coming out of this methodology are totally insecure when instantiated with any concrete hash function. We generally ignore these counterexamples in part because they only arise when proving contrived, self-referential statements about the very hash function used by the SNARK verifier. But proving statements about the verifier’s own hash function is the exact thing you do in SNARK recursion. That’s why the security of recursive SNARKs can’t be established even in the random oracle model. On top of that, the standard security proofs for recursion (in other models) suffer an “extractor runtime” blowup that is exponential in the recursion depth, suggesting that security may degrade as more recursion is applied. Yet Ethereum’s own EIP-8288 enables unlimited-depth recursion, even as it lists soundness of recursive SNARKs as a trust assumption. Proofs in more idealized models avoid the blowup, but they mainly tell us that an attack on SNARK recursion would have to exploit the concrete hash function, which is exactly what the Fiat–Shamir attacks above do. To be clear, we don’t know of any outright attacks on SNARK recursion, and I very much hope it is secure. But some of us who have studied the question have a lingering sense that an attack may be possible in some settings. And if AI is going to supercharge cryptanalysis, there is no reason to expect it to spare Fiat–Shamir for SNARKs, let alone SNARK recursion, both of which have had far less scrutiny than lattices. So, I do not concede that a “recursion everywhere” hash-only approach is clearly more conservative than one built on standard lattice assumptions. 3. “Just wrap everything in a hash-based SNARK” (like EIP-8288) faces challenges. Aggregating signatures and proofs off-chain into a single block-level proof is a powerful design independent of the hash-only vs. lattice debate, and I am not telling people to avoid it. But claiming, as Vitalik Buterin did this week, that users can run whatever cryptography they want locally and wrap it in a client-side leanVM proof glosses over major hurdles. For example, leanVM today is a minimal VM designed almost entirely to prove hash-based signatures and recursion, not general-purpose computation. And binary-field SNARKs like leanVM remain slow at proving the integer multiplications that lattice cryptography does en masse. I am optimistic that many of these zkVM challenges can be met (including via my own work, binary-field Twist and Shout, which are now implemented in Magnetar). But regardless, if lattices can make aggregation simpler and faster, then they should be leveraged. We need to be agile no matter what. 4. For chains whose reason for existence is privacy, I truly struggle to understand the pushback. Public-key encryption (and fast single-server PIR) cannot be built from hashes alone, at least not in any black-box way. If lattices break, it is going to be very, very hard for these chains to provide acceptable levels of privacy and functionality. For a project whose entire reason for existence is privacy, a loss of confidentiality is an existential failure. Next to that, a second signature upgrade (after the first one, from elliptic curves alone to, hopefully, a hybrid lattice scheme) is easy. Summary: We don’t know for sure what is secure and what isn’t. We are all weighing unquantifiable risks against each other, and we do not need to agree on a total order on them. But hash-only solutions face many open engineering challenges, and they are not more “conservative” in the way some have argued. Some of those challenges are entirely prosaic and have nothing to do with bugs or cryptography, like hardware support for custom schemes whose hash function is still undecided. I hope we can overcome those challenges within the appropriate timelines, but they must be acknowledged and portrayed realistically. Overall, cryptographic agility and defense in depth (e.g., hybrid signatures) are the answer, which is why we are building both lattice-Jolt and hash-Jolt. In practice, the positions are less polarized than social media discourse suggests: for example, StarkWare is working to make Falcon verification cheap (falcon.provably.fast/), which is great to see. Here is the (apparently) controversial take I am sticking to: Conditioned on agility, whenever lattices make systems simpler or more functional, we should embrace them rather than default to “hash-only” designs. Lattices are what the rest of the world will depend on, with decades of study and hardening behind them, and at the system level, less functional often means less secure. Where hash-only designs are just as simple and functional, by all means use them.
29
60
23
261
32,428
Kenneth G | 振豪|恭一 retweeted
Engineering is moving faster than security teams 3 open-source repos worth adding to your stack before the next vulnerability slips through: 1. Cloudflare Security Audit github.com/cloudflare/securi… → helps review code and catch security issues before they ship 2. NVIDIA Skill Inspector github.com/NVIDIA/SkillSpect… → inspects AI skills and agent tooling for risky behavior and security problems 3. Strix github.com/usestrix/strix → uses AI agents to run penetration tests against your applications Shipping faster is great, shipping vulnerabilities faster isnt
19
66
6
456
80,050
Kenneth G | 振豪|恭一 retweeted
Ensuring Bitcoin’s future in a post-quantum world requires preparation and collaboration across the industry. We're doing our best to contribute to that work along with many others. New blog post live. (link in follow on post).
141
112
24
899
77,751
Kenneth G | 振豪|恭一 retweeted
Have to give the EU regulators credit where it’s due for making all Apple products use USB-C
3,585
5,859
602
168,154
8,154,331
Kenneth G | 振豪|恭一 retweeted
I'm getting really annoyed with the vibe of "AI will be able to do anything in the future, so there is no point in doing anything now." It's just a lame excuse to doomscroll and not build.
14
7
2
128
4,636
Kenneth G | 振豪|恭一 retweeted
Google open-sourced Harness². It lets an AI agent improve its own setup on every new task, without retraining the model. The setup around a model, its "harness", is normally designed once by a person: the system prompt, guardrails, memory, tool guidance, subagents, skills, scripts and plugins. Harness² edits all 8 while it works. How it works: → proposes changes to the harness for the task in front of it → tests those changes on that same task → keeps what actually worked better, with no answer key needed → carries the lessons into future tasks In Google's tests, one round improved GLM-5 and Gemini 3.5 Flash by up to 11.5 points on WorkBuddy-Bench and 11.8 points on LAB, a legal benchmark. Works with OpenCode or Codex. The demo runs on Linux with no API keys: git clone github.com/google-research/h… && cd harness2 uv venv --python 3.12 .venv && source .venv/bin/activate uv pip install -e '.[render]' harness2-demo --output runs/demo --k 2 Apache-2.0, 11.3K stars.
29
54
5
338
84,792
Kenneth G | 振豪|恭一 retweeted
We launched OSS Scanner, which gives critical open source projects free, periodic vulnerability scans from our strongest models. Each finding includes a proof-of-concept, and a patch where possible. red.anthropic.com/oss-scanne…
292
1,337
332
13,731
1,157,740
Cryptographic Agility ! Yes …..
what is cryptographic agility and why does it matter?
13