godfather @OkayStudent

Full announcement: blog.zksecurity.xyz/posts/mpc-pitf… If you'd like an extra set of eyes on your MPC stack, reach out: [email protected]

On May 15, THORChain was drained for ~$10.7M. Root cause: a flawed implementation of GG20, an MPC-based threshold signature scheme. Theoretically sound MPC schemes keep failing in implementation. So we built a reference for it 👇

Getting increasingly bullish on just vibe-coding the important things in Lean. eg. see: github.com/Verified-zkEVM… blog.zksecurity.xyz/posts/end-codi…

Cryptographic protocols should be formally verified How do we do it in Lean, the fastest-growing proof assistant? Introducing VCVio (github.com/Verified-zkEVM…), a base layer for crypto proofs in Lean Joint work with @dtumad, @alexanderlhicks, James Waters & Nick Hopper 🧵/n

Are you interested in working at zkSecurity? Do you have what it takes to find bugs in ZK systems? Take our first challenge: github.com/zksecurity/zkB…

Breaking Jolt’s Verifier with an Unbound Uni-skip Claim blog.zksecurity.xyz/posts/jolt-uni…

Read more on how we broke and reported bugs in post-quantum lattice-based zero-knowledge proof systems, link in comment

Merkeziyetsizlik ile Trustlessness'ı karıştırıyorsunuz. Trustlessness (güvene ihtiyaç duymama), bir sistemin çalışması için herhangi bir kişi, kurum veya aracıya güvenmek zorunda olmaman demektir. Trustless sistemlere kimse müdahale edemez. Sistem çalışmaya devam eder. Trustlessness bir spektrumdur. Örneğin 1:1 Trust, Binance gibi. Bugün merkezi dediğimiz tek kişinin dediğinin olduğu sistemler. Örneğin 1:N Trust, sistem tek bir kişi doğru kalırsa çalışmaya devam eder. Herkes yalancı, tek bir kişi doğru ise müdahale edilemez, Seremony olan ZK Prooflar gibi. Blokzincirler ise N/2:N Trusttır. Sistemin yarısı üç kağıtçı ise sisteme müdahale edilebilir. Bitcoin de böyle. Ethereum da. Evet bunlar zamanında değiştirildi, müdahale de edildi. Ancak merkeziyetsizler. Çünkü N sayısı sonsuza kadar gidebiliyor. Merkeziyetsizlik başka bir konu. Desem de kimse sikine sallamayacak Kolay gelsin.

x.com/i/article/2035…

Adding Zero-Knowledge (ZK) to proof systems usually requires massive overhead or rewriting codebases. Enter VEIL: a lightweight, non-intrusive compiler for hash-based multilinear proof systems with just ~3% prover overhead by @SuccinctLabs. 🧵👇

ZK for hash-based cryptography is getting solved quickly! This sets the path for privacy applications: fast provers with minimal security assumptions running on mobile devices and web.

Thomas Coratger @tcoratger

3 months ago

Read the full paper by the Succinct team for the math! github.com/succinctlabs/s…

1 2 24 8K 14

3 polynomial commitment schemes powering every ZK proof system > KZG (Kate-Zaverucha-Goldberg) > FRI (Fast Reed-Solomon Interactive Oracle Proof) > IPA (Inner Product Argument) KZG (Kate-Zaverucha-Goldberg) → tiny proofs, needs trusted setup, not quantum-safe FRI (Fast Reed-Solomon Interactive Oracle Proof) → no setup, post-quantum, but large proofs IPA (Inner Product Argument) → no setup, no pairings, but slow verification Every ZK proof system picks one of these three. PLONK + KZG = compact on-chain proofs PLONK + FRI = Plonky2 PLONK + IPA = Halo 2

x.com/i/article/2036…

Zero-Knowledge Virtual Machines (zkVMs) are bridging the gap between cryptographic proofs and general-purpose programming. But with so many designs (SP1, RISC Zero, Cairo), how do they compare? A breakdown of the new SoK paper on zkVM architectures after a weekend read. 🧵👇

ZK proofs are headed for real-world deployment — but writing correct ZK statements is tricky. Our new post introduces zkLean, a Lean library that defines a domain specific language for specifying and formally verifying ZK statements. Read more: galois.com/articles/zklea…

Cursor destekli ilk Blockchain Hackathon’unu, Solana odaklı, Ankara’da gerçekleştirecek olmaktan büyük heyecan duyuyoruz!🦀 Sevgili @buildermare ile birlikte, geliştiricileri AI destekli Web3 geliştirme dünyasının geleceğini keşfetmek için bir araya getiriyoruz. Geliştiricileri güçlü yapay zekâ geliştirme araçlarıyla desteklediği için @cursor_ai ekibine büyük teşekkürler. Cursor sayesinde katılımcılar, fikirlerini sadece birkaç saat içinde çalışan Web3 uygulamalarına dönüştürebilecek. Hackathon boyunca geliştiriciler Solana üzerinde gerçek projeler geliştirecek. AI destekli kodlama deneyimini, en hızlı blockchain ekosistemlerinden biriyle birleştirerek DeFi araçları, AI agent’lar, developer tooling ve consumer uygulamalar inşa edecekler. Tüm katılımcılar Cursor kredileri kazanacak, en iyi 3 takım ise toplam $1.800 değerinde Cursor kredisi ve sürpriz ödülleri paylaşacak. Hadi birlikte inşa edelim 🦀🦀🦀🦀 luma üzerinden kayıt ol👇

BuilderMare @buildermare

4 months ago

We’re excited to host The First @cursor_ai Powered Blockchain Hackathon focused on @solana right here in Ankara! Together with lovely @turkiyerustcom , we’re bringing builders together to explore the future of AI-assisted Web3 development. Huge thanks to the Cursor team for

8 11 41 8K 8

ZK circuits are the least audited and most dangerous code in crypto right now. Most teams focus on the smart contract layer. The real risk lives underneath, in the constraint system. A ZK circuit defines what a prover must satisfy to generate a valid proof. If a constraint is missing or too loose, a malicious prover can create valid proofs for invalid state transitions. An under-constrained circuit can: Allow forged proofs that bypass validation entirely Enable double-spending through unchecked nullifiers Let attackers mint tokens from nothing with a valid-looking proof The worst parts are these bugs don't show up in testing. The circuit compiles. The proofs verify. Everything looks correct. Until someone crafts an input that satisfies your constraints but violates your intent. Most auditors treat ZK systems as a black box. They audit the Solidity verifier and skip the circuit. That's like auditing the front door while ignoring the open window. If you're building with ZK, your circuit isn't infrastructure, it's your most critical attack surface.

🌐 BlockFlow3: Consensus & Finality (Konsensüs Seviyesi) Nedir? ✨ Blockchain’in "Güvenlik Kilidi" ve "Kesinleşme Protokollerini" keşfediyoruz! 💡 Bu bölümde: Bir işlemin ağda nasıl geri döndürülemez hale geldiğini (Finality), BFT mekanizmasını ve kötü niyetli aktörleri durduran "Slashing" (cezalandırma) yapısını mercek altına alıyoruz. 🔗 BlockFlow3 yayında! İşlemlerin sadece hızlı değil, teknik ve ekonomik olarak nasıl "mühürlendiğini" öğrenmek için kaydırın!

keyboard_arrow_left Previous keyboard_arrow_right Next

Everyone agrees ZK-STARKs are top-tier for building blockchains. This wasn't always the case and it's good that it became consensus. What’s not consensus yet and I predict will become so: if your chain relies on ZK-tech, your programming language and VM should be ZK-optimized. A program written in a ZK-friendly language (e.g. Cairo) can be smoothly processed by a ZK-based VM. If it's written in a PL that's not optimized for ZK (say, Solidity), then you'll need to go through several workarounds, before a zkVM can process it. These workarounds mean that (1), you're loosing accuracy and efficiency, and (2) you might even risk bugs. You need the right tool for working with ZK.

5/ Whether you are a dev, a researcher, or just math-curious, this Open Access book is a masterclass in logic. Check it out here: math.cmu.edu/~jmackey/151_1… Let’s keep proving. 📚