# 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. ## Updates on HEIR, the homomorphic encryption compiler project DevFeed: [Updates on HEIR, the homomorphic encryption compiler project]() Original publisher: [Read original article]() Published: 2026-09-04T18:53:40Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [homomorphic encryption](), [Compiler](), [Encryption](), [Cryptography](), [Machine learning](), [Inference](), [GitHub](), [bazel](), [Kaggle]() Tags: [bazel](), [ckks](), [compiler](), [cryptography](), [encryption](), [github](), [homomorphic-encryption](), [inference](), [kaggle](), [mathematics](), [ml](), [programming]() ### 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]() Original publisher: [Read original article]() Published: 2026-05-22T22:28:34Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Sequences]() Tags: [depths-of-oeis](), [doom](), [oeis](), [sequences](), [shortform](), [xkcd]() ### 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]() Original publisher: [Read original article]() Published: 2026-04-29T12:25:44Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [homomorphic encryption](), [Cryptography](), [Mathematics](), [Math and Logic]() Tags: [ckks](), [ckks-tutorial](), [cryptography](), [encoding](), [encryption](), [homomorphic-encryption](), [mathematics](), [neural-network](), [polynomial-ring](), [polynomials](), [programming](), [python](), [technical](), [tutorial]() ### 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]() Original publisher: [Read original article]() Published: 2026-04-13T14:00:00Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Sequences](), [Open Source](), [GitHub](), [Algorithms]() Tags: [algorithms](), [code](), [coding](), [depths-of-oeis](), [github](), [oeis](), [open-source](), [sequences](), [shortform]() ### 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]() Original publisher: [Read original article]() Published: 2026-04-09T13:55:17Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Sequences](), [math](), [Database]() Tags: [database](), [depths-of-oeis](), [new-york-city](), [numberphile](), [oeis](), [quirk](), [sequence](), [sequences](), [shortform](), [train]() ### 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]() Original publisher: [Read original article]() Published: 2026-04-07T13:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Algorithms](), [C++](), [Mathematics](), [Cryptography](), [homomorphic encryption]() Tags: [algorithm](), [c-plus-plus](), [code](), [cryptography](), [homomorphic-encryption](), [mathematics](), [miller-rabin](), [oeis](), [primes](), [programming](), [randomized-algorithm]() ### 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]() Original publisher: [Read original article]() Published: 2025-11-17T16:41:28Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [FHE](), [Encryption](), [Algorithm](), [Code](), [GitHub]() Tags: [algorithm](), [circuit](), [code](), [cryptography](), [encryption](), [fhe](), [github](), [homomorphic-encryption](), [linear-algebra](), [lwe](), [mathematics](), [programming](), [rlwe]() ### 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]() Original publisher: [Read original article]() Published: 2025-10-19T20:14:22Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Library](), [Optimization](), [compilers](), [Open Source](), [mlir]() Tags: [code](), [compilers](), [isl](), [library](), [loops](), [mathematics](), [mlir](), [open-source](), [optimization](), [polyhedral-optimization](), [programming](), [set-theory]() ### 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]() Original publisher: [Read original article]() Published: 2025-07-25T16:56:45Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [FHE](), [homomorphic encryption](), [Google](), [intel](), [Compiler](), [AdventureX 2025]() Tags: [2025](), [compiler](), [fhe](), [google](), [hackathon](), [homomorphic-encryption](), [intel](), [shortform]() ### 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]() Original publisher: [Read original article]() Published: 2025-07-18T17:31:49Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [homomorphic encryption](), [FHE](), [Cryptography](), [math](), [GPU](), [Facial recognition](), [Sorting]() Tags: [cryptography](), [encryption](), [facial-recognition](), [fhe](), [gpu](), [homomorphic-encryption](), [mathematics](), [programming]() ### 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]() Original publisher: [Read original article]() Published: 2025-05-13T14:23:11Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Programming]() Tags: [essays](), [programming](), [programming-languages](), [shortform]() ### 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]() Original publisher: [Read original article]() Published: 2025-05-12T18:35:57Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Mathematics](), [Computer science](), [graph theory]() Tags: [computer-science](), [education](), [essay](), [essays](), [game-theory](), [graph-theory](), [group-theory](), [linear-algebra](), [math](), [mathematics](), [retrospective](), [topology](), [university]() ### 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]() Original publisher: [Read original article]() Published: 2025-04-15T19:39:13Z Content type: release Language: en Sources: [Jeremy Kun]() Topics: [Compiler](), [FHE]() Tags: [article](), [compiler](), [fhe](), [heir](), [shortform]() ### 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]() Original publisher: [Read original article]() Published: 2025-04-01T07:00:00Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Software](), [Code](), [coding](), [Learning]() Tags: [april-cools](), [automate](), [blog-post](), [code](), [innovation](), [learn]() ### 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]() Original publisher: [Read original article]() Published: 2025-02-10T03:47:59Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Algorithms](), [Compiler](), [Python](), [C++]() Tags: [algorithm](), [c-plus-plus](), [compiler](), [python](), [remez](), [shortform]() ### 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]() Original publisher: [Read original article]() Published: 2025-02-07T05:24:38Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Optimization](), [scheduling](), [Routing (disambiguation)](), [Large Language Model](), [Microsoft]() Tags: [google](), [large-language-models](), [microsoft](), [optimization](), [routing](), [scheduling](), [shortform]() ### 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. ## Fully Homomorphic Encryption and the Public DevFeed: [Fully Homomorphic Encryption and the Public]() Original publisher: [Read original article]() Published: 2025-01-03T07:00:00Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [FHE](), [homomorphic encryption](), [Cryptography](), [Security]() Tags: [cryptography](), [fhe](), [homomorphic-encryption](), [privacy](), [security]() ### 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]() Original publisher: [Read original article]() Published: 2024-11-15T18:25:51Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [FHE](), [homomorphic encryption](), [Compiler](), [Hardware](), [fpga](), [GPU](), [Inference]() Tags: [compiler](), [encryption](), [fhe](), [fpga](), [gpu](), [hardware](), [inference](), [shortform]() ### 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). ## Attention spans for math and stories DevFeed: [Attention spans for math and stories]() Original publisher: [Read original article]() Published: 2024-11-15T16:28:26Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Math and Logic](), [math]() Tags: [children](), [essays](), [games](), [math](), [storytelling]() ### AI overview This essay argues that storytelling can motivate young children to engage with abstract mathematical reasoning. It contrasts children's enjoyment of surprising patterns and stories with the persistence needed to explore deeper mathematical questions. ### Source excerpt Editor's note: This essay was originally published in 2019. I have made minor edits in this republishing. There was a MathOverflow thread about mathematically interesting games for 5-6 year olds. A lot of the discussion revolved around how young age 5 really is, and how we should temper expectations because we don't really remember what it's like to be 5. In response to an enormous answer by Alexander Chervov, user LSpice quipped, "'Daddy, daddy, let's play another in the infinite indexed family of perfect-information draw-free cheap-to-construct two-player games! ## Carnival of Mathematics #233 DevFeed: [Carnival of Mathematics #233]() Original publisher: [Read original article]() Published: 2024-11-01T07:00:00Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [math](), [GPU](), [Nvidia](), [clustering](), [Regular expression](), [Python]() Tags: [carnival](), [clustering](), [fibonacci](), [gpu](), [mathematics](), [nvidia](), [python](), [regex]() ### AI overview A roundup of mathematics news and media from October 2022, including a newly reported largest known prime, mathematical research, discussions of political geography and clustering, and videos about voting paradoxes, polylinks, and prime-recognizing regular expressions. ### Source excerpt Welcome to the 233rd Carnival of Mathematics! Who can forget 233, the 6th Fibonacci prime? Hey, not all numbers are interesting. Don't ask me about the smallest positive uninteresting number. You can't make it interesting with your feeble mind tricks! Anyway, on to the fun. Provers and Shakers The big discovery this month was a new largest known prime number, $2^{136279841} - 1$, as reported by the Great Internet Mersenne Prime Search. ## How This Blog Does IndieWeb DevFeed: [How This Blog Does IndieWeb]() Original publisher: [Read original article]() Published: 2024-10-31T05:22:12Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [IndieWeb](), [Hugo](), [static-site-generator](), [GitHub Actions](), [Netlify](), [WordPress]() Tags: [article](), [github-actions](), [hugo](), [indieweb](), [netlify](), [posse]() ### AI overview A technical walkthrough of how the author migrated a blog from WordPress to Hugo and implemented IndieWeb features. It covers static-site deployment with Netlify, GitHub Actions automation, shortform social syndication, and related integrations. ### Source excerpt This article will explain how the blog is organized at a technical level, and show how I implemented various IndieWeb features. Table of Contents: Motivation Structure and Deployment Static search index Running scripts via GitHub Actions Social media syndication and the "shortform" section Links to syndicated versions at the end of each post Warning for a too-long first paragraph Triggering this workflow automatically after deployment Blogroll (the "What I'm Reading" page) Chrome extension Webmentions and referencing external discussion threads Bridgy Hacker News backlinks Outgoing webmentions DOIs Dead link checker Motivation Earlier this year I migrated this blog off Wordpress to the Hugo static site generator. ## LWE Attack Benchmarking Project DevFeed: [LWE Attack Benchmarking Project]() Original publisher: [Read original article]() Published: 2024-10-15T22:43:03Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [benchmarking](), [FHE](), [homomorphic encryption](), [Security](), [Transformer]() Tags: [benchmark](), [benchmarking](), [fhe](), [homomorphic-encryption](), [research](), [security](), [shortform]() ### AI overview The article discusses a Facebook research project benchmarking attacks against learning with errors (LWE), motivated by the security implications of small, sparse secrets and errors in settings including Kyber and homomorphic encryption. It highlights a reported recovery of Hamming-weight-9 secrets in a specific homomorphic-encryption setting and notes that one attack is transformer-based. ### Source excerpt Kristin Lauter and her colleagues at Facebook research recently announced a project to benchmark attacks against LWE. The announcement was on the post-quanum crypto mailing list. They state: "Our approach is motivated by the need to study more carefully the effect on security of using small secrets and small error in standardized LWE settings like Kyber and Homomorphic Encryption. In addition, as sparse secrets have been used in Homomorphic Encryption for efficiency and functionality, it is important to study sparse secrets as well. ## Why Dynamic Programming Failed for a Woodworking Project DevFeed: [Why Dynamic Programming Failed for a Woodworking Project]() Original publisher: [Read original article]() Published: 2024-09-12T22:02:05Z Content type: opinion Language: en Sources: [Jeremy Kun]() Topics: [Programming](), [Algorithms]() Tags: [algorithms](), [dynamic-programming](), [programming](), [shortform](), [woodworking]() ### AI overview The author describes applying a dynamic programming approach to determine how 2x4 and 2x6 planks could fill a shed floor width. Variations in actual lumber dimensions and board straightness made the exact calculation unreliable, so the author ripped the final board to fit. The experience is presented as a practical contrast to idealized exact-coin-change problems in introductory algorithms courses. ### Source excerpt This is a story about a failure to apply dynamic programming to a woodworking project. I've been building a shed in my backyard, and for one section I decided to build the floor by laying 2x4 planks side by side. I didn't feel the need to join them with tongue-and-groove, but I did notice that using 2x4s alone wouldn't fit the width they were supposed to fill. I also had some 2x6 boards left over from a different part of the shed, and I realized that gave a neat dynamic programming problem: Can you fill a given width by laying planks of standard dimensional lumber? ## Packing Matrix-Vector Multiplication in Fully Homomorphic Encryption DevFeed: [Packing Matrix-Vector Multiplication in Fully Homomorphic Encryption]() Original publisher: [Read original article]() Published: 2024-09-07T04:18:09Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [homomorphic encryption](), [FHE](), [Encryption](), [layout](), [parallel](), [Python]() Tags: [arithmetic](), [code](), [cryptography](), [data](), [encryption](), [fhe](), [github-repository](), [homomorphic-encryption](), [layout](), [linear-algebra](), [lwe](), [mathematics](), [packing](), [parallel](), [programming](), [python](), [rlwe](), [simd](), [strategies]() ### AI overview This article explains packing for SIMD-style fully homomorphic encryption. It describes how to arrange plaintext data in RLWE ciphertexts so matrix-vector multiplication requires fewer alignment multiplications and rotations, then introduces two basic packing techniques and a computational model. ### Source excerpt In my recent overview of homomorphic encryption, I underemphasized the importance of data layout when working with arithmetic (SIMD-style) homomorphic encryption schemes. In the FHE world, the name given to data layout strategies is called "packing," because it revolves around putting multiple plaintext data into RLWE ciphertexts in carefully-chosen ways that mesh well with the operations you'd like to perform. By "mesh well" I mean it reduces the number of extra multiplications and rotations required merely to align data elements properly, rather than doing the actual computation you care about. [Next page]()