arnaucube
@arnaucube.com
fascinated by polynomials github.com/arnaucube
Reposted by arnaucube
Also wrote a blog post that explains the proof in a shorter format and with less formality
blog.zksecurity.xyz/posts/fri-se...
blog.zksecurity.xyz/posts/fri-se...
October 30, 2025 at 3:24 PM
Also wrote a blog post that explains the proof in a shorter format and with less formality
blog.zksecurity.xyz/posts/fri-se...
blog.zksecurity.xyz/posts/fri-se...
Reposted by arnaucube
Wrote about a few interesting ones I’ve seen:
• Locally verifiable signatures, where you want to know a message from a set is signed
• Linear subspace signatures, where you can non interactively derive signatures for every vector in a subspace
kobi.leaflet.pub/3lxfc6khits27
2/2
• Locally verifiable signatures, where you want to know a message from a set is signed
• Linear subspace signatures, where you can non interactively derive signatures for every vector in a subspace
kobi.leaflet.pub/3lxfc6khits27
2/2
Signature schemes you've never heard about - Kobi's blog
An exploration of some interesting signature schemes!
kobi.leaflet.pub
August 27, 2025 at 3:46 PM
Wrote about a few interesting ones I’ve seen:
• Locally verifiable signatures, where you want to know a message from a set is signed
• Linear subspace signatures, where you can non interactively derive signatures for every vector in a subspace
kobi.leaflet.pub/3lxfc6khits27
2/2
• Locally verifiable signatures, where you want to know a message from a set is signed
• Linear subspace signatures, where you can non interactively derive signatures for every vector in a subspace
kobi.leaflet.pub/3lxfc6khits27
2/2
Reposted by arnaucube
This is a really interesting FHE paper in which BGV is used to build an ALU to do arithmetic as well as logical operations on messages in Z_2^n (e.g. 64 bit machine words).
eprint.iacr.org/2025/1449
eprint.iacr.org/2025/1449
REFHE: Fully Homomorphic ALU
We present a fully homomorphic encryption scheme which natively supports arithmetic and logical operations over large "machine words", namely plaintexts of the form $\mathbb{Z}_{2^n}$ (e.g. $n=64$). O...
eprint.iacr.org
August 13, 2025 at 2:59 PM
This is a really interesting FHE paper in which BGV is used to build an ALU to do arithmetic as well as logical operations on messages in Z_2^n (e.g. 64 bit machine words).
eprint.iacr.org/2025/1449
eprint.iacr.org/2025/1449
Reposted by arnaucube
📝 new blog post! i spent a while looking into homomorphically encrypted CRDTs. spoiler alert: they don’t work super well!
(but you should still check it out — i break down what homomorphic encryption is and how it works, and there are lots of explorable explanations along the way!)
(but you should still check it out — i break down what homomorphic encryption is and how it works, and there are lots of explorable explanations along the way!)
Homomorphically Encrypting CRDTs | jakelazaroff.com
Homomorphic encryption allows a computer to run programs on encrypted data. Learn how homomorphic encryption works through interactive examples, build a homomorphically encrypted CRDT and see whether ...
jakelazaroff.com
June 17, 2025 at 1:44 PM
📝 new blog post! i spent a while looking into homomorphically encrypted CRDTs. spoiler alert: they don’t work super well!
(but you should still check it out — i break down what homomorphic encryption is and how it works, and there are lots of explorable explanations along the way!)
(but you should still check it out — i break down what homomorphic encryption is and how it works, and there are lots of explorable explanations along the way!)
Wrote a short note to share some thoughts on aiccelerationism, hyperreality, and the recovery of human connections.
arnaucube.com/blog/ai-conn...
arnaucube.com/blog/ai-conn...
Human connections in the early days of AI - arnaucube - blog
A short note on aiccelerationism, hyperreality, and the recovery of human connections.
arnaucube.com
June 3, 2025 at 3:24 PM
Wrote a short note to share some thoughts on aiccelerationism, hyperreality, and the recovery of human connections.
arnaucube.com/blog/ai-conn...
arnaucube.com/blog/ai-conn...
Reposted by arnaucube
Video of my talk in zksummit about Ligerito has been published!
It’s about the work by Andrija and @lmao.bsky.social introducing a small and concretely fast polynomial commitment scheme
Since then, a fun thing has happened —
1/3
It’s about the work by Andrija and @lmao.bsky.social introducing a small and concretely fast polynomial commitment scheme
Since then, a fun thing has happened —
1/3
May 28, 2025 at 8:34 PM
Video of my talk in zksummit about Ligerito has been published!
It’s about the work by Andrija and @lmao.bsky.social introducing a small and concretely fast polynomial commitment scheme
Since then, a fun thing has happened —
1/3
It’s about the work by Andrija and @lmao.bsky.social introducing a small and concretely fast polynomial commitment scheme
Since then, a fun thing has happened —
1/3
Reposted by arnaucube
As a reminder: this is a proposed law that would mandate the inclusion of scanning technology into all encrypted private messages. It would fundamentally alter the privacy guarantees of encrypted messengers.
December 5, 2024 at 1:30 PM
As a reminder: this is a proposed law that would mandate the inclusion of scanning technology into all encrypted private messages. It would fundamentally alter the privacy guarantees of encrypted messengers.
There is this feeling, about spending days and nights reading papers and doing code, while listening to music and chatting with friends.
Going to sleep late hoping to wake up soon to continue working on a problem.
In some years I will call this nostalgia.
www.youtube.com/watch?v=scu8...
Going to sleep late hoping to wake up soon to continue working on a problem.
In some years I will call this nostalgia.
www.youtube.com/watch?v=scu8...
MASTER BOOT RECORD - FULL LIVE IN HELSINKI
See you soon at our upcoming tour! Ticket links at https://mbrserver.comUPCOMING SHOWS 10 Nov IT - Bologna - Alchemica11 Nov IT - Venezia - Revolver13 Nov DE...
www.youtube.com
November 10, 2023 at 11:34 AM
There is this feeling, about spending days and nights reading papers and doing code, while listening to music and chatting with friends.
Going to sleep late hoping to wake up soon to continue working on a problem.
In some years I will call this nostalgia.
www.youtube.com/watch?v=scu8...
Going to sleep late hoping to wake up soon to continue working on a problem.
In some years I will call this nostalgia.
www.youtube.com/watch?v=scu8...
If you're curious on how the HyperNova multifolding looks like for μ>1, ν>1 (more than 1 LCCCS&CCCS), in this screenshot I've tried to unfold it following the indications that Srinath gave in the PSE-HyperNova talk (https://www.youtube.com/watch?v=pDFmANwwIoY&t=724s)
(orange: LCCCS, blue: CCCS)
(orange: LCCCS, blue: CCCS)
June 21, 2023 at 12:43 PM
If you're curious on how the HyperNova multifolding looks like for μ>1, ν>1 (more than 1 LCCCS&CCCS), in this screenshot I've tried to unfold it following the indications that Srinath gave in the PSE-HyperNova talk (https://www.youtube.com/watch?v=pDFmANwwIoY&t=724s)
(orange: LCCCS, blue: CCCS)
(orange: LCCCS, blue: CCCS)