Felix Lin

42 posts

Felix Lin banner
Felix Lin

Felix Lin

@linlide

Senior cryptography engineer in blockchain and privacy computing, specializing in ZKP, FHE and symmetric cryptography @AntChain @AntChainOpenLab @zan_team

Katılım Mart 2023
72 Takip Edilen4 Takipçiler
Felix Lin
Felix Lin@linlide·
API Error: Claude Code is unable to respond to this request, which appears to violate our Usage Policy. This request triggered cyber-related safeguards. To request an adjustment pursuant to our Cyber Verification Program based on how you use Claude 😭😭😭
English
0
0
0
99
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Post-quantum signatures are orders of magnitude larger than ECDSA — a dealbreaker for high-throughput blockchains. Our zkDTVM changes that: 4,500 leanXMSS sigs (~5.3 MiB) is compressed into one ZK proof (~577 KiB). Single GPU results: ⚡ 17,857 leanXMSS verifications/sec ⚡ 21× faster than leanVM (CPU prover) ⚡ End-to-end quantum-resistant Next up: SPHINCS+. Full writeup 👇 openlabs-intl.antdigital.com/0x/From-Thousa…
AntChain OpenLabs tweet media
English
1
7
24
4.1K
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Introducing Pangolin: A padding-aware commitment scheme based on Basefold. Instead of materializing repeated padding rows after encoding, Pangolin uses a simple observation: Back-padding in the trace becomes front-padding in the encoded matrix. So the commit path can hash the padding row once and reuse its digest. Same commitment semantics — less prover work: ✅ Store the padding row once ✅ Fewer encoded rows to hash/read ✅ Less prover data and memory traffic ✅ GPU-friendly: less global-memory bandwidth pressure The 5th post in the zkDTVM series: openlabs-intl.antdigital.com/0x/Pangolin-Pa…
English
0
4
7
642
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Last week, zkDTVM proved 100% of Ethereum blocks. Every proof was under 8.8s, with an average time of just 3.1s. Fastest. Most Stable. Most Reliable.
AntChain OpenLabs tweet media
English
0
5
17
1.2K
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Introducing UniSkip-in-the-Tail: GPU‑native optimization for SumCheck's underutilized tail rounds. Instead of suffering through sequential memory‑bound rounds with shrinking trace height, we consolidate multiple tail variables into a single higher‑degree univariate evaluation. One algebraic construction — zero extra reconciliation phases: ✅ No Phase‑2 protocol (unlike Whirlaway) ✅ k rounds → 1 round via Lagrange bit‑lifting ✅ Alleviates memory bottleneck, boosts GPU resource utilization ✅ GPU‑friendly: parallel finite‑field eval over fixed interpolation domain openlabs-intl.antdigital.com/0x/UniSkip-in-…
English
0
4
7
615
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Introducing FusedCheck: a simpler way to verify LogUp in multi‑chip STARKs. Instead of running-sum columns or 300+ round GKR circuits, we fuse the permutation summation directly into the existing constraint sumcheck. One protocol instance — zero extra rounds: ✅ No extra columns or AIR constraints ✅ No shifted openings (~2× PCS cost saved) ✅ ~20 sumcheck rounds vs. 300+ in GKR ✅ GPU‑friendly: minimal sequential barriers Part 3 of the zkDTVM deep‑dive: openlabs-intl.antdigital.com/0x/FusedCheck-…
English
0
2
2
181
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Part 2 of the zkDTVM deep‑dive is out — read the post: openlabs-intl.antdigital.com/0x/A-GPU-Optim… We break down the SumCheck PIOP, the most GPU‑critical stage of the prover, and how we reshape it so every round becomes a large GPU‑saturating batched kernel. Inside: 🔹One SumCheck for all chips 🔹Univariate‑skip‑in‑the‑tail 🔹Algebraic decomposition 🔹Trace compression
English
1
4
11
784
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
zkDTVM Docker release is live! Run it and experience the fastest real-time prover for Ethereum block. What’s Next: 🔹May: Proof size <600KB (performance unchanged) 🔹August: Full open-source release Stay tuned! 👇 github.com/AntChainOpenLa…
English
0
4
11
666
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Our zkDTVM 16-GPU prover is now live and has taken the #1 spot on Ethproofs (@eth_proofs), enabling real-time proving for @ethereum: 🔹99% proving < 5.7s 🔹100% proving < 8.18s 🔹Avg proving time: 3.69s 🔹Security: 100-bit (UDR) Open-sourcing soon. Launching on @JovayNetwork soon. As the trusted on-chain data infrastructure for the agentic era, zkDTVM will power our ecosystem of Agent Web3 solutions—such as agent payments—with a robust, verifiable backbone. openlabs-intl.antdigital.com/zkDTVM #ZK #zkVM #Ethereum #EthProofs #RealTimeProving
AntChain OpenLabs tweet media
English
1
10
39
4K
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
We are thrilled to announce zkDTVM, a hardware-acceleration-first zkVM for the agentic era. 👉 openlabs-intl.antdigital.com/zkDTVM Key highlights: - Unified Sumcheck proving with rotation-free LogUp and compressed traces - CPU-free chip architecture with automatic instruction fusion - End-to-end GPU acceleration with multi-GPU linear scaling - 72% lower memory overhead, 45% higher execution throughput, 60% cheaper crypto verification zkDTVM will be live on Ethproofs @eth_proofs in late April. Stay tuned!
English
0
5
15
1.1K
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
Thrilled to share that our paper with @zhao_minghao on ZK verifiability for graph databases has been accepted by ICDE! From "trust but verify" to "private yet verifiable"—this is the future! We need not only verifiable self-driving cars but also verifiable graph databases! @VitalikButerin Graph databases face a critical challenge: Unlike SQL queries that map to static circuits, graph algorithms require iterative traversals and dynamic access patterns—fundamentally incompatible with ZKP arithmetization! Our ZKGraph introduces expansion-centric operator decomposition to bridge this gap: ✅ Decomposes complex graph queries into fine-grained expansion primitives. ✅ First system enabling arbitrary graph query verification while preserving data privacy. ✅ 17.4× performance improvement over naive circuit implementations. ✅ Constant verification time with perfect scalability. Next: We'll extend ZKGraph to support streaming graph updates and cross-chain verifiable computations. @frida_ying @ECNUER @drakefjustin @PolyhedraZK @ezklxyz arxiv.org/pdf/2507.00427
AntChain OpenLabs tweet media
English
2
3
3
1.2K
Felix Lin retweetledi
AntChain OpenLabs
AntChain OpenLabs@AntChainOpenLab·
⚠️ Current GGM-based zk-SNARKs may not guarantee security when deployed with elliptic curves! @gnark_team @zksecurityXYZ The Generic Group Model (GGM), long the cornerstone of zk-SNARKs security proofs, faces a critical flaw: Our research with @ZJU_China, which will be presented at Asiacrypt2025, reveals a complexity gap between GGM assumptions and real-world elliptic curve groups in encoding length. Next, we will develop EC-GGM frameworks to rigorously analyze the security in practice. Bridging theory & reality for robust zero-knowledge systems! iacr.org/cryptodb/data/… #ZeroKnowledge #Cryptography #Blockchain
AntChain OpenLabs tweet media
English
5
17
55
30.7K
Felix Lin retweetledi
Will Corcoran
Will Corcoran@corcoranwill·
Ethproofs call 5 just wrapped. The headliner, @donnoh_eth gave a fantastic deep dive into native rollups. This was preceded by lots of exciting updates and alpha from around the zk-proving ecosystem. Link to the recording and slides below 👇
Will Corcoran tweet media
English
1
3
25
5.3K