# ans

Published articles for ans.

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

## Linux Foundation Newsletter: November 2026

DevFeed: [Linux Foundation Newsletter: November 2026](<https://devfeed.tech/articles/linux-foundation-newsletter-november-2026-142930.md>)

Original publisher: [Read original article](<https://www.linuxfoundation.org/blog/linux-foundation-newsletter-november-2026>)

Author: marketing@linuxfoundation.org (The Linux Foundation)

Published: 2026-11-18T18:00:01Z

Content type: news

Language: en

Sources: [Linux Foundation](<https://devfeed.tech/sources/linux-foundation-blog.md>)

Topics: [linux foundation](<https://devfeed.tech/topics/linux-foundation.md>), [Linux](<https://devfeed.tech/topics/linux.md>), [lf education](<https://devfeed.tech/topics/lf-education.md>), [LF Research](<https://devfeed.tech/topics/lf-research.md>), [LF Europe](<https://devfeed.tech/topics/lf-europe.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>), [openssf](<https://devfeed.tech/topics/openssf.md>), [Finance](<https://devfeed.tech/topics/finance.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Visual Studio Code](<https://devfeed.tech/topics/visual-studio-code.md>), [Learning](<https://devfeed.tech/topics/learning.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agent-identity](<https://devfeed.tech/tags/agent-identity.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [agentic-ai-foundation](<https://devfeed.tech/tags/agentic-ai-foundation.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-impact](<https://devfeed.tech/tags/ai-impact.md>), [announcements](<https://devfeed.tech/tags/announcements.md>), [ans](<https://devfeed.tech/tags/ans.md>), [black-friday](<https://devfeed.tech/tags/black-friday.md>), [blog](<https://devfeed.tech/tags/blog.md>), [careers](<https://devfeed.tech/tags/careers.md>), [certification](<https://devfeed.tech/tags/certification.md>), [certifications](<https://devfeed.tech/tags/certifications.md>), [education](<https://devfeed.tech/tags/education.md>), [foundation](<https://devfeed.tech/tags/foundation.md>), [lf-europe](<https://devfeed.tech/tags/lf-europe.md>), [lf-events](<https://devfeed.tech/tags/lf-events.md>), [lf-research](<https://devfeed.tech/tags/lf-research.md>), [linux](<https://devfeed.tech/tags/linux.md>), [linux-blog](<https://devfeed.tech/tags/linux-blog.md>), [linux-foundation](<https://devfeed.tech/tags/linux-foundation.md>), [newsletter](<https://devfeed.tech/tags/newsletter.md>), [november-2026](<https://devfeed.tech/tags/november-2026.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [open-source-summit](<https://devfeed.tech/tags/open-source-summit.md>), [project-news](<https://devfeed.tech/tags/project-news.md>), [projects](<https://devfeed.tech/tags/projects.md>), [tech-talent](<https://devfeed.tech/tags/tech-talent.md>)

### AI overview

The November 2026 Linux Foundation newsletter reports new open source activity across AI, cloud native, security, and infrastructure. Agent Name Service joins the Linux Foundation with a DNS-based standard for identifying and authenticating AI agents; AAIF adds four projects and reaches 10 hosted projects and more than 300 members. CNCF reports 231 projects, including KubeVirt and NATS graduating. Research highlights include a 63% year-over-year rise in financial institutions' GitHub commits and findings that three in five teams ship code faster than security reviews can keep up. Other updates cover new certifications, a neocloud survey, and project developments spanning telecom, energy, embedded systems, and software security.

### Source excerpt

Welcome to the November 2026 edition of the Linux Foundation Newsletter! LF Education's Black Friday sale runs November 27 through December 4, with savings of up to 65% on training and certifications. Also new is the Certified Kubernetes Network Engineer (CKNE) certification and its Certification Pathway, and you can sign up to be notified when registration opens for the Secure AI Associate (SAIA) exam. This month's biggest announcements include a new open source project for AI agent identity and a milestone for the Agentic AI Foundation. The Linux Foundation welcomed Agent Name Service (ANS), which builds on DNS to verify and discover AI agents. AAIF added four projects (Agent Skills, Open Responses, OpenEnv, and OpenSandbox), bringing it to 10 hosted projects, and passed 300 members in its first year. The CNCF now hosts 231 projects, with KubeVirt and NATS graduating this month. LF Research published four reports. The 2026 State of Open Source in Financial Services found a 63% year-over-year increase in GitHub commits from financial institutions. The AI impact on cybersecurity report found that 3 in 5 teams ship code faster than security reviews can keep up. A third finds that the future depends on VMs and containers running together, and the fourth, State of Commercial Open Source 2026, draws on 225 founders and leaders. LF Research and CNCF are also fielding a 3-minute survey on neocloud adoption. You'll also find a recap of the industry challenge LF Europe co-led at the World Open Innovation Conference in Kaunas, Lithuania, plus project news that ranges from agentic AI to telecom and embedded systems. >> Read on for even more news, research, and opportunities from across the Linux Foundation.

## Hybrid Compression for Memory-Efficient Matrix-Vector Multiplication

DevFeed: [Hybrid Compression for Memory-Efficient Matrix-Vector Multiplication](<https://devfeed.tech/articles/hybrid-compression-for-memory-efficient-matrix-vector-multiplication-138788.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18792>)

Author: Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Compression](<https://devfeed.tech/topics/compression.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [alphabet](<https://devfeed.tech/tags/alphabet.md>), [also](<https://devfeed.tech/tags/also.md>), [ans](<https://devfeed.tech/tags/ans.md>), [applying](<https://devfeed.tech/tags/applying.md>), [approach](<https://devfeed.tech/tags/approach.md>), [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [can](<https://devfeed.tech/tags/can.md>), [coder](<https://devfeed.tech/tags/coder.md>), [column](<https://devfeed.tech/tags/column.md>), [combines](<https://devfeed.tech/tags/combines.md>), [component](<https://devfeed.tech/tags/component.md>), [compression](<https://devfeed.tech/tags/compression.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [matrix](<https://devfeed.tech/tags/matrix.md>), [memory](<https://devfeed.tech/tags/memory.md>), [vector](<https://devfeed.tech/tags/vector.md>)

### AI overview

The hybrid strategy improves mm-RePair's compression of real-valued machine-learning matrices by splitting the CSRV sequence into entries suited to RePair grammar compression and remaining entries encoded with ans-fold. It also sorts and delta encodes each row and remaps the alphabet to a contiguous range, while enabling matrix-vector multiplication directly on compressed data. In experiments on word embeddings and transformer hidden states, it was more compact than original mm-RePair on every input and reduced peak multiplication memory, with the largest gains on dense matrices with many distinct values and competitive multiplication times. It beat the column-reordering variant on most matrices; combining both approaches further compressed sparse matrices but greatly increased compression time. Its thread scaling matched original mm-RePair.

### Source excerpt

arXiv:2611.18792v1 Announce Type: new Abstract: Iterative machine-learning algorithms repeatedly access large real-valued matrices through matrix-vector products, and their performance is limited by memory bandwidth rather than arithmetic throughput. Lossless compression schemes that support computation directly over the compressed data reduce both the data moved and the memory footprint of these workloads. The mm-RePair framework [11] follows this approach by applying the RePair grammar compressor to the Compressed Sparse Row/Value (CSRV) representation of a matrix and performing matrix-vector multiplications directly on the compressed data. Its effectiveness, however, degrades on matrices that are dense or contain many distinct values. In this paper we present a hybrid strategy for the mm-RePair framework that combines grammar and entropy compression. The CSRV sequence is partitioned into a grammar-compressible component, formed by the entries that mm-RePair can compress effectively, and an entropy-compressible component holding the remaining entries, which is encoded with the ans-fold coder [24]. Compression improves further by sorting and delta encoding the entries of each row in the CSRV representation, and by remapping the alphabet to a contiguous range. Experiments on real-valued machine-learning matrices, including word embeddings and transformer hidden states, show that our hybrid strategy is more compact than the original \mmRepair on every input and reduces the peak memory of multiplication, with the largest gains on dense matrices with many distinct values, at competitive multiplication times. It also outperforms the column-reordering variant of \mmRepair on most of the matrices, and combining the two is even more compact on the sparse ones, at the cost of a much longer compression time. Finally, our strategy scales with the number of threads as well as the original \mmRepair does.

## Fast Entropy Decoding for Sparse MVM on GPUs

DevFeed: [Fast Entropy Decoding for Sparse MVM on GPUs](<https://devfeed.tech/articles/fast-entropy-decoding-for-sparse-mvm-on-gpus-126683.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.01915>)

Author: Emil Sch\\"atzle, Tommaso Pegolotti, Markus P\\"uschel

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [GPU optimization](<https://devfeed.tech/topics/gpu-optimization.md>), [GPU](<https://devfeed.tech/topics/gpu.md>), [CUDA](<https://devfeed.tech/topics/cuda.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ans](<https://devfeed.tech/tags/ans.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [compression](<https://devfeed.tech/tags/compression.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-ms](<https://devfeed.tech/tags/cs-ms.md>), [cs-pf](<https://devfeed.tech/tags/cs-pf.md>), [cuda](<https://devfeed.tech/tags/cuda.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [fast](<https://devfeed.tech/tags/fast.md>), [gpus](<https://devfeed.tech/tags/gpus.md>), [matrix](<https://devfeed.tech/tags/matrix.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [speed](<https://devfeed.tech/tags/speed.md>), [times](<https://devfeed.tech/tags/times.md>)

### AI overview

The method applies dtANS, a lossless entropy coding technique designed for parallel GPU decoding, to sparse matrices in CSR format and decodes them alongside sparse matrix-vector multiplication (SpMVM). On SuiteSparse matrices with at least 2^15 entries and an average of at least 10 entries per row, it reduces storage versus the smallest of cuSPARSE's CSR, COO, and SELL formats in almost all cases, by up to 11.77x. For the majority of tested matrices with at least 2^25 nonzero entries, SpMVM is faster, with a best speedup of 3.48x. The reported comparison with AI-based multi-format AlphaSparse is limited by that system's extreme computation overhead. The authors provide open-source C++/CUDA headers with compression and multiplication kernels.

### Source excerpt

arXiv:2603.01915v3 Announce Type: cross Abstract: We present a novel, practical approach to speed up sparse matrix-vector multiplication (SpMVM) on GPUs. The novel key idea is to apply lossless entropy coding to further compress the sparse matrix when stored in one of the commonly supported formats. Our method is based on dtANS, our new lossless compression method that improves the entropy coding technique of asymmetric numeral systems (ANS) specifically for fast parallel GPU decoding when used in tandem with SpMVM. We apply dtANS on the widely used CSR format and present extensive benchmarks on the SuiteSparse collection of matrices against the state-of-the-art cuSPARSE library. On matrices with at least 2^(15) entries and at least 10 entries per row on average, our compression reduces the matrix size over the smallest cuSPARSE format (CSR, COO and SELL) in almost all cases and up to 11.77 times. Further, we achieve an SpMVM speedup for the majority of matrices with at least 2^(25) nonzero entries. The best speedup is 3.48x. We also show that we can improve over the AI-based multi-format AlphaSparse in an experiment that is limited due to its extreme computation overhead. We provide our code as an open source C++/CUDA header library, which includes both compression and multiplication kernels.

## ModelProof: Bit-Exact, Permanently Stored AI Models You Can Verify in a Browser Tab

DevFeed: [ModelProof: Bit-Exact, Permanently Stored AI Models You Can Verify in a Browser Tab](<https://devfeed.tech/articles/modelproof-bit-exact-permanently-stored-ai-models-you-can-verify-in-a-browser-tab-102018.md>)

Original publisher: [Read original article](<https://hackernoon.com/modelproof-bit-exact-permanently-stored-ai-models-you-can-verify-in-a-browser-tab?source=rss>)

Author: ModelProof

Published: 2026-10-26T23:20:25Z

Content type: article

Language: en

Sources: [HackerNoon](<https://devfeed.tech/sources/hackernoon.md>)

Topics: [ML model versioning](<https://devfeed.tech/topics/ml-model-versioning.md>), [AI Models](<https://devfeed.tech/topics/ai-models.md>), [quantization](<https://devfeed.tech/topics/quantization.md>), [Python](<https://devfeed.tech/topics/python.md>), [Web app](<https://devfeed.tech/topics/webapp.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-inference](<https://devfeed.tech/tags/ai-inference.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [ans](<https://devfeed.tech/tags/ans.md>), [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [arweave](<https://devfeed.tech/tags/arweave.md>), [behaviour](<https://devfeed.tech/tags/behaviour.md>), [browser](<https://devfeed.tech/tags/browser.md>), [cli](<https://devfeed.tech/tags/cli.md>), [code](<https://devfeed.tech/tags/code.md>), [content](<https://devfeed.tech/tags/content.md>), [cpus](<https://devfeed.tech/tags/cpus.md>), [csv](<https://devfeed.tech/tags/csv.md>), [decentralize-ai](<https://devfeed.tech/tags/decentralize-ai.md>), [decentralize-ai-hackathon](<https://devfeed.tech/tags/decentralize-ai-hackathon.md>), [decentralized-storage](<https://devfeed.tech/tags/decentralized-storage.md>), [format](<https://devfeed.tech/tags/format.md>), [manifest](<https://devfeed.tech/tags/manifest.md>), [model](<https://devfeed.tech/tags/model.md>), [modelproof](<https://devfeed.tech/tags/modelproof.md>), [models](<https://devfeed.tech/tags/models.md>), [permanent-storage](<https://devfeed.tech/tags/permanent-storage.md>), [publisher](<https://devfeed.tech/tags/publisher.md>), [stored](<https://devfeed.tech/tags/stored.md>), [verifiable-ai](<https://devfeed.tech/tags/verifiable-ai.md>), [verify](<https://devfeed.tech/tags/verify.md>)

### AI overview

ModelProof aims to make a model's published behavior reproducible: its MPW1 format uses int8 weights, int32 biases, integer accumulation, ReLU activations and shift-based requantization so inference outputs are exact across machines. A manifest records the weights' SHA-256 and size, preprocessing rules, metrics and exact test vectors; the weights and manifest are stored on Arweave. Verification fetches the files, checks the weight hash, reruns the vectors and compares output digests, with Python and JavaScript runtimes required to agree. The live browser verifier does this locally without the publisher's server. The demo is a small 4-8-3 Iris network with 100% accuracy on 30 holdout samples before and after int8 quantization; Python verification uses only the standard library, and training is reported to reproduce the weights byte for byte. The approach verifies behavior against the manifest, not the honesty of training data or claimed metrics. Larger models need chunked weights and a Merkle root, which is on the roadmap.

### Source excerpt

An integer-only model format with a content-hashed manifest on Arweave lets anyone prove a model still behaves as its publisher claimed.