🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

We may have discovered a way for BitVM to do permissionless verification, effectively overcoming its primary limitation!🤯 If you're interested in helping us develop a Groth16 verifier using Bitcoin Script, please join the BitVM builders group t.me/bitVM_chat

OP_RETURN "Hello world!"

Fantastic talk by Liam Eagen at Research Day on how far we can go with verifying over computing. This is the right path to bring arbitrary computation to #Bitcoin & broadly applicable to any peer-to-peer consensus system.

Cypherpunks in Berlin researching bridges and scalability. Can we create smaller proofs? Lukas ncklr Liam Eagen

With help from Liam Eagen, I'm pretty sure this construction is broken. The commitment to sum a_iX^i is sum a_i G_i , for public generators G1,..,Gn But the verifier only uses the elements B=sum G_i B_d = sum n^i G_i when checking an evaluation. When n>2, We can use linear

Following up on our previous post on the rise of SNARKs, we’ve penned this blog post summarizing the landscape of SNARKs today and how we got here. alpenlabs.io/blog/current-s…

1/ [New Post] Programmable Cryptography (Part 1) by gubsheep Programmable Cryptography is a "second generation" of cryptographic primitives. What makes these primitives so powerful, and how might they reshape the Internet in the next 1-2 decades? 0xparc.org/blog/programma…

Excited to introduce the Shielded CSV 🛡️: Private and Efficient Client-Side Validation! Big thanks to co-authors Liam Eagen and яobin linus. Check out the whitepaper: github.com/ShieldedCSV/Sh… tl;dr: "The most interesting thing you can do with BitVM" (яobin linus) 👉 First

Alpen team has been COOKING 1000+ commits deep into the zk rollup stack for bitcoin…devnet is now live! Reach out to us to start building & stay tuned for some big upcoming upgrades 👀

Bitcoin privacy with ncklr яobin linus Liam Eagen (Bitcoin Takeover Podcast S15 E58) x.com/i/broadcasts/1…

10/10 Back on Stage 6, join Liam Eagen for the technical talk “Non-Native Arithmetic via CRT Codes”, 4:30–4:55 PM (Nov 14) app.devcon.org/schedule/B7CJU8

I'm co-organising a Community Privacy Residency in Taipei next Feb: focused on researching, co-designing & prototyping apps for community privacy. We invite community builders, designers, researchers, & advocates for digital safety and privacy to join us community-privacy.github.io

A smol but extremely elegant tweak, that unlocks fractional decomposition lookups for binary fields: eprint.iacr.org/2024/2067 Thanks to Liam Eagen for approaching me with this solution!

tomorrow i'll livestream s16 e2 of the bitcoin takeover podcast the guest is Liam Eagen – one of the most respected young cryptographers in the space, best known for his work on shielded client side validation, bulletproofs++, and full chain membership proofs

talking buletproofs++, fcmp & other cryptography stuff with Liam Eagen (bitcoin takeover podcast s16 e2) x.com/i/broadcasts/1…

We’re thrilled to announce our $8.5M Strategic Round, co-led by DBA and cyber•Fund. This round will help us supercharge the development and launch of Strata into mainnet in 2025.

Ross was just granted a FULL AND UNCONDITIONAL PARDON by Donald J. Trump. Words cannot express how grateful we are. President Trump is a man of his word and he just saved Ross's life. ROSS IS A FREE MAN!!!!!

This is a nice problem suggested by Liam Eagen . Fix primes s<<p. Thinking of s as having 128 bits and p having 256 bits. Let F be the field of size p. Fix any non-zero a in F^n. Let v=(r_1,...,r_n) where r_i=r^i mod s for random r in {0..s-1}. Think of v as a vector in F^n as

Mercury, with Liam Eagen, goes beyond previous techniques for multilinear commitment schemes, obtaining constant proof size rather than logarithmic, while preserving "elliptic curve linear time" - O(n) field ops and 2 size n MSMs, but no O(nlogn) from FFTs eprint.iacr.org/2025/385.pdf

I believe the BitVM3 RSA garbling scheme is likely broken for circuits with gates of fanout greater than 1. Because the evaluator is linear, we can solve for the output labels in terms of the adaptor elements using linear algebra. hackmd.io/@liameagen/bit…