# Github Repository

Published articles for Github Repository.

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

## One honojs file for entire web scraping API

DevFeed: [One honojs file for entire web scraping API](<https://devfeed.tech/articles/one-honojs-file-for-entire-web-scraping-api-39140.md>)

Original publisher: [Read original article](<https://ihatereading.in/t/one-honojs-file-for-entire-web-scraping-api>)

Author: iHateReading

Published: 2026-04-13T16:54:35Z

Content type: tutorial

Language: en

Sources: [iHateReading](<https://devfeed.tech/sources/ihatereading.md>)

Topics: [Hono](<https://devfeed.tech/topics/honojs.md>), [Web Scraping](<https://devfeed.tech/topics/web-scraping.md>), [API](<https://devfeed.tech/topics/api.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [backend](<https://devfeed.tech/tags/backend.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [coding](<https://devfeed.tech/tags/coding.md>), [development](<https://devfeed.tech/tags/development.md>), [frontend](<https://devfeed.tech/tags/frontend.md>), [github-repository](<https://devfeed.tech/tags/github-repository.md>), [honojs](<https://devfeed.tech/tags/honojs.md>), [ihatereading](<https://devfeed.tech/tags/ihatereading.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [node-js](<https://devfeed.tech/tags/node-js.md>), [one-honojs-file-for-entire-web-scraping-api](<https://devfeed.tech/tags/one-honojs-file-for-entire-web-scraping-api.md>), [product](<https://devfeed.tech/tags/product.md>), [programming](<https://devfeed.tech/tags/programming.md>), [react](<https://devfeed.tech/tags/react.md>), [scraping](<https://devfeed.tech/tags/scraping.md>), [typescript](<https://devfeed.tech/tags/typescript.md>), [web-development](<https://devfeed.tech/tags/web-development.md>), [web-scraping](<https://devfeed.tech/tags/web-scraping.md>), [web-scraping-github-repository-scraping-backend-honojs](<https://devfeed.tech/tags/web-scraping-github-repository-scraping-backend-honojs.md>)

### AI overview

A tutorial about building web-scraping endpoints in a single Honojs file.

### Source excerpt

Building scrape endpoints using one honojs file

## Packing Matrix-Vector Multiplication in Fully Homomorphic Encryption

DevFeed: [Packing Matrix-Vector Multiplication in Fully Homomorphic Encryption](<https://devfeed.tech/articles/packing-matrix-vector-multiplication-in-fully-homomorphic-encryption-40487.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2024/09/06/packing-matrix-vector-multiplication-in-fhe/>)

Published: 2024-09-07T04:18:09Z

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>), [layout](<https://devfeed.tech/topics/layout.md>), [parallel](<https://devfeed.tech/topics/parallel.md>), [Python](<https://devfeed.tech/topics/python.md>)

Tags: [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [data](<https://devfeed.tech/tags/data.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [github-repository](<https://devfeed.tech/tags/github-repository.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [layout](<https://devfeed.tech/tags/layout.md>), [linear-algebra](<https://devfeed.tech/tags/linear-algebra.md>), [lwe](<https://devfeed.tech/tags/lwe.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [packing](<https://devfeed.tech/tags/packing.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [rlwe](<https://devfeed.tech/tags/rlwe.md>), [simd](<https://devfeed.tech/tags/simd.md>), [strategies](<https://devfeed.tech/tags/strategies.md>)

### 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.

## MLIR -- Getting Started

DevFeed: [MLIR -- Getting Started](<https://devfeed.tech/articles/mlir-getting-started-40467.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2023/08/10/mlir-getting-started/>)

Published: 2023-08-10T14:32:33Z

Content type: tutorial

Language: en

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

Topics: [mlir](<https://devfeed.tech/topics/mlir.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [toolchain](<https://devfeed.tech/topics/toolchain.md>), [FHE](<https://devfeed.tech/topics/fhe.md>), [LLVM](<https://devfeed.tech/topics/llvm.md>), [Google](<https://devfeed.tech/topics/google.md>), [monorepo](<https://devfeed.tech/topics/monorepo.md>)

Tags: [build](<https://devfeed.tech/tags/build.md>), [build-system](<https://devfeed.tech/tags/build-system.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [compilers](<https://devfeed.tech/tags/compilers.md>), [documentation](<https://devfeed.tech/tags/documentation.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [github-repository](<https://devfeed.tech/tags/github-repository.md>), [llvm](<https://devfeed.tech/tags/llvm.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [mlir](<https://devfeed.tech/tags/mlir.md>), [monorepo](<https://devfeed.tech/tags/monorepo.md>), [programming](<https://devfeed.tech/tags/programming.md>), [toolchain](<https://devfeed.tech/tags/toolchain.md>)

### AI overview

This introductory article explains the structure of a typical MLIR project and the build system used in the HEIR project, a Google effort focused on production engineering tools for Fully Homomorphic Encryption. It also introduces the relationship between MLIR and LLVM and describes pinning the MLIR dependency to a specific commit hash.

### Source excerpt

Table of Contents As we announced recently, my team at Google has started a new effort to build production-worthy engineering tools for Fully Homomorphic Encryption (FHE). One focal point of this, and one which I'll be focusing on as long as Google is willing to pay me to do so, is building out a compiler toolchain for FHE in the MLIR framework (Multi-Level Intermediate Representation). The project is called Homomorphic Encryption Intermediate Representation, or HEIR.

## Google's Recent FHE work, and starting HEIR

DevFeed: [Google's Recent FHE work, and starting HEIR](<https://devfeed.tech/articles/google-s-recent-fhe-work-and-starting-heir-40466.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2023/08/10/googles-recent-fhe-work-and-starting-heir/>)

Published: 2023-08-10T12:22: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>), [Google](<https://devfeed.tech/topics/google.md>), [Compiler](<https://devfeed.tech/topics/compiler.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [compiler](<https://devfeed.tech/tags/compiler.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [fhe](<https://devfeed.tech/tags/fhe.md>), [github](<https://devfeed.tech/tags/github.md>), [github-repository](<https://devfeed.tech/tags/github-repository.md>), [google](<https://devfeed.tech/tags/google.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [homomorphic-encryption](<https://devfeed.tech/tags/homomorphic-encryption.md>), [mlir](<https://devfeed.tech/tags/mlir.md>), [models](<https://devfeed.tech/tags/models.md>), [repository](<https://devfeed.tech/tags/repository.md>)

### AI overview

A Google team reports recent work on fully homomorphic encryption, including video processing, machine-learning model compilation, TPU implementation, and compiler improvements. The article also introduces HEIR, an early project intended to provide a standardized foundation for FHE compilers using MLIR.

### Source excerpt

Today my team at Google published an article on Google's Developers Blog with some updates on what we've been doing with fully homomorphic encryption (FHE). There's fun stuff in there, including work on video processing FHE, compiling ML models to FHE, an FHE implementation for TPUs, and improvements to the compiler I wrote about earlier this year. TODO: add mower gif video A simple object movement tracking algorithm in FHE, tracking a runaway lawn mower from a Nest camera.

## Singular Value Decomposition Part 2: Theorem, Proof, Algorithm

DevFeed: [Singular Value Decomposition Part 2: Theorem, Proof, Algorithm](<https://devfeed.tech/articles/singular-value-decomposition-part-2-theorem-proof-algorithm-40399.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2016/05/16/singular-value-decomposition-part-2-theorem-proof-algorithm/>)

Published: 2016-05-16T08:00:19Z

Content type: tutorial

Language: en

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

Topics: [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [data](<https://devfeed.tech/topics/data.md>), [Code](<https://devfeed.tech/topics/code.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [code](<https://devfeed.tech/tags/code.md>), [data](<https://devfeed.tech/tags/data.md>), [examples](<https://devfeed.tech/tags/examples.md>), [github](<https://devfeed.tech/tags/github.md>), [github-repository](<https://devfeed.tech/tags/github-repository.md>), [greedy-algorithm](<https://devfeed.tech/tags/greedy-algorithm.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [singular-value-decomposition](<https://devfeed.tech/tags/singular-value-decomposition.md>)

### AI overview

This tutorial develops the mathematical foundations of singular value decomposition through definitions, proofs, and an algorithm. It explains best-approximating k-dimensional linear subspaces, vector projection, and squared distance, and mentions testing the method on a thousand-story CNN news dataset with accompanying code and examples in a GitHub repository.

### Source excerpt

I'm just going to jump right into the definitions and rigor, so if you haven't read the previous post motivating the singular value decomposition, go back and do that first. This post will be theorem, proof, algorithm, data. The data set we test on is a thousand-story CNN news data set. All of the data, code, and examples used in this post is in a github repository, as usual. We start with the best-approximating $ k$-dimensional linear subspace.

## Gemify your assets

DevFeed: [Gemify your assets](<https://devfeed.tech/articles/gemify-your-assets-37718.md>)

Original publisher: [Read original article](<https://carlosbecker.com/posts/gemify-your-assets/>)

Author: Carlos Alexandro Becker

Published: 2013-02-05T00:00:00Z

Content type: tutorial

Language: en

Sources: [Carlos Becker](<https://devfeed.tech/sources/carlos-becker.md>)

Topics: [Rails](<https://devfeed.tech/topics/rails.md>), [rubygems](<https://devfeed.tech/topics/rubygems.md>), [GitHub](<https://devfeed.tech/topics/github.md>), [Library](<https://devfeed.tech/topics/library.md>)

Tags: [asset-pipeline](<https://devfeed.tech/tags/asset-pipeline.md>), [github-repository](<https://devfeed.tech/tags/github-repository.md>), [how-to](<https://devfeed.tech/tags/how-to.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [rails](<https://devfeed.tech/tags/rails.md>), [release](<https://devfeed.tech/tags/release.md>), [rubygems](<https://devfeed.tech/tags/rubygems.md>)

### AI overview

A tutorial on packaging JavaScript assets as a Ruby gem for use with the Rails 3.1 asset pipeline. It covers creating the gem structure, adding assets and a Rails engine, testing the gem in a Rails application, documenting it, and releasing it through GitHub and RubyGems.

### Source excerpt

Rails 3.1 introduced the asset pipeline, which makes it easy to include versioned external assets as application dependencies.