Hi @SuiNetwork@SuiCommunity fam. I've created a script [1] to download the latest sui and move-analyzer
Note: suiup is downloading the whole archive (800M) (with all debug and validator tools)!
[1] https://t.co/bGuZLzuZkY
Thrilled to join @CosmoverseHQ — the legendary conference shaping the #InternetOfBlockchains 🌐
From day one, I’ve never missed a Cosmoverse, and this year is no exception.
I will present @goNativeCC analytics about Bitcoin Yield and how we enable it with our Zero Trust Architecture, @IBCProtocol mission and @SuiNetwork execution.
Split is a perfect destination for end of October conference (and here is a discount code: "SPLIT" for 15% off).
https://t.co/WTwoNXa0Bs
Back to actual research…
We present a family of space-efficient sumcheck algorithms, and show that they are optimal! 🍹
Joint work with Anubhav, Ale, @efedele16, @zkproofs, @TusharMopuri and @andrewztech
📚: https://t.co/GtWk6MoU0o
🧑🏻💻: https://t.co/3OL9BoDKGl
1/
🧵diving deeper into our new work on zkGPT: Proving LLM inference fast with Zero-Knowledge Proofs.
Why? Service providers might deploy a smaller/cheaper model than promised. ZK lets them prove correctness without revealing model parameters.
📄 https://t.co/ToX51Wla56
New fastest shortest-path algorithm in 41 years!
Tsinghua researchers broke Dijkstra’s 1984 “sorting barrier,” achieving O(m log^(2/3) n) time. This means faster route planning, less traffic, cheaper deliveries, and more efficient networks - and a CS curriculum revamp =)
[Revised] Scalable Collaborative zk-SNARK and Its Application to Fully Distributed Proof Delegation (Xuanming Liu and Zhelei Zhou and Yinghao Wang and Yanxin Pang and Jinye He and Bingsheng Zhang and Xiaohu Yang and Jiaheng Zhang) https://t.co/YxmnJKb5HV
🎙️This week @AnnaRRose talks with @ddkang, professor at UIUC and founding technical advisor at VAIL for an update on ZKML, which parts of ML proofs are generated on, and his new project ZKTorch.
https://t.co/J7HhWPApfo
🎙️This week @AnnaRRose and @angeris chat with Muthu from @ligero_inc about the evolution of Ligero, client-side proving, and programmable compliance.
https://t.co/wSk6L18rZo
[New] Gdel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness (Rahul Ilango) https://t.co/wxNAnbpe78
[New] Evaluating Larger Lookup Tables using CKKS (Jules Dumezy and Andreea Alexandru and Yuriy Polyakov and Pierre-Emmanuel Clet and Olive Chakraborty and Aymen Boudguiga) https://t.co/oW749Y1C0e
🎙️This week @AnnaRRose and @nico_mnbl talk with Dan and @sinu_eth from @tlsnotary about the project's evolution into a core PSE protocol, and how it enables cryptographically verifiable web data today.
https://t.co/odF8dNWJrl
Recommend checking out this interview with Victor Miller https://t.co/44obb6QHvB
I knew he was the first to give efficient pairings, but I didn't know he was also one of the first two people (independent works of him and Neal Koblitz) in 85 to suggest using elliptic curves for Diffie Hellman instead of mod p groups.