# Jeremy Kun

Recent content on Math ∩ Programming

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## CKKS -- Rescaling

DevFeed: [CKKS -- Rescaling](<https://devfeed.tech/articles/ckks-rescaling-129642.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/11/11/ckks-rescaling/>)

Published: 2026-11-11T23:27:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Error Propagation](<https://devfeed.tech/topics/error-propagation.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>), [primes](<https://devfeed.tech/topics/primes.md>)

Tags: [64-bit](<https://devfeed.tech/tags/64-bit.md>), [acceleration](<https://devfeed.tech/tags/acceleration.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [array](<https://devfeed.tech/tags/array.md>), [bits](<https://devfeed.tech/tags/bits.md>), [bootstrapping](<https://devfeed.tech/tags/bootstrapping.md>), [budget](<https://devfeed.tech/tags/budget.md>), [canonical](<https://devfeed.tech/tags/canonical.md>), [ckks](<https://devfeed.tech/tags/ckks.md>), [ckks-tutorial](<https://devfeed.tech/tags/ckks-tutorial.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [delta](<https://devfeed.tech/tags/delta.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [key](<https://devfeed.tech/tags/key.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [scale](<https://devfeed.tech/tags/scale.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [switching](<https://devfeed.tech/tags/switching.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

Rescaling in CKKS reduces a multiplied ciphertext's scale from Δ² to Δ and manages its noise by dividing rounded ciphertext coefficients by a factor close to Δ while reducing the modulus from Q to Q′. This requires Q to be divisible by the rescaling factor in the mathematical formulation; direct multiplication by Δ⁻¹ in the original ring can fail or make noise too large. Rounding introduces new error, while rescaling reduces prior multiplication and relinearization errors. In the code example, Q/Q′ is used instead of exactly Δ, so the tracked scale is approximate and decoding incurs a small additional error. Each multiplication and rescaling also consumes modulus budget. The article explains that representing a large modulus as a product of prime limbs in an RNS representation makes operations parallelizable; rescaling then drops a limb, and remaining limbs define a ciphertext's level.

### Source excerpt

Table of Contents This is part of a tutorial series on the CKKS homomorphic encryption scheme. In the last article, we described the key switching and relinearization algorithms. Relinearization allowed us to restore the natural "two tuple" ciphertext structure after a homomorphic multiplication, but we did not address two more problems produced by multiplication. The first is that, because CKKS uses fixed-point arithmetic on its underlying plaintexts, multiplication produces a ciphertext encoded with a squared scaling factor $\Delta^2$ relative to the operands which have scale $\Delta$.

## CKKS -- Key Switching and Relinearization

DevFeed: [CKKS -- Key Switching and Relinearization](<https://devfeed.tech/articles/ckks-key-switching-and-relinearization-93098.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/10/21/ckks-key-switching-and-relinearization/>)

Published: 2026-10-21T18:27:41Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [FHE](<https://devfeed.tech/topics/fhe.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>), [Tutorial](<https://devfeed.tech/topics/tutorial.md>), [private key](<https://devfeed.tech/topics/private-key.md>), [public key](<https://devfeed.tech/topics/public-key.md>), [test](<https://devfeed.tech/topics/test.md>)

Tags: [addition](<https://devfeed.tech/tags/addition.md>), [ckks](<https://devfeed.tech/tags/ckks.md>), [ckks-tutorial](<https://devfeed.tech/tags/ckks-tutorial.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [key](<https://devfeed.tech/tags/key.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [switching](<https://devfeed.tech/tags/switching.md>)

### AI overview

Relinearization converts CKKS multiplication's three-component ciphertext, which decrypts under (1, s, s²), back to two components under (1, s) by treating the s² component as a key-switching problem. Naive key switching homomorphically evaluates decryption using an encryption of the source key under the target key, but its added noise is multiplied by a potentially large ciphertext component and can overwhelm the message. Gadget decomposition splits that component into base-B digits and pairs them with encryptions of scaled source keys, reducing noise growth to roughly B log(Q) times the key-switch-key noise at the cost of more products for smaller bases. The article implements this approach and relinearization, while noting the need to generate a relinearization key first. It also explains that plaintext-ciphertext operations avoid encrypting public or static data per user; multiplication scales existing error and may require rescaling depending on the implementation. Rescaling itself is left to the next article, and the tutorial has not yet moved to RNS form.

### Source excerpt

Table of Contents This is part of a tutorial series on the CKKS homomorphic encryption scheme. In the last article, we described the ciphertext-ciphertext addition and multiplication operations. We ended with two challenges, one to restore the squared scaling factor $\Delta^2$ back to $\Delta$, and the other to convert a three-tuple ciphertext (decrypting under $(1, s, s^2)$) back to a two-tuple ciphertext (decrypting under $(1, s)$). This article covers the latter challenge, which is called relinearization.

## CKKS -- Addition and Multiplication

DevFeed: [CKKS -- Addition and Multiplication](<https://devfeed.tech/articles/ckks-addition-and-multiplication-85028.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/10/11/ckks-addition-and-multiplication/>)

Published: 2026-10-11T21:31:19Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>), [public key](<https://devfeed.tech/topics/public-key.md>)

Tags: [ckks](<https://devfeed.tech/tags/ckks.md>), [ckks-tutorial](<https://devfeed.tech/tags/ckks-tutorial.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [security](<https://devfeed.tech/tags/security.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

This tutorial explains CKKS ciphertext addition and multiplication, including how multiplication expands a ciphertext into three components and increases error and scaling complexity. It demonstrates the operations and decryption in code, while noting that the simplified 64-bit modulus setup temporarily ignores cryptographic security.

### Source excerpt

Table of Contents This is part of a tutorial series on the CKKS homomorphic encryption scheme. In the last article, we introduced symmetric and public-key encryption and decryption routines, and implemented modular polynomial arithmetic (using NTTs as a black box). This article covers the addition and multiplication operations performed on ciphertexts (without relinearization). Again, if you already know about CKKS, we are still avoiding the RNS form of the scheme and using a 64-bit modulus $Q$, which means that we're momentarily ignoring cryptographic security.

## Hotword detection in FHE on GPU in 350ms

DevFeed: [Hotword detection in FHE on GPU in 350ms](<https://devfeed.tech/articles/hotword-detection-in-fhe-on-gpu-in-350ms-77431.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2026-10-08-1120/>)

Published: 2026-10-08T18:20:29Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [FHE](<https://devfeed.tech/topics/fhe.md>), [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [baseten](<https://devfeed.tech/topics/baseten.md>), [A/B Testing](<https://devfeed.tech/topics/a-b-testing.md>), [Global Game Jam](<https://devfeed.tech/topics/global-game-jam.md>)

Tags: [audio](<https://devfeed.tech/tags/audio.md>), [ckks](<https://devfeed.tech/tags/ckks.md>), [client-side-encryption](<https://devfeed.tech/tags/client-side-encryption.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [demo](<https://devfeed.tech/tags/demo.md>), [encrypted](<https://devfeed.tech/tags/encrypted.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [game](<https://devfeed.tech/tags/game.md>), [generate](<https://devfeed.tech/tags/generate.md>), [has](<https://devfeed.tech/tags/has.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [inference](<https://devfeed.tech/tags/inference.md>), [keys](<https://devfeed.tech/tags/keys.md>), [load](<https://devfeed.tech/tags/load.md>), [network](<https://devfeed.tech/tags/network.md>), [server](<https://devfeed.tech/tags/server.md>), [servers](<https://devfeed.tech/tags/servers.md>), [shortform](<https://devfeed.tech/tags/shortform.md>), [showcase](<https://devfeed.tech/tags/showcase.md>)

### AI overview

The HEIR homomorphic encryption compiler is used in a live demo that runs a hotword detector on encrypted audio. Belfort's demo evaluates the encrypted input on its GPU platform in 350 ms; the full round trip takes less than a second, while generating and uploading setup keys takes about a minute.

### Source excerpt

A quick update on our homomorphic encryption compiler HEIR: our partners at Belfort have a hotword detector in FHE that runs in 350ms. More specifically, they launched a live demo at hotword.belfortlabs.com, that has a little game inspired by the NY Times Connections puzzle. Instead of typing in your guess for the word that connects a group of clues, you say it out loud. Your audio is encrypted under FHE, transitted to their server, and a hotword detector runs on it to determine which word you said (still encrypted).

## CKKS -- Encryption and Decryption

DevFeed: [CKKS -- Encryption and Decryption](<https://devfeed.tech/articles/ckks-encryption-and-decryption-58865.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/09/23/ckks-encryption-and-decryption/>)

Published: 2026-09-23T17:09:48Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Tutorial](<https://devfeed.tech/topics/tutorial.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>), [Code](<https://devfeed.tech/topics/code.md>), [floating-point](<https://devfeed.tech/topics/floating-point.md>), [Pull Request](<https://devfeed.tech/topics/pull-request.md>)

Tags: [also](<https://devfeed.tech/tags/also.md>), [ckks](<https://devfeed.tech/tags/ckks.md>), [ckks-tutorial](<https://devfeed.tech/tags/ckks-tutorial.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [floating-point](<https://devfeed.tech/tags/floating-point.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [polynomials](<https://devfeed.tech/tags/polynomials.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

A tutorial on implementing CKKS homomorphic encryption and decryption routines. It introduces the routines without a residue number system, explains polynomial representations and signed coefficients, and discusses how representation choices affect decoding and fixed-point results.

### Source excerpt

Table of Contents This is part of a tutorial series on the CKKS homomorphic encryption scheme. In the last article, we covered some groundwork about polynomials and the CKKS encoding method. This article covers the encryption and decryption routines. Notably, if you already know about CKKS, we will deviate from a usual treatment for explanatory purposes. In particular, we will first define CKKS encryption, decryption, and basic operations without using the residue number system (RNS).

## Updates on HEIR, the homomorphic encryption compiler project

DevFeed: [Updates on HEIR, the homomorphic encryption compiler project](<https://devfeed.tech/articles/updates-on-heir-the-homomorphic-encryption-compiler-project-40496.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/09/04/updates-on-heir-homomorphic-encryption/>)

Published: 2026-09-04T18:53:40Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Inference](<https://devfeed.tech/topics/inference.md>), [GitHub](<https://devfeed.tech/topics/github.md>), [bazel](<https://devfeed.tech/topics/bazel.md>), [Kaggle](<https://devfeed.tech/topics/kaggle.md>)

Tags: [bazel](<https://devfeed.tech/tags/bazel.md>), [ckks](<https://devfeed.tech/tags/ckks.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [github](<https://devfeed.tech/tags/github.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [inference](<https://devfeed.tech/tags/inference.md>), [kaggle](<https://devfeed.tech/tags/kaggle.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [ml](<https://devfeed.tech/tags/ml.md>), [programming](<https://devfeed.tech/tags/programming.md>)

### AI overview

This companion article explains HEIR, a homomorphic encryption compiler that converts programs to operate directly on encrypted data. It discusses compiling pre-trained machine-learning models for private inference, describes the repository and setup, and reports an example involving encrypted credit-card fraud detection.

### Source excerpt

On 2026-08-14 I published an article on the Google Security blog with an update on HEIR, our homomorphic encryption (HE) compiler. This is a companion article, in which I have no limits on word count or jargon, and I can feel free to be honest. So strap in. Assuming you won't read the linked corporate blog post, HEIR is a compiler that converts an input program to a program that operates directly on encrypted data.

## More whimsical OEIS sequences

DevFeed: [More whimsical OEIS sequences](<https://devfeed.tech/articles/more-whimsical-oeis-sequences-40522.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2026-05-22-1528/>)

Published: 2026-05-22T22:28:34Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Sequences](<https://devfeed.tech/topics/sequences.md>)

Tags: [depths-of-oeis](<https://devfeed.tech/tags/depths-of-oeis.md>), [doom](<https://devfeed.tech/tags/doom.md>), [oeis](<https://devfeed.tech/tags/oeis.md>), [sequences](<https://devfeed.tech/tags/sequences.md>), [shortform](<https://devfeed.tech/tags/shortform.md>), [xkcd](<https://devfeed.tech/tags/xkcd.md>)

### AI overview

An informal survey of whimsical OEIS sequences, including sequences inspired by XKCD, non-reduced fractions, hexadecimal patterns, James Bond primes, random tables, and references to the number 666.

### Source excerpt

Here are some more whimsical OEIS sequences I came across. XKCD 2016 joked that "OEIS keeps rejecting my submissions," including one that gives "Integers in increasing order of width when printed in Helvetica." Well, two days after that comic was published (2018-07-09), Hugo Pfoertner published A316600, with a very precise definition. Then he did Arial. Randall Munroe missed a huge opportunity to commit to his bit and actually try to submit some of his sequences before publishing the comic.

## CKKS -- Polynomials, the Canonical Embedding, and Encoding

DevFeed: [CKKS -- Polynomials, the Canonical Embedding, and Encoding](<https://devfeed.tech/articles/ckks-polynomials-the-canonical-embedding-and-encoding-40495.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/04/29/ckks-polynomials-the-canonical-embedding-and-encoding/>)

Published: 2026-04-29T12:25:44Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>)

Tags: [ckks](<https://devfeed.tech/tags/ckks.md>), [ckks-tutorial](<https://devfeed.tech/tags/ckks-tutorial.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [polynomial-ring](<https://devfeed.tech/tags/polynomial-ring.md>), [polynomials](<https://devfeed.tech/tags/polynomials.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [technical](<https://devfeed.tech/tags/technical.md>), [tutorial](<https://devfeed.tech/tags/tutorial.md>)

### AI overview

This tutorial introduces the CKKS homomorphic encryption scheme and develops mathematical background on the polynomial ring used in its basic formulation and the canonical embedding used to encode cleartext messages as plaintexts. It also outlines CKKS's history, including its support for approximate arithmetic and later bootstrapping improvements.

### Source excerpt

Table of Contents In this tutorial series, I will introduce the CKKS homomorphic encryption scheme from the ground up, in rather intricate detail. Each article in this series corresponds to a pull request on a GitHub repository. The code for this article is in this pull request. Follow along by cloning the repository and checking out the code at the relevant commit. This first article will cover some of the mathematical background necessary in the formulation of the CKKS encryption scheme, specifically the polynomial ring used in the most basic version of CKKS, and the canonical embedding used to encode cleartext messages as plaintexts.

## Unusual uses of OEIS sequences on GitHub

DevFeed: [Unusual uses of OEIS sequences on GitHub](<https://devfeed.tech/articles/unusual-uses-of-oeis-sequences-on-github-40521.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2026-04-13-0700/>)

Published: 2026-04-13T14:00:00Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Sequences](<https://devfeed.tech/topics/sequences.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>), [GitHub](<https://devfeed.tech/topics/github.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [code](<https://devfeed.tech/tags/code.md>), [coding](<https://devfeed.tech/tags/coding.md>), [depths-of-oeis](<https://devfeed.tech/tags/depths-of-oeis.md>), [github](<https://devfeed.tech/tags/github.md>), [oeis](<https://devfeed.tech/tags/oeis.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [sequences](<https://devfeed.tech/tags/sequences.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

The article surveys unusual uses of OEIS sequences in open-source software on GitHub. It describes their use in the Mercury and Ziffers live-coding music frameworks, the Plato e-reader's pen-size options, and the GC Wizard geocaching app.

### Source excerpt

I went hunting for references to the OEIS in open source code, and found some weird ones. There are not one, but two live-coding music frameworks that use OEIS sequences as a source for "anything that can be sequenced" in music. I'm guessing that's used for choosing pseudorandom melodies, interesting rhythyms, or how to overlap tracks in different ways. The first project is called mercury, which is advertised as having "an extensive library of algorithms to generate or transform numbersequences that can modulate parameters.

## The OEIS meta sequence and subway stations

DevFeed: [The OEIS meta sequence and subway stations](<https://devfeed.tech/articles/the-oeis-meta-sequence-and-subway-stations-40520.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2026-04-09-0556/>)

Published: 2026-04-09T13:55:17Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Sequences](<https://devfeed.tech/topics/sequences.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Database](<https://devfeed.tech/topics/database.md>)

Tags: [database](<https://devfeed.tech/tags/database.md>), [depths-of-oeis](<https://devfeed.tech/tags/depths-of-oeis.md>), [new-york-city](<https://devfeed.tech/tags/new-york-city.md>), [numberphile](<https://devfeed.tech/tags/numberphile.md>), [oeis](<https://devfeed.tech/tags/oeis.md>), [quirk](<https://devfeed.tech/tags/quirk.md>), [sequence](<https://devfeed.tech/tags/sequence.md>), [sequences](<https://devfeed.tech/tags/sequences.md>), [shortform](<https://devfeed.tech/tags/shortform.md>), [train](<https://devfeed.tech/tags/train.md>)

### AI overview

This commentary examines OEIS sequence A051070, whose nth term is the nth entry of sequence A_n, or -1 when that sequence lacks enough terms. It highlights unusually large or unknown values, subway-stop sequences included in the OEIS, and self-referential questions involving A051070 and A102288.

### Source excerpt

A051070 is a sequence about OEIS sequences. a(n) is the n-th term in sequence A_n (or -1 if A_n doesn't have enough terms). So the first term in A051070 is 1 because A000001 is the number of groups of order n, and that sequence has 1 as its entry in index 1. A000002 is the Kolakoski sequence (what? For another time) and has value 2 in entry 2. The sequence continues: 1, 2, 1, 0, 2, 3, 0, 7, 8, 4, 63, 1, 316, ...

## Deterministic Primality Testing for Limited Bit Width

DevFeed: [Deterministic Primality Testing for Limited Bit Width](<https://devfeed.tech/articles/deterministic-primality-testing-for-limited-bit-width-40494.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2026/04/07/deterministic-miller-rabin/>)

Published: 2026-04-07T13:00:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [miller-rabin](<https://devfeed.tech/tags/miller-rabin.md>), [oeis](<https://devfeed.tech/tags/oeis.md>), [primes](<https://devfeed.tech/tags/primes.md>), [programming](<https://devfeed.tech/tags/programming.md>), [randomized-algorithm](<https://devfeed.tech/tags/randomized-algorithm.md>)

### AI overview

This article explains how to perform deterministic Miller-Rabin primality testing for 32-bit integers. It presents C++ code using the bases 2, 3, 5, and 7, which the article states is deterministic for all 32-bit inputs, and discusses strong pseudoprimes and related research.

### Source excerpt

Problem: Determine if a 32-bit number is prime (deterministically) Solution: (in C++) // Bases to test. Using the first 4 prime bases makes the test deterministic // for all 32-bit integers. See https://oeis.org/A014233. int64_t bases[] = {2, 3, 5, 7}; inline int countTrailingZeros(uint64_t n) { if (n == 0) return 64; return __builtin_ctzll(n); } int64_t modularExponentiation(int64_t base, int64_t exponent, int64_t modulus) { int64_t res = 1; int64_t b = base % modulus; int64_t e = exponent; while (e > 0) { if (e & 1) { // Doesn't overflow because we assume 32-bit integer inputs res = (res * b) % modulus; } b = (b * b) % modulus; e >>= 1; } return res; } bool isPrime(int64_t n) { if (n < 2) return false; if (n < 4) return true; if (!

## Bicyclic Matrix-Matrix Multiplication in Fully Homomorphic Encryption

DevFeed: [Bicyclic Matrix-Matrix Multiplication in Fully Homomorphic Encryption](<https://devfeed.tech/articles/bicyclic-matrix-matrix-multiplication-in-fully-homomorphic-encryption-40492.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2025/11/17/bicyclic-matrix-matrix-multiplication-in-fully-homomorphic-encryption/>)

Published: 2025-11-17T16:41:28Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [FHE](<https://devfeed.tech/topics/fhe.md>), [Encryption](<https://devfeed.tech/topics/encryption.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Code](<https://devfeed.tech/topics/code.md>), [GitHub](<https://devfeed.tech/topics/github.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [circuit](<https://devfeed.tech/tags/circuit.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [github](<https://devfeed.tech/tags/github.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [linear-algebra](<https://devfeed.tech/tags/linear-algebra.md>), [lwe](<https://devfeed.tech/tags/lwe.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [programming](<https://devfeed.tech/tags/programming.md>), [rlwe](<https://devfeed.tech/tags/rlwe.md>)

### AI overview

This article explains the bicyclic method for matrix-matrix multiplication in fully homomorphic encryption. It introduces the method's packing scheme, relates it to Halevi-Shoup diagonal packing, and discusses properties including multiplicative depth, layout invariance, and rotation complexity. The implementation is provided in a GitHub repository in a file named bicyclic.py.

### Source excerpt

In an earlier article, I covered the basic technique for performing matrix-vector multiplication in fully homomorphic encryption (FHE), known as the Halevi-Shoup diagonal method. This article covers a more recent method for matrix-matrix multiplication known as the bicyclic method. The code implementing this method is in the same GitHub repository as the previous article, and the bicyclic method is in a file called bicyclic.py. The previous article linked above covers the general concepts behind "FHE packing," which I will assume as background knowledge for this article:

## Integer Set Library (ISL) - A Primer

DevFeed: [Integer Set Library (ISL) - A Primer](<https://devfeed.tech/articles/integer-set-library-isl-a-primer-40491.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2025/10/19/isl-a-primer/>)

Published: 2025-10-19T20:14:22Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Library](<https://devfeed.tech/topics/library.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>), [mlir](<https://devfeed.tech/topics/mlir.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [compilers](<https://devfeed.tech/tags/compilers.md>), [isl](<https://devfeed.tech/tags/isl.md>), [library](<https://devfeed.tech/tags/library.md>), [loops](<https://devfeed.tech/tags/loops.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [mlir](<https://devfeed.tech/tags/mlir.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [polyhedral-optimization](<https://devfeed.tech/tags/polyhedral-optimization.md>), [programming](<https://devfeed.tech/tags/programming.md>), [set-theory](<https://devfeed.tech/tags/set-theory.md>)

### AI overview

This primer introduces the Integer Set Library (ISL), an open-source C library that implements core algorithms for polyhedral optimization. It focuses on representing integer sets and relations, manipulating them, and the relationship between ISL and MLIR's Fast Presburger Library.

### Source excerpt

Polyhedral optimization is a tool used in compilers for optimizing loop nests. While the major compilers that use this implement polyhedral optimizations from scratch,1 there is a generally-applicable open source C library called the Integer Set Library (ISL) that implements the core algorithms used in polyhedral optimization. This article gives an overview of a subset of ISL, mainly focusing on the representation of sets and relations and basic manipulations on them.

## FHE@PDX 2025

DevFeed: [FHE@PDX 2025](<https://devfeed.tech/articles/fhe-pdx-2025-40519.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2025-07-25-0956/>)

Published: 2025-07-25T16:56:45Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [FHE](<https://devfeed.tech/topics/fhe.md>), [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Google](<https://devfeed.tech/topics/google.md>), [intel](<https://devfeed.tech/topics/intel.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [AdventureX 2025](<https://devfeed.tech/topics/adventurex2025.md>)

Tags: [2025](<https://devfeed.tech/tags/2025.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [google](<https://devfeed.tech/tags/google.md>), [hackathon](<https://devfeed.tech/tags/hackathon.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [intel](<https://devfeed.tech/tags/intel.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

The author describes hosting an informal mini-workshop on homomorphic encryption in Portland, Oregon, attended by about 18 people from the local community. The event included talks, discussion, a hackathon for the HEIR compiler, and plans for a possible repeat the following year.

### Source excerpt

On Monday, July 14th 2025, I hosted a mini-workshop on homomorphic encryption at Google's Portland, Oregon office. Though Portland is a small city, it's becoming a hub for homomorphic encryption. Intel and Google both have a presence here, as well as the hardware startup Niobium, and a few individuals from other companies who happen to be based here. Since I had been having lunch with various subsets of the community, I figured it was about time to get us all in a room together.

## Frequently Asked Questions about FHE

DevFeed: [Frequently Asked Questions about FHE](<https://devfeed.tech/articles/frequently-asked-questions-about-fhe-40499.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/frequently-asked-questions-about-fhe/>)

Published: 2025-07-18T17:31:49Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [FHE](<https://devfeed.tech/topics/fhe.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [GPU](<https://devfeed.tech/topics/gpu.md>), [Facial recognition](<https://devfeed.tech/topics/facial-recognition.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [cryptography](<https://devfeed.tech/tags/cryptography.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [facial-recognition](<https://devfeed.tech/tags/facial-recognition.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [programming](<https://devfeed.tech/tags/programming.md>)

### AI overview

A collection of short answers about fully homomorphic encryption (FHE), covering encrypted queries, computation on ciphertexts, sorting, performance, and security against quantum computers. The article explains that FHE can support operations on encrypted data without exposing the underlying plaintext, while computational overhead remains a key limitation.

### Source excerpt

I work on homomorphic encryption (HE or FHE for "fully" homomorphic encryption) and I have written a lot about it on this blog (see the relevant tag). This article is a collection of short answers to questions I see on various threads and news aggregators discussing FHE. Facts If a service uses FHE and can respond to encrypted queries, can't the service see your query? How is it possible to operate on encrypted data without seeing it?

## Dijkstra's Views on Theory, Academia, and Programming Languages

DevFeed: [Dijkstra's Views on Theory, Academia, and Programming Languages](<https://devfeed.tech/articles/leibniz-s-dream-and-dijkstra-s-nightmare-40518.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2025-05-13-2107/>)

Published: 2025-05-13T14:23:11Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Programming](<https://devfeed.tech/topics/programming.md>)

Tags: [essays](<https://devfeed.tech/tags/essays.md>), [programming](<https://devfeed.tech/tags/programming.md>), [programming-languages](<https://devfeed.tech/tags/programming-languages.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

The author reflects on Edsger Dijkstra's speech "Under the spell of Leibniz's Dream," focusing on its view that elegant theory can have practical value. They critique Dijkstra's dismissive attitude toward industry, students, and modern universities, while discussing his praise of ALGOL 60 and its language innovations.

### Source excerpt

I was inspired to browse some of Edsger Dijkstra's essays today, and came across his speech, "Under the spell of Leibniz's Dream". It's the sort of personal history I love to read, which gives one person's sense of the world over a period of change. One quote that immediately struck me was his view of his country's spirit after WWII: An important side-effect of the hard times was the creation of a spiritual climate in which the distinction between pure and applied science had vanished: of all the things you could do, you just did the most urgent one, and the development of some urgently needed theory was often the most practical thing to do.

## My Graduate Career in Math

DevFeed: [My Graduate Career in Math](<https://devfeed.tech/articles/my-graduate-career-in-math-40490.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2025/05/12/my-graduate-career-in-math/>)

Published: 2025-05-12T18:35:57Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [computer-science](<https://devfeed.tech/tags/computer-science.md>), [education](<https://devfeed.tech/tags/education.md>), [essay](<https://devfeed.tech/tags/essay.md>), [essays](<https://devfeed.tech/tags/essays.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [graph-theory](<https://devfeed.tech/tags/graph-theory.md>), [group-theory](<https://devfeed.tech/tags/group-theory.md>), [linear-algebra](<https://devfeed.tech/tags/linear-algebra.md>), [math](<https://devfeed.tech/tags/math.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [retrospective](<https://devfeed.tech/tags/retrospective.md>), [topology](<https://devfeed.tech/tags/topology.md>), [university](<https://devfeed.tech/tags/university.md>)

### AI overview

An autobiographical essay about the author's transition from computer science to mathematics at Cal Poly, including university coursework, study abroad in Budapest, and reflections on the intellectual environment and an early group theory project.

### Source excerpt

Editor's note: This essay was originally published on Medium on 2016-03-05. I have made minor edits in this republishing and added a few small retrospective notes. 2010-2011 (Year 0) I had just switched my major at Cal Poly State University from computer science to math. I wanted to double major but California was in a budget crisis and a few weeks before I tried submitting my double-major request the Provost for the CSU system put a blanket ban on double majors.

## HEIR talk at FHE.org

DevFeed: [HEIR talk at FHE.org](<https://devfeed.tech/articles/heir-talk-at-fhe-org-40517.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2025-04-15-1239/>)

Published: 2025-04-15T19:39:13Z

Content type: release

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Compiler](<https://devfeed.tech/topics/compiler.md>), [FHE](<https://devfeed.tech/topics/fhe.md>)

Tags: [article](<https://devfeed.tech/tags/article.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [heir](<https://devfeed.tech/tags/heir.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

The author announces that a talk about the HEIR compiler project, presented at the FHE.org conference in Sofia, Bulgaria, is now available on YouTube, with public slides. They also plan to write more about HEIR in the future.

### Source excerpt

Last month I gave a talk on the HEIR compiler project at the FHE.org conference in Sofia, Bulgaria. The video is on YouTube now, and the slides are public. I plan to write more about HEIR in the coming months, because it's been an exciting and fulfilling ride!

## Does Baby Have Hat

DevFeed: [Does Baby Have Hat](<https://devfeed.tech/articles/does-baby-have-hat-40489.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2025/04/01/does-baby-have-hat/>)

Published: 2025-04-01T07:00:00Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Software](<https://devfeed.tech/topics/software.md>), [Code](<https://devfeed.tech/topics/code.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Learning](<https://devfeed.tech/topics/learning.md>)

Tags: [april-cools](<https://devfeed.tech/tags/april-cools.md>), [automate](<https://devfeed.tech/tags/automate.md>), [blog-post](<https://devfeed.tech/tags/blog-post.md>), [code](<https://devfeed.tech/tags/code.md>), [innovation](<https://devfeed.tech/tags/innovation.md>), [learn](<https://devfeed.tech/tags/learn.md>)

### AI overview

An April Cools essay uses donated baby hats as a metaphor for software and innovation: useful work begins by talking to people about what they need, rather than pursuing novelty for its own sake. The available text also begins a discussion of automating tasks in non-technology jobs.

### Source excerpt

It's April Cools! Last year I wrote about parenting, in 2023 about friendship bracelets. and in 2022 about cocktails. This year it's a bit of a meandering stroll through some ideas around mutual aid and self-reliance. Maternity wards If you walk around the maternity ward at Kaiser Permanente's Sunnyside medical center outside of Portland, Oregon, you might notice the same two things I did. The first was how many signs were posted on the hallways describing the maternity team's KRs and displaying charts showing that they are meeting them.

## Carathéodory-Fejér Approximation as an Alternative to Remez

DevFeed: [Carathéodory-Fejér Approximation as an Alternative to Remez](<https://devfeed.tech/articles/anyone-know-of-an-approachable-proof-of-the-caratheodory-fejer-theorem-40515.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2025-02-09-1947/>)

Published: 2025-02-10T03:47:59Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [Python](<https://devfeed.tech/topics/python.md>), [C++](<https://devfeed.tech/topics/c-plus-plus.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [python](<https://devfeed.tech/tags/python.md>), [remez](<https://devfeed.tech/tags/remez.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

The author describes replacing a brittle Remez approximation prototype with the Carathéodory-Fejér method, which a colleague prototyped and the author is porting to C++ for the HEIR compiler. The author seeks an approachable proof of the Carathéodory-Fejér theorem and notes known limitations of the method.

### Source excerpt

A colleague of mine recently lent a hand implementing a polynomial approximation routine I could port to our compiler, though it wasn't the method I was expecting. As I had written about previously, I was studying the Remez algorithm and implementing a prototype in Python. Remez approximation involves an iterated loop that alternates between root-finding and linear-system solving, and as such it can be rather brittle and difficult. Numerical errors and accuracy limits in these subsolvers contribute to weird edge cases that make the algorithm fail to converge.

## Explainable Linear Programs

DevFeed: [Explainable Linear Programs](<https://devfeed.tech/articles/explainable-linear-programs-40514.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2025-02-06-2124/>)

Published: 2025-02-07T05:24:38Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Optimization](<https://devfeed.tech/topics/optimization.md>), [scheduling](<https://devfeed.tech/topics/scheduling.md>), [Routing (disambiguation)](<https://devfeed.tech/topics/routing.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Microsoft](<https://devfeed.tech/topics/microsoft.md>)

Tags: [google](<https://devfeed.tech/tags/google.md>), [large-language-models](<https://devfeed.tech/tags/large-language-models.md>), [microsoft](<https://devfeed.tech/tags/microsoft.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [routing](<https://devfeed.tech/tags/routing.md>), [scheduling](<https://devfeed.tech/tags/scheduling.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

The author describes a 2020 side project for explaining linear-programming solutions by interactively changing constraints or objectives, re-solving models, and aggregating differences using semantic metadata. The article connects this approach to a 2023 Microsoft paper that uses a large language model to translate natural-language queries into structured queries for supply-chain optimization.

### Source excerpt

Back in 2020, when I worked in the supply chain side of Google, I had a fun and impactful side project related to human-level explanations of linear programs. A linear program is a mathematical model that defines some number of variables, linear constraints, and a linear objective function. When some variables are forced to be integer (ILPs), you can solve a lot of useful problems like scheduling, routing, and packing. That's basically how all supply chain optimization works.

## I'll be at the JMM

DevFeed: [I'll be at the JMM](<https://devfeed.tech/articles/i-ll-be-at-the-jmm-40513.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2025-01-07-1747/>)

Published: 2025-01-08T01:47:21Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Mathematics](<https://devfeed.tech/topics/mathematics.md>)

Tags: [crypto](<https://devfeed.tech/tags/crypto.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [math](<https://devfeed.tech/tags/math.md>), [programming](<https://devfeed.tech/tags/programming.md>), [seattle](<https://devfeed.tech/tags/seattle.md>), [shortform](<https://devfeed.tech/tags/shortform.md>), [talks](<https://devfeed.tech/tags/talks.md>)

### AI overview

The author announces attendance at the Joint Mathematics Meeting in Seattle, where they plan to attend homomorphic encryption talks and discuss programming for mathematicians as research for a future book.

### Source excerpt

I'll be at the Joint Mathematics Meeting in Seattle (starting tomorrow). If you see me there, say hi! I will have a very light schedule, plenty of time for coffee chats. I'll be attending many of the crypto sessions for the homomorphic encryption talks. And on Thursday at 3PM, I'll be at the Code4Math booth in the exhibition hall. I'll be chatting with math people who want to get into programming, mainly as field research for a future book on programming for mathematicians, the converse of A Programmer's Introduction to Mathematics

## Fully Homomorphic Encryption and the Public

DevFeed: [Fully Homomorphic Encryption and the Public](<https://devfeed.tech/articles/fully-homomorphic-encryption-and-the-public-40497.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/fhe-and-the-public/>)

Published: 2025-01-03T07:00:00Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [FHE](<https://devfeed.tech/topics/fhe.md>), [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Security](<https://devfeed.tech/topics/security.md>)

Tags: [cryptography](<https://devfeed.tech/tags/cryptography.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [security](<https://devfeed.tech/tags/security.md>)

### AI overview

A living document records public reactions to homomorphic encryption, focusing on how journalists, bloggers, and social media participants perceive its risks and benefits. It includes discussion of Apple's use of homomorphic encryption in Enhanced Visual Search for Photos and related privacy concerns.

### Source excerpt

In this living document, I will document reactions to uses of homomorphic encryption by members of the public. By "member of the public," I mean people who may be technical, but are not directly involved in the development or deployment of homomorphic encryption systems. This includes journalists, bloggers, aggregator comment threads, and social media posts. My main goal is to understand how the public perceives the risks and benefits of using homomorphic encryption.

## HEIR advances integration of fully homomorphic encryption with accelerator hardware

DevFeed: [HEIR advances integration of fully homomorphic encryption with accelerator hardware](<https://devfeed.tech/articles/the-last-few-months-in-heir-40511.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/shortform/2024-11-15-0831/>)

Published: 2024-11-15T18:25:51Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [FHE](<https://devfeed.tech/topics/fhe.md>), [homomorphic encryption](<https://devfeed.tech/topics/homomorphic-encryption.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [Hardware](<https://devfeed.tech/topics/hardware.md>), [fpga](<https://devfeed.tech/topics/fpga.md>), [GPU](<https://devfeed.tech/topics/gpu.md>), [Inference](<https://devfeed.tech/topics/inference.md>)

Tags: [compiler](<https://devfeed.tech/tags/compiler.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [fpga](<https://devfeed.tech/tags/fpga.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [inference](<https://devfeed.tech/tags/inference.md>), [shortform](<https://devfeed.tech/tags/shortform.md>)

### AI overview

This developer update describes progress on HEIR, a compiler toolchain for fully homomorphic encryption. The project is working with hardware vendors and researchers to target GPU, FPGA, ASIC, optical, and TPU accelerators, while contributing to standardized hardware interfaces and optimizing FHE compilation and machine learning inference.

### Source excerpt

In my little corner of the FHE world, things have been steadily heating up. For those who don't know, my main work project right now is HEIR (Homomorphic Encryption Intermediate Representation), a compiler toolchain for fully homomorphic encryption (FHE). For an extended introduction see this talk from October 2023. The primary focus of HEIR is to compile to FHE hardware accelerators. And boy there are a lot of them. There are GPU and FPGA accelerators, as well as special purpose ASICs and even optical accelerators (discrete Fourier transforms at the speed of light).

[Next page](<https://devfeed.tech/sources/jeremy-kun.md?cursor=WyIyMDI0LTExLTE1VDE4OjI1OjUxKzAwOjAwIiwgIjcwZGQyMGIyLWIxZTctNDEyZS1iYjY4LTE0ZDY2NTFkODQ5YiJd>)