LightNews LightNews
alexhevans.bsky.social
@alexhevans.bsky.social
110 followers 120 following 9 posts
Posts Replies Media Videos
Reposted
zkhack.dev
Module 5 is live!

We’re diving into The Ligero Proof System with @mvenkita and @GuilleAngeris

Thanks to @BainCapCrypto for the support.

Full access to all module resources
zkhack.dev/whiteboard/s...
October 28, 2025 at 4:31 PM
Reposted
huitseeker.bsky.social
One thing to recall from @hdevalence.bsky.social 's work: @lmao.bsky.social, @pinged.bsky.social & @alexhevans.bsky.social showed that just encrypting a continuously updated CFMM (e.g. via FHE) fails to provide real privacy, since the very structure of a live, convex invariant leaks information.
October 24, 2025 at 4:00 PM
Reposted
lmao.bsky.social
🫡
eprint.ing.bot ePrint Updates @eprint.ing.bot · Jun 27
Ligerito: A Small and Concretely Fast Polynomial Commitment Scheme (Andrija Novakovic, Guillermo Angeris) ia.cr/2025/1187
Abstract. In this note we present Ligerito, a small and practically fast polynomial commitment and inner product scheme. For the case of univariate and multilinear polynomial evaluations, the scheme has a proof size of  ∼ log (N)²/log log (N) up to constants and for a large enough field, where N is the size of the input. Ligerito is also fast on consumer hardware: when run on an M1 MacBook Pro for a polynomial with 2²⁴ coefficients over a 32-bit binary field, our Julia prover implementation has a proving time of 1.3 seconds and a proof size of 255 KiB. Ligerito is also relatively flexible: any linear code for which the rows of the generator matrix can be efficiently evaluated can be used. Such codes include Reed–Solomon codes, Reed–Muller codes, among others. This, in turn, allows for a high degree of flexibility on the choice of field and can likely give further efficiency gains in specific applications.
June 27, 2025 at 4:15 PM
Reposted
eprint.ing.bot
The Accidental Computer: Polynomial Commitments from Data Availability (Alex Evans, Guillermo Angeris) ia.cr/2025/918
Abstract. In this paper, we show two simple variations of a data availability scheme which enable it to act as a multilinear polynomial commitment scheme over the data in a block. The first variation enables commitments over all of the block’s data with zero prover overhead: the data availability construction simply serves both purposes. The second variation allows commitments over subsets of data with nonzero but still concretely small proving costs, since most work is already done during data encoding. This works especially well for blockchains with a high degree of data parallelism, as data-parallel computation is particularly amenable to efficient GKR proofs. Since, in GKR, opening the polynomial commitment contributes significantly to prover costs, our construction enables the prover to reuse work already done by the data availability scheme, reducing—or wholly removing—work associated with the polynomial commitment scheme.
May 23, 2025 at 2:41 AM
Reposted
kobi.bsky.social
Very informal experimentation with combining two worlds I like ☺️

www.notion.so/Verifiable-...

2/2
Verifiable Verifications | Notion
Bluesky recently introduced a new form of verification. It’s a social version of the familiar notion of a blue check, in a way that is architecturally aligned with Bluesky and its underlying protocol ATProto. This allows notable accounts and accounts that are related to trusted organizations to be verified as authentic.
www.notion.so
May 19, 2025 at 4:00 PM
Reposted
kobi.bsky.social
Some thoughts about how verifications in Bluesky can be extended to ZK-based methods, to achieve Verifiable Verifications

This builds on ideas from the recent verification protocol, and explores both direct integrations and lightweight ones, with different points in the tradeoff space of trust

1/2
May 19, 2025 at 4:00 PM
Reposted
grjte.sh
🧵 The AT Protocol shows the power of a personal data store. All of our public atproto data is easy to find and access. We can interact with it flexibly in myriad ways and combinations.

Wouldn't it be nice to do the same for our private and collaborative data? 👇
May 14, 2025 at 2:45 PM
Reposted
bmann.ca
The last of @grjte.sh’s Groundmist experiments, combining #localfirst with ATProto

Private, local first sync that is user centric using Lexicons, rather than app-specific sync.
grjte.sh grjte @grjte.sh · May 14
2/

The latest Groundmist experiment explores how a personal sync server can function as a local-first data store, mirroring the role of an atproto Personal Data Server (PDS) and building on the lexicon schema system's foundation to enable interoperability over local-first data.
May 14, 2025 at 2:58 PM
Reposted
kobi.bsky.social
ZK provers on mobile?

some thoughts on what needs to change to uphold the security guarantees we work so hard to get

tl;dr - the deployment supply chain, at least, should be better

www.kobi.one/The-Lies-Our...
The Lies Our Provers Tell Us | Notion
2025-05-14
www.kobi.one
May 14, 2025 at 2:03 PM
Reposted
grjte.sh
🧵 The AT Protocol (atproto), which underlies Bluesky, lets us to interface with the same data in as many ways as we can conceive of through AppViews that each provide a different "view" of the network.

Can we make our local-first software as interoperable as the AT Protocol? 👇
April 23, 2025 at 7:25 PM
Reposted
bmann.ca
Second in the #groundmist series - #localfirst + ATProto

I’m actively using the local first essay editor (using @inkandswitch.com Automerge + tiny essay editor) - I can login with my ATProto account and work on private drafts and then publish to @whtwnd.com.
grjte.sh grjte @grjte.sh · Apr 23
🧵 The AT Protocol (atproto), which underlies Bluesky, lets us to interface with the same data in as many ways as we can conceive of through AppViews that each provide a different "view" of the network.

Can we make our local-first software as interoperable as the AT Protocol? 👇
April 23, 2025 at 7:34 PM
Reposted
grjte.sh
🧵 I've been experimenting with combining local-first software and the AT Protocol (atproto) to play with the design space of apps that live at both ends of the privacy spectrum - maximally private AND maximally public, without some of the downsides of the modern web. 

Why? 👇
April 22, 2025 at 4:30 PM
Reposted
kobi.bsky.social
When Andrija and @lmao.bsky.social told me they're writing an extremely fast cryptography library in Julia I didn't know what to think...

And then they showed me the following cool stuff:

baincapitalcrypto.com/releasing-c...

1/4
CryptoUtilities.jl: A Small Julia Library for Succinct Proofs
We’re excited to open-source CryptoUtilities.jl, a collection of Julia packages built to prototype and benchmark succinct proof systems over binary fields, along with a simple walkthrough for how to…
baincapitalcrypto.com
April 16, 2025 at 11:36 PM
Reposted
dholms.xyz
friendly reminder that building on atproto gives you immediate access to >30 million users, an existing social graph, and a huge network of open data & content

it's increasingly becoming a no-brainer to build new social apps on atproto

congrats to the skylight team on the launch 🙌
skylight.social Skylight Social @skylight.social · Apr 3
Skylight Social is #2 app in Entertainment on the Apple App Store!!!

#skylightsocial #tiktok #tiktokban
A picture showing Skylight Social as the #2 app in the Entertainment Top Chart list on the Apple App store
April 3, 2025 at 8:12 PM
Reposted
lmao.bsky.social
anon, what if you could train your own personal offline model, on your phone, suited to your tastes, filtering posts with ~ bad vibes ~ and letting good ones through?

well, have i got the thing for you
February 23, 2025 at 1:14 AM
Reposted
devingaffney.com
15 weeks ago I sat down and wrote up some ideas about how custom feeds could become a high-leverage mechanism for fundamentally changing the economics of the attention economy.

Today was my last day at my day job- I’m now full time @graze.social! Incredibly excited to give this all I got!
February 22, 2025 at 2:21 AM
Reposted
zkhack.dev
This week's ZK Podcast episode was on ZODA & The Accidental Computer from @baincapitalcrypto.com research team, with the trio @alexhevans.bsky.social @guilleangeris.bsky.social @nicomnbl.bsky.social chatting with @arro.bsky.social about these innovations.
Ep: https://zeroknowledge.fm/podcast/349/
ZODA and The Accidental Computer
This week Anna catches up with Nico, Guillermo and Alex from Bain Capital Crypto to discuss two of their recent works; ZODA: Zero-Overhead Data Availability by the trio and The Accidental Computer by…
zeroknowledge.fm
February 21, 2025 at 1:16 PM
Reposted
zkhack.dev
ZK Whiteboard Sessions - S2M7: FRI and Proximity Proofs (Part.1) with @danboneh.bsky.social
https://youtu.be/MBDBrEr2XQg?feature=shared ☝️

ZK Whiteboard Sessions - S2M8: FRI and Proximity Proofs (Part.2) with @danboneh.bsky.social
https://youtu.be/CWbx_rnj7LI?feature=shared ✌️
ZK Whiteboard Sessions - S2M7: FRI and Proximity Proofs (Part.1) with Dan Boneh
Full ZK Whiteboard Sessions - Season 1 playlist here: https://www.youtube.com/playlist?list=PLj80z0cJm8QErn3akRcqvxUsyXWC81OGqFull ZK Whiteboard Sessions - S...
youtu.be
February 2, 2025 at 11:01 AM
Reposted
lmao.bsky.social
it's funny, for a long time, i always assumed that computation was this very sacred, brittle, difficult thing: so many things need to work "exactly" right to get an output

but i’ve realized that it’s actually much *harder* to make a thing that doesn't accidentally enable ~ arbitrary computation!
January 31, 2025 at 9:16 PM
Reposted
nicomnbl.bsky.social
These two lectures by @danboneh.bsky.social for @zkhack.bsky.social are the best explanation of IOPPs, FRI and its variants by a country mile. Cannot recommend them enough

zkhack.dev/whiteboard/s...
zkhack.dev/whiteboard/s...
January 29, 2025 at 12:50 PM
Reposted
zkhack.dev
ZK Whiteboard Sessions - S2M2: The Sum-Check Protocol with Justin Thaler
https://youtu.be/gfy8rotcas4?feature=shared
ZK Whiteboard Sessions - S2M2: The Sum-Check Protocol with Justin Thaler
Full ZK Whiteboard Sessions - Season 1 playlist here: https://www.youtube.com/playlist?list=PLj80z0cJm8QErn3akRcqvxUsyXWC81OGqFull ZK Whiteboard Sessions - S...
youtu.be
January 28, 2025 at 11:03 AM
Reposted
nicomnbl.bsky.social
programmable* cryptography

* programming difficulty may vary, developer discretion is advised.
January 27, 2025 at 7:01 PM
Reposted
eprint.ing.bot
How to Prove False Statements: Practical Attacks on Fiat-Shamir (Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov) ia.cr/2025/118
Abstract. The Fiat-Shamir (FS) transform is a prolific and powerful technique for compiling public-coin interactive protocols into non-interactive ones. Roughly speaking, the idea is to replace the random coins of the verifier with the evaluations of a complex hash function. The FS transform is known to be sound in the random oracle model (i.e., when the hash function is modeled as a totally random function). However, when instantiating the random oracle using a concrete hash function, there are examples of protocols in which the transformation is not sound. So far all of these examples have been contrived protocols that were specifically designed to fail. In this work we show such an attack for a standard and popular interactive succinct argument, based on the GKR protocol, for verifying the correctness of a non-determinstic bounded-depth computation. For every choice of FS hash function, we show that a corresponding instantiation of this protocol, which was been widely studied in the literature and used also in practice, is not (adaptively) sound when compiled with the FS transform. Specifically, we construct an explicit circuit for which we can generate an accepting proof for a false statement. We further extend our attack and show that for every circuit C and desired output y, we can construct a functionally equivalent circuit C^(*), for which we can produce an accepting proof that C^(*) outputs y (regardless of whether or not this statement is true). This demonstrates that any security guarantee (if such exists) would have to depend on the specific implementation of the circuit C, rather than just its functionality. Lastly, we also demonstrate versions of the attack that violate non-adaptive soundness of the protocol – that is, we generate an attacking circuit that is independent of the underlying cryptographic objects. However, these versions are either less practical (as the attacking circuit has very large depth) or make some additional (reasonable) assumptions on the underlying cryptographic primitives. Image showing part 2 of abstract.
January 27, 2025 at 1:59 AM
Reposted
zkhack.dev
ZK Whiteboard Sessions - S2M1: What is Zero Knowledge (like, actually)? with
David Wong
https://youtu.be/ksTTyt0GTvQ?feature=shared
ZK Whiteboard Sessions - S2M1: What is Zero Knowledge (like, actually)? with David Wong
Full ZK Whiteboard Sessions - Season 1 playlist here: https://www.youtube.com/playlist?list=PLj80z0cJm8QErn3akRcqvxUsyXWC81OGqFull ZK Whiteboard Sessions - S...
youtu.be
January 27, 2025 at 11:28 AM
Reposted
nicomnbl.bsky.social
oh hello @zkhack.bsky.social 👀👀
January 23, 2025 at 12:58 AM