🔥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

[arXiv find] Every Author as First Author Found a first author selection method better than best of three rounds of smash bros. #AcademicChatter #AcademicTwitter

Been looking into Circle STARKs and the Mersenne-31 prime after reading Eli Ben-Sasson's post. In Mersenne primes, p-1 isn't a large power of 2, but p+1 is. Here's a short proof of how you arrive at the circle group when looking for p+1 subgroups in the extension field:

We are excited to announce that we partner with Brevis to enpower DeFi and more onchain activities with affordable ZKP. Read the article: nebra.one/blog/brevis

1/ We're excited to share the initial release of Jolt, a new approach to zkVM design. Early benchmarks indicate it outperforms RISC Zero by ~6x and SP1 by up to 2x. Major optimizations are still in the pipeline.

🪐 "Proof Day" is happening in SF on April 17 with Accountable Magic Nascent Edge! Dive into an evening of insights with speakers shumo - e/acc Vincent Liew, Zatoshi (Aztec) Uma Roy (Succinct), Daniel Shorr Ryan Cao (Accountable Magic), Junda (Brevis)

We are stoked to announce that we have closed pre-seed/seed founding rounds from Nascent BanklessVC with participation from a16z crypto CSX, Daedalus, Dialectic, and Public Works 🌐 and many builders that we respect.

Super exited to partner with AltLayer to bring proof aggregation based settlement to the next 10,000 zkRollups onchain. As Restake/Acc spoken in our Proof Singularity Denver: "Rollup is the new smart contract". NEBRA + AltLayer can lower the settlement cost and bring native

What if… verifying the execution of pairings inside SNARKs can be done much faster than already known? Andrija Novakovic and @LiamEagen have just published a paper on this! Let’s explore this below 🧵 1/13

We've tripled the number of code lists since our last post on this. We highlight some of the new quantum code lists. errorcorrectionzoo.org/lists

Did a powerlifting meet recently! We fundraised for Community Lunch on Capitol Hill. Squat 185kg/408lb Bench 127.5kg/280lb Deadlift 225kg/496lb Total 537.5kg/1185lb Had a lot left on squat and deadlift. Maybe 550kg total next? 👀 Photo credit: Andrea Michelle

Renormalization group without any math: For the longest time we discovered more fundamental structures in nature. The further we zoom in the more new structure we see. The discovery of quarks is a good example Molecules → Atoms → nuclei → protons → quarks 🧵1/13

Announcing NEBRA UPA 1.1 Testnet: ✅ gnark Groth16 support (with and without commitment) ✅ Updated developer docs for gnark devs ✅ NEBEA SDK v1.1 with full gnark G16 support Dev docs: docs.nebra.one Proof explorer: nebrascan.io

Read more about why verification of ZK verifiers is essential eprint.iacr.org/2024/768 ZKProof Standards ZK Newsletter

Tragic news. Luca Trevisan passed away today. The talk he prepared in his final weeks for the TCS4all workshop will be given virtually in his honor on Monday. I hope many of the TCS community can attend. windowsontheory.org/2024/06/19/luc…

NEBRA Universal Proof Aggregation (UPA)  is launching on Ethereum Mainnet. NEBRA UPA is the industry's first in production, fastest and most cost-effective ZKP verification protocol, setting a new standard for blockchain privacy and scalability.

NEBRA UPA, the first-to-production, cheapest and fastest proof aggregator is now on Mainnet.

Fibonacci Partial Sums Tricks arxiv.org/abs/2409.01296

1/ Excited, but frankly quite worried, about a new work with the wonderful 🏴 levochka.eth 🏴 💙💛🇮🇱☀️🦁🗡️ and Dmitry Khovratovich: ia.cr/2025/118 We break soundness of a standard protocol (essentially commit to witness and run GKR) by constructing a circuit for which we can prove a false statement.

Sipser: To prove BPP in the polynomial-time hierarchy you need Kolmogorov complexity Gacs: You need hash functions Nisan-Wigderson: Pseudorandom Generators Lautemann: ∃z₁, …, zₘ ∀y (A(x,z₁ ⊕ y) ∨ … ∨ A(x,zₘ ⊕ y)) blog.computationalcomplexity.org/2025/01/lautem…

My blog post on Ryan Williams' new inclusion of t(n) time in nearly square root of t(n) space using Cook-Mertz tree evaluation. blog.computationalcomplexity.org/2025/02/you-ne…