Jeremy Kun

@jeremykun.com

Portland-based mathematician and software engineer. Building a homomorphic encryption compiler at Google. https://jeremykun.com/linkgraph https://heir.dev

1/ Initial reactions after some hours with this groundbreaking result proving the NP-hardness of poly-approx CVP/NCP: It is most likely correct, but more importantly, it is original, elegant, and beautiful! (Also: it is easy to improve, quantitatively.) openai.com/index/ten-ad...

Ten advances in mathematics and theoretical computer science

OpenAI shares new results on long-standing open problems in mathematics and theoretical computer science, including advances in geometry, cryptography, and complexity.

openai.com

The GapCVP result from OpenAI is interesting. Though I would at least like to see some peer review... a 5 MiB lean file is a lot to parse.

Yes there’s a solar eclipse and a lunar eclipse coming up this month… but are you ready for 🥧 “Not Quite As Good Pi Approximation Day” 🥧 on 25/8?!

A brown and golden coloured chart showing each date in the format DD/M to give a decimal approximation. The colours show how close it is to Pi

Another interesting homomorphic encryption update: Niobium has released open source tooling for their accelerator niobium.co/press/open-s... It's got a DSL, an agent skill, and tooling for working with their ecosystem (eventually including heir.dev !)

Open-Sourcing Niobium FHE Developer Tools

We believe encrypted computation should be accessible to any developer. We deployed and licensed the first part of our development stack on GitHub under Apache 2.0.

niobium.co

Everyone talks about Shannon's playfulness but from what I've read I feel like there's a lot more to the story. A greatness inspired by broad exposure to problems of practical importance, followed by an acute focus and synthesis of ideas, later squandered by fame and a lack of incentive or pressure.

Zach Weinersmith@zachweinersmith.bsky.social · 3w ago

Nerd thing: so there's this tech/math/nerd culture that's hard to describe, but where there's a kind of enlightened playfulness, which if you like you can trace very far back, and which perhaps hits a kind of high watermark with Claude Shannon, routes through late 60s/70s hacker culture, and so on.

I don't know if this is uniquely Portland, but on public transit I tend to find glitter on the seats a lot more often than, you know, other more unpleasant things.

Cliff Stoll (kooky scientist, Cold War era hacker, klein bottles) published a 1995 essay and then a book claiming the web was overhyped and apparently it became known for being so wrong. But overall I think he really nailed it!!!!!

Bild

OK all you ML experts I have a dumb question. Context: I am looking at MobileNetV3, which takes a 2D convolution and splits it into depth-wise and cross-channel convolutions with a hard-swish in between.

english isn't for cowards. if you're not saying 'torpify,' that's a skill issue. there's no Académie Française telling you what to do. if you try to type 'pallific' and freak out when you see a little red underline, maybe you're not ready to roll with the big dogs.

Bild

The exploit: 1. Change your IP address to the target's geolocation and tell the support you've been hacked, asking them to send a reset to attacker email 2. No step 2. Meta's CISO immediately resigned. Gergely had inside contacts: the code was written by AI, reviewed by AI, while tokenmaxxing

The Duality Technologies team published a comprehensive SoK on private LLM inference via FHE (with a focus on the CKKS scheme). It’s still inefficient, but FHE has come a long way. I am very hopeful that we'll get there someday. eprint.iacr.org/2026/935

SoK: Private LLM Inference using Approximate Homomorphic Encryption

Although recent surveys on privacy-enhancing technologies concluded that FHE cannot feasibly evaluate non-linear activation functions in modern ML architectures, 20 CKKS-based frameworks have since de...

eprint.iacr.org

Wow! Alfred Menezes just published this 182 page "A Gentle Introduction to Lattice-Based Cryptography" paper. I just skimmed through it, but it looks like an invaluable resource if you want to study lattices and how they're used in (PQ) Cryptography. eprint.iacr.org/2026/1098

A gentle introduction to lattice-based cryptography

We present the quantum-safe Kyber key encapsulation mechanism (ML-KEM) and the Dilithium signature scheme (ML-DSA). We also develop the mathematical background on lattices needed to understand why Kyb...

eprint.iacr.org