# hashing

Hashing is the process of applying a mathematical or cryptographic hash algorithm to data to produce a representative numeric value or hash digest.

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

## Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields

DevFeed: [Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields](<https://devfeed.tech/articles/vectorised-hashing-based-on-bernstein-rabin-winograd-polynomials-over-prime-order-fields-139222.md>)

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

Author: Kaushik Nath, Palash Sarkar

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

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [hashing](<https://devfeed.tech/topics/hashing.md>), [vectorization techniques](<https://devfeed.tech/topics/vectorization-techniques.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>), [primes](<https://devfeed.tech/topics/primes.md>)

Tags: [assembly](<https://devfeed.tech/tags/assembly.md>), [avx2](<https://devfeed.tech/tags/avx2.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [faster](<https://devfeed.tech/tags/faster.md>), [fields](<https://devfeed.tech/tags/fields.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [polynomials](<https://devfeed.tech/tags/polynomials.md>), [prime](<https://devfeed.tech/tags/prime.md>), [simd](<https://devfeed.tech/tags/simd.md>), [speed](<https://devfeed.tech/tags/speed.md>)

### AI overview

decBRWHash is an AXU hash based on Bernstein-Rabin-Winograd polynomials; choosing parameter c greater than 1 enables c-way SIMD implementation. The authors report hand-optimized AVX2 assembly for 4-decBRWHash and, for comparison, polyHash over the prime fields 2^127−1 and 2^130−5. For 2^130−5, their AVX2 4-decBRWHash implementation is faster than Poly1305 on messages of a few hundred bytes, with reported speedups of about 16% for a few kilobytes and 23% for a few megabytes. These are reported implementation results for the stated field and AVX2 setting.

### Source excerpt

arXiv:2507.06490v3 Announce Type: replace Abstract: We introduce the new AXU hash function decBRWHash, which is parameterised by the positive integer $c$ and is based on Bernstein-Rabin-Winograd (BRW) polynomials. Choosing $c>1$ gives a hash function which can be implemented using $c$-way single instruction multiple data (SIMD) instructions. We report a set of very comprehensive hand optimised assembly implementations of 4-decBRWHash using avx2 SIMD instructions available on modern Intel processors. For comparison, we also report similar carefully optimised avx2 assembly implementations of polyHash, an AXU hash function based on usual polynomials. Our implementations are over prime order fields, specifically the primes $2^{127}-1$ and $2^{130}-5$. For the prime $2^{130}-5$, for avx2 implementations, compared to the famous Poly1305 hash function, 4-decBRWHash is faster for messages which are a few hundred bytes long and achieves a speed-up of about 16% for message lengths in a few kilobytes range and improves to a speed-up of about 23% for message lengths in a few megabytes range.

## Probabilistic data structures in Go

DevFeed: [Probabilistic data structures in Go](<https://devfeed.tech/articles/probabilistic-data-structures-in-go-132644.md>)

Original publisher: [Read original article](<https://antonz.org/probabilistic-data-structures/>)

Author: Anton Zhiyanov

Published: 2026-11-13T15:00:00Z

Content type: article

Language: en

Sources: [Anton Zhiyanov](<https://devfeed.tech/sources/anton-zhiyanov.md>)

Topics: [Data structures](<https://devfeed.tech/topics/data-structures.md>), [bloom-filter](<https://devfeed.tech/topics/bloom-filter.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [CPU Cache](<https://devfeed.tech/topics/cpu-cache.md>), [Cache](<https://devfeed.tech/topics/cache.md>), [rate-limiting](<https://devfeed.tech/topics/rate-limiting.md>)

Tags: [bloom-filter](<https://devfeed.tech/tags/bloom-filter.md>), [count-min-sketch](<https://devfeed.tech/tags/count-min-sketch.md>), [data-structures](<https://devfeed.tech/tags/data-structures.md>), [go](<https://devfeed.tech/tags/go.md>), [hyperloglog](<https://devfeed.tech/tags/hyperloglog.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>), [probabilistic-data-structures](<https://devfeed.tech/tags/probabilistic-data-structures.md>), [t-digest](<https://devfeed.tech/tags/t-digest.md>), [top-k](<https://devfeed.tech/tags/top-k.md>)

### AI overview

The Go package `nalgeon/unsure` implements five approximate structures that trade exact answers for lower memory use: Bloom filters test possible set membership (false positives, no deletion); count-min sketches estimate frequencies with possible overcounts; HyperLogLog estimates distinct-item counts; t-digests estimate quantiles and CDFs; and top-k sketches report frequent items with approximate counts. The article describes `unsure`'s cache-blocked Bloom filter, conservative count-min updates, histogram-based HyperLogLog estimator, merging t-digest, and two-row HeavyKeeper-style top-k design. It gives examples of workloads and limits, including that t-digest merges lose accuracy, top-k works best on skewed streams, and HyperLogLog's sparse-count comparison favors `axiom`. Reported benchmarks show `unsure` often faster or smaller than named Go implementations, though the advantage varies by operation and data distribution; these are excerpts from full benchmarks.

### Source excerpt

Bloom filter, count-min sketch, HyperLogLog, t-digest, and top-k sketch.

## The Decomposition Is the Fingerprint: Per-Component Identity for Agent Skills

DevFeed: [The Decomposition Is the Fingerprint: Per-Component Identity for Agent Skills](<https://devfeed.tech/articles/the-decomposition-is-the-fingerprint-per-component-identity-for-agent-skills-133260.md>)

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

Author: Hongliang Liu, Yuhao Wu, Tung-Ling Li

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

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Agent Skills](<https://devfeed.tech/topics/agent-skills.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [trust](<https://devfeed.tech/topics/trust.md>)

Tags: [agent-skills](<https://devfeed.tech/tags/agent-skills.md>), [classification](<https://devfeed.tech/tags/classification.md>), [code](<https://devfeed.tech/tags/code.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [family](<https://devfeed.tech/tags/family.md>), [fingerprint](<https://devfeed.tech/tags/fingerprint.md>), [identity](<https://devfeed.tech/tags/identity.md>), [locality](<https://devfeed.tech/tags/locality.md>), [refactoring](<https://devfeed.tech/tags/refactoring.md>), [registry](<https://devfeed.tech/tags/registry.md>), [reuse](<https://devfeed.tech/tags/reuse.md>), [roc](<https://devfeed.tech/tags/roc.md>), [runtime](<https://devfeed.tech/tags/runtime.md>), [safety](<https://devfeed.tech/tags/safety.md>), [signal](<https://devfeed.tech/tags/signal.md>), [simhash](<https://devfeed.tech/tags/simhash.md>), [skills](<https://devfeed.tech/tags/skills.md>), [split](<https://devfeed.tech/tags/split.md>)

### AI overview

The paper proposes a 120-byte, per-component fingerprint for agent skills, representing prompt, code, and tool declarations separately with multi-bank SimHash and comparing signatures by Hamming distance. Keeping the components separate supports skill-family matching across paraphrase, renaming, refactoring, or controlled code translation when another component remains shared, and helps locate reuse or changes; independent multilingual reimplementations are not recovered. The method reports AUC 0.974 (95% CI 0.956-0.994) across 4,950 pairwise comparisons using 77 times fewer bits than the approximated embedding. On a 906-skill injection benchmark it identifies injected skills as altered copies of a known base and localizes changes. The authors frame this as lineage and registry identity, not behavioral equivalence or a safety verdict; behavioral verification remains necessary.

### Source excerpt

arXiv:2606.31272v2 Announce Type: replace Abstract: AI agents increasingly acquire and execute skills at runtime: bundles of prompt instructions, executable code, and tool declarations fetched from marketplaces and other agents. Governing them needs a stable notion of skill identity, yet cryptographic hashing is engineered to destroy the very similarity we need, as a one-character edit scrambles the digest. We present a compact, locality-sensitive fingerprint that embeds each component of a skill and projects it to bits with a multi-bank SimHash, giving a fixed 120-byte signature compared in constant time by Hamming distance. Our central claim is that keeping the fingerprint as a per-component triple (prompt, code, tools), rather than a single score, is what makes it useful: the triple recovers skill-family identity through paraphrase, renaming, refactoring, and controlled code translation when another component remains shared, while independent multilingual reimplementation is not recovered; it also localizes which component carries the reuse. We claim lineage, not behavioral equivalence: identity supplies the structural axis of a registry and leaves safety to behavioral verification. The fingerprint reaches an area under the ROC curve (AUC) of 0.974 (95% CI [0.956, 0.994]) over 4,950 pairwise comparisons while using 77x fewer bits than the embedding it approximates, with ranking preserved in expectation and finite-bit concentration; the per-component split turns one number into relationship classification, families, novelty, and a portable "SkillBOM" for a skill registry. On a 906-skill injection benchmark the fingerprint recognizes injected skills as tampered copies of a known base and localizes the change, but recognition is not trust: it remains, by design, an identity signal complementary to behavioral verification rather than a safety verdict.

## Pointing the Way, Hiding the Destination: Practical Private Dense Retrieval at Scale

DevFeed: [Pointing the Way, Hiding the Destination: Practical Private Dense Retrieval at Scale](<https://devfeed.tech/articles/pointing-the-way-hiding-the-destination-practical-private-dense-retrieval-at-scale-131963.md>)

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

Author: Peichun Hua, Danyang Chen, Junan Zhang, Haifeng Sun, Jingyu Wang, Diwen Xue, Mingyu Li, Yunming Xiao

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

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [information retrieval](<https://devfeed.tech/topics/information-retrieval.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [AI-driven information retrieval](<https://devfeed.tech/topics/ai-driven-information-retrieval.md>), [Vectors & LLMs](<https://devfeed.tech/topics/vectors-llms.md>), [hashing](<https://devfeed.tech/topics/hashing.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [can](<https://devfeed.tech/tags/can.md>), [candidate](<https://devfeed.tech/tags/candidate.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptographic](<https://devfeed.tech/tags/cryptographic.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deep](<https://devfeed.tech/tags/deep.md>), [differential-privacy](<https://devfeed.tech/tags/differential-privacy.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [either](<https://devfeed.tech/tags/either.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [encrypted](<https://devfeed.tech/tags/encrypted.md>), [existing](<https://devfeed.tech/tags/existing.md>), [filter](<https://devfeed.tech/tags/filter.md>), [practical](<https://devfeed.tech/tags/practical.md>), [private](<https://devfeed.tech/tags/private.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [scale](<https://devfeed.tech/tags/scale.md>)

### AI overview

The paper uses learned deep hashing to make private dense retrieval more efficient: a randomized binary code selects a short candidate list, then encrypted reranking and oblivious key transfer protect the query and final selection. Across five zero-shot corpora of 25K to 5.4M documents, lists of 200-500 candidates closely match full-corpus retrieval. On 2.68M NQ passages over a 10-Gbps link, the protocol adds 0.38 seconds (6.5%) to a 128-token Qwen3-32B RAG pipeline. The released code satisfies directional metric differential privacy and substantially reduces embedding-inversion and property-inference leakage.

### Source excerpt

arXiv:2608.25735v3 Announce Type: replace-cross Abstract: Hosted retrieval-augmented generation (RAG) and semantic search allow users to query valuable provider-held corpora, raising two competing demands: to hide each query and chosen result, yet reveal only the documents that the user is authorized to receive. Existing cryptographic approaches either make this costly by processing the entire corpus for every query, or sacrifice quality for efficiency by scanning a few clusters. We repurpose learned deep hashing as a private filter: a randomized binary code points the provider to a short candidate list, while encrypted reranking and oblivious key transfer protect the precise query and final selection. This shortlist short-circuits full-corpus cryptographic search without sacrificing retrieval quality: with 200-500 candidates, it closely matches full-corpus retrieval across five zero-shot corpora spanning 25K to 5.4M documents. On the full 2.68M-passage NQ corpus over a 10-Gbps link, our protocol only adds 0.38 seconds, or 6.5%, to a 128-token Qwen3-32B RAG pipeline. The released code satisfies directional metric differential privacy (DP) and substantially reduces embedding-inversion and property-inference leakage, demonstrating that a carefully learned shortlist can make private dense retrieval both accurate and practical.

## QUASI: Post-Quantum Quorum Attestation of Pre-Validated Statements

DevFeed: [QUASI: Post-Quantum Quorum Attestation of Pre-Validated Statements](<https://devfeed.tech/articles/quasi-post-quantum-quorum-attestation-of-pre-validated-statements-126926.md>)

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

Author: Maksym Ioffe, Dahlia Malkhi

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

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [Post-quantum cryptography](<https://devfeed.tech/topics/post-quantum-cryptography.md>)

Tags: [aggregation](<https://devfeed.tech/tags/aggregation.md>), [applications](<https://devfeed.tech/tags/applications.md>), [attestation](<https://devfeed.tech/tags/attestation.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [generic](<https://devfeed.tech/tags/generic.md>), [hash](<https://devfeed.tech/tags/hash.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [post-quantum](<https://devfeed.tech/tags/post-quantum.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [quorum](<https://devfeed.tech/tags/quorum.md>), [statement](<https://devfeed.tech/tags/statement.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

QUASI lets a quorum publicly attest that a pre-validated statement is valid without requiring every party to authenticate the entire statement: each party authenticates only a small subset of symbols. The protocols use hashing and error correction, without SNARKs for aggregation. The abstract reports that its randomized construction reduces per-party contribution size and hash computations for generation and verification by more than 10x compared with full hash-based signatures. Proposed uses include external attestation for signature-free consensus and preprocessing before SNARK-based aggregation. The supplied text does not detail the constructions or evaluation.

### Source excerpt

arXiv:2611.10403v1 Announce Type: new Abstract: We present QUASI, a newly conceived class of protocols that enable a group of parties to produce a publicly verifiable attestation about a pre-validated statement. Designed for quorum-based systems, QUASI enables parties to attest to external entities that the statement is valid. Surprisingly, each party need not sign the entire statement: authenticating only a small subset of symbols suffices for the quorum to attest to the whole. A simple deterministic construction illustrates this possibility. Built purely from hashing and error correction, QUASI achieves small per-party contributions and low attestation generation and verification costs, without relying on SNARKs for aggregation. Our main contribution is a randomized construction achieving reductions of more than $10\times$ in per-party contribution size and hash computations for generation and verification, compared with full hash-based signatures. QUASI is a generic primitive supporting diverse applications. Two principal use cases are external attestation for signature-free consensus, enabling clients to verify statements about committed state; and preprocessing for SNARK-based aggregation, compounding QUASI's savings with succinct-proof compression.

## Provenance Verification of AI-Generated Images via a Perceptual Hash Registry Using Merkle Patricia Trie and BK-Tree

DevFeed: [Provenance Verification of AI-Generated Images via a Perceptual Hash Registry Using Merkle Patricia Trie and BK-Tree](<https://devfeed.tech/articles/provenance-verification-of-ai-generated-images-via-a-perceptual-hash-registry-using-merkle-patricia-trie-and-bk-tree-126875.md>)

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

Author: Apoorv Mohit, Bhavya Aggarwal, Chinmay Gondhalekar

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

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Perceptual hashing](<https://devfeed.tech/topics/perceptual-hashing.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Generative AI](<https://devfeed.tech/topics/generative-ai.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [Image](<https://devfeed.tech/topics/image.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-generated-images](<https://devfeed.tech/tags/ai-generated-images.md>), [bk-tree](<https://devfeed.tech/tags/bk-tree.md>), [content-authenticity](<https://devfeed.tech/tags/content-authenticity.md>), [cryptographic](<https://devfeed.tech/tags/cryptographic.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-cy](<https://devfeed.tech/tags/cs-cy.md>), [detection](<https://devfeed.tech/tags/detection.md>), [digital](<https://devfeed.tech/tags/digital.md>), [digital-platforms](<https://devfeed.tech/tags/digital-platforms.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [fingerprint](<https://devfeed.tech/tags/fingerprint.md>), [hash](<https://devfeed.tech/tags/hash.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [merkle-patricia-trie](<https://devfeed.tech/tags/merkle-patricia-trie.md>), [provenance](<https://devfeed.tech/tags/provenance.md>), [registry](<https://devfeed.tech/tags/registry.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [system](<https://devfeed.tech/tags/system.md>), [verification](<https://devfeed.tech/tags/verification.md>), [watermarking](<https://devfeed.tech/tags/watermarking.md>)

### AI overview

The paper proposes verifying the provenance of AI-generated images that participating platforms register at creation time. Each image receives a perceptual-hash fingerprint; a Merkle Patricia Trie organizes the registry and provides cryptographic integrity, while a BK-tree searches for similar fingerprints by Hamming distance. When an image is re-uploaded, this can help identify registered content after benign transformations or partial modifications. The approach is limited to registered images, so it does not aim to detect all synthetic images; the authors position it as a complement to watermarking and learning-based detection.

### Source excerpt

arXiv:2602.02412v2 Announce Type: replace Abstract: The rapid advancement of artificial intelligence has made the generation of synthetic images widely accessible, increasing concerns related to misinformation, digital forgery, and content authenticity on large-scale online platforms. This paper proposes a registry-based framework for verifying AI-generated images through a registry-based provenance mechanism. Each AI-generated image is assigned a digital fingerprint that preserves similarity using perceptual hashing and is registered at creation time by participating generation platforms. The Merkle Patricia Trie, provides prefix-based organization and cryptographic integrity of the registry structure, while Burkhard-Keller tree enable similarity search based on Hamming distance. Verification is performed when images are re-uploaded to digital platforms such as social media services, enabling identification of previously registered AI-generated images even after benign transformations or partial modifications. The proposed system does not aim to universally detect all synthetic images, but instead focuses on verifying the provenance of AI-generated content that has been registered at creation time. By design, this approach complements existing watermarking and learning-based detection methods, providing a platform-agnostic, tamper-evident mechanism for scalable content provenance and verification at the point of large scale online distribution.

## A Post-Quantum Interactive Hashing Theorem

DevFeed: [A Post-Quantum Interactive Hashing Theorem](<https://devfeed.tech/articles/a-post-quantum-interactive-hashing-theorem-118701.md>)

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

Author: C\\'eline Chevalier, Laurent Holin, Quoc-Huy Vu

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

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Post-quantum cryptography](<https://devfeed.tech/topics/post-quantum-cryptography.md>), [Zero-knowledge proof](<https://devfeed.tech/topics/zkp.md>), [hashing](<https://devfeed.tech/topics/hashing.md>)

Tags: [cryptographic](<https://devfeed.tech/tags/cryptographic.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [np](<https://devfeed.tech/tags/np.md>), [one-way-functions](<https://devfeed.tech/tags/one-way-functions.md>), [permutations](<https://devfeed.tech/tags/permutations.md>), [post-quantum](<https://devfeed.tech/tags/post-quantum.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum-security](<https://devfeed.tech/tags/quantum-security.md>), [security](<https://devfeed.tech/tags/security.md>), [zero-knowledge](<https://devfeed.tech/tags/zero-knowledge.md>)

### AI overview

The note gives a post-quantum security proof for the multi-output interactive hashing protocol with arbitrary relations. Interactive hashing is used in cryptographic protocols, and its multi-output generalization is a key ingredient in constructions of statistical zero-knowledge arguments for NP and statistically hiding commitments from arbitrary one-way functions. The supplied excerpt does not describe the proof or its assumptions in detail.

### Source excerpt

arXiv:2611.06124v1 Announce Type: cross Abstract: Interactive hashing, introduced by Ostrovsky, Venkatesan, and Yung [OVY93], is a building block in many cryptographic protocols, including perfectly hiding commitments from one-way permutations [NOVY92]. Its multi-output generalization is a key ingredient in constructions of statistical zero-knowledge arguments for NP and statistically hiding commitments from arbitrary one-way functions [NOV06,HR07]. In this note, we give a post-quantum security proof for this multi-output interactive hashing protocol with arbitrary relations.

## Poly Versus Polyval

DevFeed: [Poly Versus Polyval](<https://devfeed.tech/articles/poly-versus-polyval-111225.md>)

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

Author: Kaushik Nath, Palash Sarkar

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

Content type: comparison

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [hashing](<https://devfeed.tech/topics/hashing.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [assembly](<https://devfeed.tech/tags/assembly.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [hash](<https://devfeed.tech/tags/hash.md>), [nist](<https://devfeed.tech/tags/nist.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [results](<https://devfeed.tech/tags/results.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>)

### AI overview

Poly and Polyval evaluate polynomial hashes over binary extension fields, but use different reduction methods: Poly uses usual reduction, while Polyval uses Montgomery reduction. The authors identify field representations that make each reduction efficient, give algorithms with correctness proofs, and report optimized assembly implementations for n=128, 256, and 512. Their analysis and timings find Polyval faster at n=128, whereas Poly is faster at n=256 and 512 and at higher values. The excerpt also says Poly avoids GHASH's per-block bit reversals and is consequently faster than GHASH.

### Source excerpt

arXiv:2610.41565v1 Announce Type: new Abstract: We revisit the basic construction of polynomial evaluation based hash function, which we call Poly, over binary extension fields over $GF(2^n)$, where $n=64k$ and $k\geq 2$. Unlike GHASH, the NIST standard polynomial evaluation based hash function for $n=128$, Poly does not perform the unnecessary bit reversals of each $n$-bit block, and consequently is faster than GHASH. Further, Poly differs from Polyval, -- a faster alternative to GHASH, -- in that Poly performs usual reduction, while Polyval performs Montgomery reduction. We identify suitable choices of the field representing irreducible polynomials which makes usual and Montgomery reductions efficient. We provide detailed algorithms, and associated proofs of correctness for both kinds of reductions. Based on the algorithms, we report carefully optimised assembly implementation of both Poly and Polyval for $n=128,256$ and $512$. Our theoretical analysis and experimental timing results show that for $n=128$, Polyval is faster than Poly, while for $n=256$ and $512$ (as well as for higher values of $n$), Poly is faster than Polyval. The cases $n=128$ and $256$ are of current relevance due to the ongoing NIST process for developing cryptographic accordions.

## CVE-2026-120317 - http4k 4.9.10.0 before 6.60.0.0 Digest auth-int Missing Body Integrity

DevFeed: [CVE-2026-120317 - http4k 4.9.10.0 before 6.60.0.0 Digest auth-int Missing Body Integrity](<https://devfeed.tech/articles/cve-2026-120317-http4k-4-9-10-0-before-6-60-0-0-digest-auth-int-missing-body-integrity-111048.md>)

Original publisher: [Read original article](<https://cvefeed.io/vuln/detail/CVE-2026-120317>)

Author: CVEFEED.io; vulncheck.com

Published: 2026-11-02T03:17:29Z

Content type: news

Language: en

Sources: [Latest High/Critical Vulnerabilitiy Feed](<https://devfeed.tech/sources/latest-high-critical-vulnerabilitiy-feed.md>)

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

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [actions](<https://devfeed.tech/tags/actions.md>), [auth](<https://devfeed.tech/tags/auth.md>), [authorization](<https://devfeed.tech/tags/authorization.md>), [body](<https://devfeed.tech/tags/body.md>), [cve](<https://devfeed.tech/tags/cve.md>), [cve-2026-120317](<https://devfeed.tech/tags/cve-2026-120317.md>), [digest](<https://devfeed.tech/tags/digest.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [header](<https://devfeed.tech/tags/header.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [request](<https://devfeed.tech/tags/request.md>), [rewrite](<https://devfeed.tech/tags/rewrite.md>), [state](<https://devfeed.tech/tags/state.md>), [tls](<https://devfeed.tech/tags/tls.md>), [vulnerability](<https://devfeed.tech/tags/vulnerability.md>)

### AI overview

http4k versions 4.9.10.0 up to but not including 6.60.0.0 have a missing integrity check in DigestEncoder: the auth-int digest is computed without hashing the request body. On non-TLS channels, an on-path attacker can alter an authenticated request body while leaving its Authorization header valid, potentially performing state-changing actions as the victim.

### Source excerpt

CVE ID :CVE-2026-120317 Published : Nov. 2, 2026, 3:17 a.m. | 32 minutes ago Description :http4k from 4.9.10.0 before 6.60.0.0 contains a missing integrity check vulnerability because DigestEncoder computes the auth-int digest without hashing the request entity body. On-path attackers on non-TLS channels can rewrite the body of authenticated requests while keeping the Authorization header valid, executing state-changing actions as the victim. Severity: 8.2 | HIGH Visit the link for more details, such as CVSS details, affected products, timeline, and more...

## RecHash: Segmented Hash-Entangled Chains for Stateful Sequential Authentication

DevFeed: [RecHash: Segmented Hash-Entangled Chains for Stateful Sequential Authentication](<https://devfeed.tech/articles/rechash-segmented-hash-entangled-chains-for-stateful-sequential-authentication-109092.md>)

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

Author: Luis Adri\\'an Lizama-P\\'erez

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Authentication](<https://devfeed.tech/topics/authentication.md>), [Stateful](<https://devfeed.tech/topics/stateful.md>), [hashing](<https://devfeed.tech/topics/hashing.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [construction](<https://devfeed.tech/tags/construction.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [digest](<https://devfeed.tech/tags/digest.md>), [hash](<https://devfeed.tech/tags/hash.md>), [records](<https://devfeed.tech/tags/records.md>), [security](<https://devfeed.tech/tags/security.md>), [stateful](<https://devfeed.tech/tags/stateful.md>)

### AI overview

RecHash authenticates records sequentially using paired hash-chain openings and an authenticated record history. It assigns each record to a predetermined chain segment, encoding digest blocks through complementary positions so every digest fits its scheduled slot regardless of earlier messages. For an ℓ-bit digest across k equal-length chain pairs, balanced allocation yields ⌊L/(2^⌈ℓ/k⌉+1)⌋ slots. The stated example uses a 256-bit digest, 32 pairs and chain length 65535 to support 254 application records followed by a renewal certificate, with 2048 bytes of openings per record for 256-bit chain outputs. The work gives a renewal-free security-composition theorem conditional on authenticated history and an adaptive one-step guarantee; it leaves a concrete post-quantum reduction and security across renewal open.

### Source excerpt

arXiv:2610.40507v1 Announce Type: new Abstract: RecHash is a stateful sequential authentication construction based on paired hash-chain openings and an authenticated record history. It develops the decreasing position relation of the 2019 hash-entangled construction, whose exact integer normalization yields a two-coordinate constant-sum antichain. Direct proportional reuse is constrained by integer capacity and multiplicative contraction. The main construction instead assigns each record to a predetermined chain segment, with complementary positions encoding each digest block. All digests fit every scheduled slot, independently of preceding messages. For an $\ell$-bit digest distributed over $k$ equal-length chain pairs, balanced allocation gives $\lfloor L/(2^{\lceil\ell/k\rceil}+1)\rfloor$ slots. A 256-bit digest, 32 pairs, and length 65535 provide 254 application records followed by a renewal certificate, with 2048 bytes of openings per record for 256-bit chain outputs. We give a complete segmented state transition, a worked trace, exact allocation and resource results, and a renewal-free security-composition theorem conditional on authenticated history and an adaptive one-step guarantee. The analysis relates the construction to constant-sum encodings and standardized hash-based signatures; a concrete post-quantum reduction and security across renewal remain open.

## Apache Iceberg Write Distribution Modes: None, Hash, Range, and File Sizing

DevFeed: [Apache Iceberg Write Distribution Modes: None, Hash, Range, and File Sizing](<https://devfeed.tech/articles/apache-iceberg-write-distribution-modes-none-hash-range-and-file-sizing-102843.md>)

Original publisher: [Read original article](<https://www.dremio.com/blog/apache-iceberg-write-distribution-modes-none-hash-range-and-file-sizing/>)

Author: Alex Merced

Published: 2026-10-27T18:56:55Z

Content type: article

Language: en

Sources: [Dremio](<https://devfeed.tech/sources/dremio.md>)

Topics: [Apache Iceberg](<https://devfeed.tech/topics/apache-iceberg.md>), [Apache Spark](<https://devfeed.tech/topics/spark.md>), [hashing](<https://devfeed.tech/topics/hashing.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [apache-iceberg](<https://devfeed.tech/tags/apache-iceberg.md>), [apache-spark](<https://devfeed.tech/tags/apache-spark.md>), [data-lakehouse](<https://devfeed.tech/tags/data-lakehouse.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [dremio-blog-open-data-insights](<https://devfeed.tech/tags/dremio-blog-open-data-insights.md>), [execution](<https://devfeed.tech/tags/execution.md>), [file](<https://devfeed.tech/tags/file.md>), [hash](<https://devfeed.tech/tags/hash.md>), [iceberg](<https://devfeed.tech/tags/iceberg.md>), [none](<https://devfeed.tech/tags/none.md>), [range](<https://devfeed.tech/tags/range.md>), [spark](<https://devfeed.tech/tags/spark.md>), [target](<https://devfeed.tech/tags/target.md>), [write](<https://devfeed.tech/tags/write.md>)

### AI overview

Iceberg write distribution controls how Spark groups rows before creating files: none adds no grouping, hash shuffles by partition columns, and range globally orders by partition and sort keys. Hash is a practical starting point for partitioned tables; none suits inputs already laid out for writing; range can improve clustering and pruning when sort keys match common queries, at the cost of extra planning, memory, and job time. The target file size is an estimate rather than a guarantee: task input, skew, and compression affect actual file sizes. The article recommends testing modes on representative data, tuning Spark shuffle partitions and adaptive execution, and checking file counts and size percentiles plus representative read performance. Verify property names and CTAS behavior for the deployed Spark and Iceberg versions.

### Source excerpt

Choose Iceberg write distribution mode none, hash, or range, then tune Spark adaptive execution and target file sizes for balanced, efficient writes. The post Apache Iceberg Write Distribution Modes: None, Hash, Range, and File Sizing appeared first on Dremio.

## Cloudflare Reclaims 100 TB of RAM by Optimizing Consistent Hashing

DevFeed: [Cloudflare Reclaims 100 TB of RAM by Optimizing Consistent Hashing](<https://devfeed.tech/articles/cloudflare-reclaims-100-tb-of-ram-by-optimizing-consistent-hashing-98701.md>)

Original publisher: [Read original article](<https://www.infoq.com/news/2026/10/cloudflare-hashing-optimization/>)

Author: Renato Losio

Published: 2026-10-24T08:10:00Z

Content type: news

Language: en

Sources: [InfoQ](<https://devfeed.tech/sources/infoq.md>)

Topics: [hashing](<https://devfeed.tech/topics/hashing.md>), [Load Balancing](<https://devfeed.tech/topics/load-balancing.md>), [performance-engineering](<https://devfeed.tech/topics/performance-engineering.md>), [Cloudflare](<https://devfeed.tech/topics/cloudflare.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [architecture-design](<https://devfeed.tech/tags/architecture-design.md>), [cloudflare](<https://devfeed.tech/tags/cloudflare.md>), [cloudflare-hashing-optimization](<https://devfeed.tech/tags/cloudflare-hashing-optimization.md>), [consistent-hashing](<https://devfeed.tech/tags/consistent-hashing.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [data-structures](<https://devfeed.tech/tags/data-structures.md>), [development](<https://devfeed.tech/tags/development.md>), [devops](<https://devfeed.tech/tags/devops.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [infrastructure-optimisation](<https://devfeed.tech/tags/infrastructure-optimisation.md>), [load-balancing](<https://devfeed.tech/tags/load-balancing.md>), [memory](<https://devfeed.tech/tags/memory.md>), [memory-optimization](<https://devfeed.tech/tags/memory-optimization.md>), [news](<https://devfeed.tech/tags/news.md>), [performance-tuning](<https://devfeed.tech/tags/performance-tuning.md>), [pingora](<https://devfeed.tech/tags/pingora.md>), [rust](<https://devfeed.tech/tags/rust.md>)

### AI overview

Cloudflare reduced its load-balancing service's memory footprint by more than 100 TB by optimizing consistent hashing in pingora-ketama while preserving the required load distribution. Probability analysis showed that many hash points yielded diminishing accuracy gains and that collisions among 32-bit points added distribution error; this let the team cut hashes per server by about 90%. It also compacted each stored `Point` from 8 bytes to 6 by representing the hash and server index more tightly. Because changing the ring could redirect cacheable requests and invalidate cached content, Cloudflare rolled out the new implementation gradually alongside the existing ring to limit cache churn and origin traffic spikes.

### Source excerpt

Cloudflare recently documented how it reduced the memory footprint of its internal load-balancing service by more than 100 TB by optimizing the Rust implementation of consistent hashing in pingora-ketama. The changes compacted hash-ring entries and used statistical analysis of hash distribution and collision rates to reduce the number of hashes per backend by about 90%. By Renato Losio

## Writing is no longer proof of work

DevFeed: [Writing is no longer proof of work](<https://devfeed.tech/articles/writing-is-no-longer-proof-of-work-89648.md>)

Original publisher: [Read original article](<https://seangoedecke.com/writing-is-no-longer-proof-of-work/>)

Published: 2026-10-18T00:00:00Z

Content type: opinion

Language: en

Sources: [Sean Goedecke](<https://devfeed.tech/sources/seangoedecke-com-rss-feed.md>)

Topics: [proof of work](<https://devfeed.tech/topics/proof-of-work.md>), [hashing](<https://devfeed.tech/topics/hashing.md>)

Tags: [bitcoin](<https://devfeed.tech/tags/bitcoin.md>), [communication](<https://devfeed.tech/tags/communication.md>), [company](<https://devfeed.tech/tags/company.md>), [compliance](<https://devfeed.tech/tags/compliance.md>), [effort](<https://devfeed.tech/tags/effort.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [impact](<https://devfeed.tech/tags/impact.md>), [incident](<https://devfeed.tech/tags/incident.md>), [llms](<https://devfeed.tech/tags/llms.md>), [mandatory](<https://devfeed.tech/tags/mandatory.md>), [process](<https://devfeed.tech/tags/process.md>), [processes](<https://devfeed.tech/tags/processes.md>), [project](<https://devfeed.tech/tags/project.md>), [proof-of-work](<https://devfeed.tech/tags/proof-of-work.md>), [reports](<https://devfeed.tech/tags/reports.md>), [risk](<https://devfeed.tech/tags/risk.md>), [rules](<https://devfeed.tech/tags/rules.md>), [work](<https://devfeed.tech/tags/work.md>), [writing](<https://devfeed.tech/tags/writing.md>)

### AI overview

The excerpt argues that workplace writing often serves as proof of compliance, effort, or understanding rather than communication. LLMs undermine that role: they can produce plausible forms and lengthy reports without the underlying work or learning. Organizations may try harder-to-forge evidence such as live presentations, ban AI-written work (with enforcement challenges), or ask LLMs to judge effort from code; the author sees no easy fix and expects an unsettled transition. The practical advice is to avoid spending time on documents whose only purpose is evidentiary, and reserve effort for writing meant to communicate.

### Source excerpt

Tech companies structurally depend on writing to serve as evidence, in the same way that Bitcoin depends on proof-of-work hashing. However, in the last few years, LLMs have started to undermine this practice. How can writing be like proof-of-work? When I'm writing something at work, it's not always to communicate an idea. Sometimes it's because having a piece of writing is useful as evidence: of compliance with some process, of the fact that I put in effort, or of the fact that I know about some topic. Here are some examples. Writing as evidence of compliance The most obvious instance of writing as evidence is filling out mandatory templates: "risk assessments", "impact evaluations", and so on. The purpose of these is rarely to assess risk or evaluate impact. It's some combination of: Employees wanting to demonstrate that they're taking some incident seriously by introducing new process A legal requirement that companies have developed the least-expensive way to technically satisfy Internal company rules intending to scare lazy or uncommitted engineers away from making dangerous changes Smaller companies trying to role-play processes from larger companies that are doing one of the above It's a mistake to buckle down and produce an excellent piece of writing here. You simply need to dash off something plausible enough to tick the box. Writing as evidence of effort In the kinds of hundred-page reports produced by consultants, writing is evidence of effort. The actual piece of communication is the first page of text (or often not even that). The remaining ninety-nine pages are proof that the first page is well-researched, and that the money spent on hiring the consultancy wasn't wasted. Another example: if you're working on a project by yourself, why spend time creating tickets and filling them out? I suppose theoretically someone could read them to get a sense of what you're doing, but in that case you've failed to communicate the project via normal channels: telling

## Length Extension Attacks: How Hash-Based Signatures Can Be Forged

DevFeed: [Length Extension Attacks: How Hash-Based Signatures Can Be Forged](<https://devfeed.tech/articles/length-extension-attacks-how-hash-based-signatures-can-be-forged-84159.md>)

Original publisher: [Read original article](<https://hackernoon.com/length-extension-attacks-how-hash-based-signatures-can-be-forged?source=rss>)

Author: viodex

Published: 2026-10-09T08:38:27Z

Content type: tutorial

Language: en

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

Topics: [hashing](<https://devfeed.tech/topics/hashing.md>), [Cybersecurity](<https://devfeed.tech/topics/cybersecurity.md>)

Tags: [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cybersecurity](<https://devfeed.tech/tags/cybersecurity.md>), [hash-padding-vulnerability](<https://devfeed.tech/tags/hash-padding-vulnerability.md>), [hashes-vulnerabilities](<https://devfeed.tech/tags/hashes-vulnerabilities.md>), [keyed-hash-authentication](<https://devfeed.tech/tags/keyed-hash-authentication.md>), [length-extension-attack](<https://devfeed.tech/tags/length-extension-attack.md>), [length-extension-attacks](<https://devfeed.tech/tags/length-extension-attacks.md>), [md5-hash-security](<https://devfeed.tech/tags/md5-hash-security.md>), [padding](<https://devfeed.tech/tags/padding.md>)

### AI overview

The tutorial explains length extension attacks against secret-prefixed MD5 hashes through message padding, internal state, and worked examples. It describes using an original message, its digest, and a known or guessed secret length to append data and generate a valid signature without recovering the secret. It also demonstrates hash_extender and explains that practical impact depends on signature construction and application behavior.

### Source excerpt

Learn how Length Extension Attacks work by exploring MD5 internals, message padding, internal states, and how attackers can extend signed data without knowing t

## SequenceHash: multihashing for the rest of us

DevFeed: [SequenceHash: multihashing for the rest of us](<https://devfeed.tech/articles/sequencehash-multihashing-for-the-rest-of-us-64138.md>)

Original publisher: [Read original article](<https://blog.trailofbits.com/2026/10/02/sequencehash-multihashing-for-the-rest-of-us/>)

Author: "Opal Wright"

Published: 2026-10-02T11:00:00Z

Content type: article

Language: en

Sources: [The Trail of Bits Blog](<https://devfeed.tech/sources/the-trail-of-bits-blog-2.md>), [Trail of Bits](<https://devfeed.tech/sources/the-trail-of-bits-blog.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [Memory Safety](<https://devfeed.tech/topics/memory-safety.md>)

Tags: [cryptography](<https://devfeed.tech/tags/cryptography.md>), [go](<https://devfeed.tech/tags/go.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [python](<https://devfeed.tech/tags/python.md>), [rust](<https://devfeed.tech/tags/rust.md>), [security](<https://devfeed.tech/tags/security.md>), [sha256](<https://devfeed.tech/tags/sha256.md>), [zero-knowledge](<https://devfeed.tech/tags/zero-knowledge.md>)

### AI overview

Trail of Bits introduces SequenceHash and SequenceMAC, hash-agnostic constructions for securely hashing multiple inputs without ambiguous encodings. The article describes their length-extension protections, customization strings, implementations in Rust, Go, and Python, and test vectors. The specification is part of C2SP. It notes that security depends on the underlying hash and that an XOF variant has not yet been specified.

### Source excerpt

Multihashing is one of those cryptographic tasks that's easy not to think about too much. This is unfortunate, because multihashing is a common stumbling point when cryptographers try to use hashes. As part of our goal to "fix software, not bugs," Trail of Bits is introducing SequenceHash and its sister function SequenceMAC, a pair of related hash constructions that bring secure multihashing to developers using hash functions other than Keccak. We hope SequenceHash and SequenceMAC will help cryptographers avoid attacks that take advantage of ambiguous input encodings. The specification is open source, and is now a part of the Community Cryptography Specification Project (C2SP). SequenceHash and SequenceMAC behave similarly to NIST's TupleHash, but have the advantage of not being tied to a single hash function. They also don't require developers to implement fiddly computations that aren't byte-aligned. Instead, SequenceHash and SequenceMAC work out of the box with nearly any secure cryptographic hash function you care to use, including SHA256/384/512, BLAKE, and RIPEMD. SequenceMAC supports keys 32 bytes or longer (up to the ridiculous limit of ${2}^{128}-1$ bytes). (It's worth noting: SequenceHash and SequenceMAC rely on the security of the underlying hash for their own security. SequenceHash and SequenceMAC can't magically make MD4 or SHA0 secure again. For the purposes of this document, it's assumed that you have chosen a reasonable hash function like SHA256, not CRC32.) To make SequenceHash and SequenceMAC easy to use, we're releasing three initial implementations of SequenceHash and SequenceMAC: one each in Rust, Go, and Python. We're also releasing a large set of test vectors that cover multiple hash functions and include intermediate values to help developers debug and verify their implementations. Wait, "multihashing"? Yeah, it's a weird term, but the idea is pretty simple. "Multihashing" means "hashing a bunch of values together." If you've ever read a cryp

## Cryptography Essentials for Node.js Developers: Hashing, Encryption, and Signing Done Right

DevFeed: [Cryptography Essentials for Node.js Developers: Hashing, Encryption, and Signing Done Right](<https://devfeed.tech/articles/cryptography-essentials-for-node-js-developers-hashing-encryption-and-signing-done-right-63930.md>)

Original publisher: [Read original article](<https://www.sitepoint.com/cryptography-essentials-for-node-js-developers-hashing-encryption-and-signing-done-right/>)

Author: SitePoint Team

Published: 2026-10-01T19:49:14Z

Content type: tutorial

Language: en

Sources: [SitePoint](<https://devfeed.tech/sources/sitepoint.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Node.js](<https://devfeed.tech/topics/node-js.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [Highlight.js](<https://devfeed.tech/topics/highlightjs.md>)

Tags: [aes](<https://devfeed.tech/tags/aes.md>), [api](<https://devfeed.tech/tags/api.md>), [api-keys](<https://devfeed.tech/tags/api-keys.md>), [async](<https://devfeed.tech/tags/async.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [backend](<https://devfeed.tech/tags/backend.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [developers](<https://devfeed.tech/tags/developers.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [node](<https://devfeed.tech/tags/node.md>), [node-js](<https://devfeed.tech/tags/node-js.md>), [signing](<https://devfeed.tech/tags/signing.md>), [web-security](<https://devfeed.tech/tags/web-security.md>)

### AI overview

This tutorial shows backend developers how to use Node.js's built-in crypto module for common security tasks: hashing passwords with scrypt and unique salts, encrypting recoverable data with AES-256-GCM and unique IVs, verifying webhook signatures with HMAC and constant-time comparisons, and generating unpredictable tokens with cryptographic randomness. It emphasizes choosing the right primitive and avoiding unsafe defaults.

### Source excerpt

null Continue reading Cryptography Essentials for Node.js Developers: Hashing, Encryption, and Signing Done Right on SitePoint.

## Git 3.0's upcoming SHA-256 default will be a costly mistake

DevFeed: [Git 3.0's upcoming SHA-256 default will be a costly mistake](<https://devfeed.tech/articles/git-3-0-s-upcoming-sha-256-default-will-be-a-costly-mistake-63280.md>)

Original publisher: [Read original article](<https://blog.gitbutler.com/git-3-sha-256>)

Author: noreply@gitbutler.com (Scott Chacon)

Published: 2026-10-01T09:10:00Z

Content type: opinion

Language: en

Sources: [Butler's Log](<https://devfeed.tech/sources/butler-s-log.md>)

Topics: [Git](<https://devfeed.tech/topics/git.md>), [content-addressed tagging](<https://devfeed.tech/topics/content-addressed-tagging.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [sha256](<https://devfeed.tech/topics/sha256.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [attack](<https://devfeed.tech/tags/attack.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [developer-tools](<https://devfeed.tech/tags/developer-tools.md>), [git](<https://devfeed.tech/tags/git.md>), [gitbutler](<https://devfeed.tech/tags/gitbutler.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [programming](<https://devfeed.tech/tags/programming.md>), [sha-256](<https://devfeed.tech/tags/sha-256.md>), [software-development](<https://devfeed.tech/tags/software-development.md>), [technology](<https://devfeed.tech/tags/technology.md>), [version-control](<https://devfeed.tech/tags/version-control.md>)

### AI overview

The author argues that Git 3.0's planned SHA-256 default will impose broad migration costs across repositories, hosting services, links, signatures, and tooling without providing enough practical security benefit. The article distinguishes collision attacks from second-preimage attacks and argues that repository trust depends more on trusted sources than on hash strength. As an alternative, it proposes keeping SHA-1 for content addressing while adding independently computed, signed hashes to verify content.

### Source excerpt

Git 3.0 will make SHA-256 the new default content hashing algorithm and it will be an incomprehensibly expensive and ultimately valueless and avoidable global nightmare.

## Coding Challenge #138: Build Your Own DBM Key-Value Database

DevFeed: [Coding Challenge #138: Build Your Own DBM Key-Value Database](<https://devfeed.tech/articles/coding-challenge-138-dmb-60325.md>)

Original publisher: [Read original article](<https://codingchallenges.substack.com/p/coding-challenge-138-dmb>)

Author: John Crickett

Published: 2026-09-26T08:01:34Z

Content type: tutorial

Language: en

Sources: [Coding Challenges](<https://devfeed.tech/sources/coding-challenges.md>)

Topics: [Code Challenge](<https://devfeed.tech/topics/code-challenge.md>), [Database](<https://devfeed.tech/topics/database.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [NoSQL](<https://devfeed.tech/topics/nosql.md>), [Command-line interface](<https://devfeed.tech/topics/cli.md>), [Unix](<https://devfeed.tech/topics/unix.md>)

Tags: [coding](<https://devfeed.tech/tags/coding.md>), [command-line](<https://devfeed.tech/tags/command-line.md>), [database](<https://devfeed.tech/tags/database.md>), [developers](<https://devfeed.tech/tags/developers.md>), [hash-table](<https://devfeed.tech/tags/hash-table.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [systems](<https://devfeed.tech/tags/systems.md>)

### AI overview

A coding challenge guides readers through building a DBM-inspired key-value database. The project progresses from an in-memory store to extendible hashing, disk storage, and a command-line tool.

### Source excerpt

This challenge is to build your own DBM.

## Migrating Repositories to Git 3.0: Moving to SHA-256 and Reftables

DevFeed: [Migrating Repositories to Git 3.0: Moving to SHA-256 and Reftables](<https://devfeed.tech/articles/migrating-repositories-to-git-3-0-moving-to-sha-256-and-reftables-57960.md>)

Original publisher: [Read original article](<https://www.sitepoint.com/migrate-to-git-3-0-sha-256-and-reftables/>)

Author: SitePoint Team

Published: 2026-09-22T14:52:36Z

Content type: tutorial

Language: en

Sources: [SitePoint](<https://devfeed.tech/sources/sitepoint.md>)

Topics: [Git](<https://devfeed.tech/topics/git.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [migration](<https://devfeed.tech/topics/migration.md>), [Repository](<https://devfeed.tech/topics/repository.md>), [integrity](<https://devfeed.tech/topics/integrity.md>), [configuration](<https://devfeed.tech/topics/configuration.md>)

Tags: [audit](<https://devfeed.tech/tags/audit.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [devops](<https://devfeed.tech/tags/devops.md>), [git](<https://devfeed.tech/tags/git.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [migrate](<https://devfeed.tech/tags/migrate.md>), [programming](<https://devfeed.tech/tags/programming.md>), [repositories](<https://devfeed.tech/tags/repositories.md>), [sha-256](<https://devfeed.tech/tags/sha-256.md>)

### AI overview

A practical guide to migrating existing Git repositories from SHA-1 to SHA-256 object formats and from packed-refs to reftable storage. It covers repository auditing, backups, migration steps, updates to hooks and CI tooling, integrity validation, and rollback planning.

### Source excerpt

Prepare your repositories for Git 3.0: migrate from SHA-1 to SHA-256 object formats and switch ref storage to the scalable reftable backend. Continue reading Migrating Repositories to Git 3.0: Moving to SHA-256 and Reftables on SitePoint.

## Quiz: Python 3.15 Preview: frozendict

DevFeed: [Quiz: Python 3.15 Preview: frozendict](<https://devfeed.tech/articles/quiz-python-3-15-preview-frozendict-55726.md>)

Original publisher: [Read original article](<https://realpython.com/quizzes/python315-frozendict/>)

Author: Real Python

Published: 2026-09-21T12:00:00Z

Content type: tutorial

Language: en

Sources: [Real Python](<https://devfeed.tech/sources/real-python.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [test](<https://devfeed.tech/topics/test.md>), [hashing](<https://devfeed.tech/topics/hashing.md>)

Tags: [hash](<https://devfeed.tech/tags/hash.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [preview](<https://devfeed.tech/tags/preview.md>), [python](<https://devfeed.tech/tags/python.md>), [test](<https://devfeed.tech/tags/test.md>)

### AI overview

An interactive 13-question quiz tests understanding of Python 3.15's frozendict, including immutable mappings, hashability, dictionary keys, and the limits of freezing.

### Source excerpt

Test your grasp of Python 3.15's frozendict: build immutable mappings, hash them, and use them as dictionary keys.

## Eliminating AI Code Hallucinations with TypeScript Compiler Diagnostics and TDD Loops

DevFeed: [Eliminating AI Code Hallucinations with TypeScript Compiler Diagnostics and TDD Loops](<https://devfeed.tech/articles/eliminating-ai-code-hallucinations-with-typescript-compiler-diagnostics-and-tdd-loops-55535.md>)

Original publisher: [Read original article](<https://www.sitepoint.com/ai-code-hallucinations-typescript-compiler-diagnostics-tdd/>)

Author: SitePoint Team

Published: 2026-09-20T14:39:28Z

Content type: tutorial

Language: en

Sources: [SitePoint](<https://devfeed.tech/sources/sitepoint.md>)

Topics: [AI-assisted coding](<https://devfeed.tech/topics/ai-assisted-coding.md>), [TypeScript](<https://devfeed.tech/topics/typescript.md>), [AI Agent](<https://devfeed.tech/topics/ai-agent.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Test-driven development](<https://devfeed.tech/topics/tdd.md>), [JSON](<https://devfeed.tech/topics/json.md>), [Node.js](<https://devfeed.tech/topics/node-js.md>), [Parsing](<https://devfeed.tech/topics/parsing.md>), [context window](<https://devfeed.tech/topics/context-window.md>), [tracing](<https://devfeed.tech/topics/tracing.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [data](<https://devfeed.tech/topics/data.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-coding-agents](<https://devfeed.tech/tags/ai-coding-agents.md>), [code](<https://devfeed.tech/tags/code.md>), [context-window](<https://devfeed.tech/tags/context-window.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [json](<https://devfeed.tech/tags/json.md>), [node-js](<https://devfeed.tech/tags/node-js.md>), [parsing](<https://devfeed.tech/tags/parsing.md>), [programming](<https://devfeed.tech/tags/programming.md>), [tdd](<https://devfeed.tech/tags/tdd.md>), [test](<https://devfeed.tech/tags/test.md>), [typescript](<https://devfeed.tech/tags/typescript.md>)

### AI overview

A tutorial describes a TypeScript diagnostic feedback loop for AI coding agents. It combines compiler diagnostics, structured test failures, AST context, schema validation, and iterative feedback so agents can correct generated code against the actual type system and tests.

### Source excerpt

Build a TypeScript diagnostic feedback loop that feeds compiler diagnostics and test failures back to coding agents for verified self-correction. Continue reading Eliminating AI Code Hallucinations with TypeScript Compiler Diagnostics and TDD Loops on SitePoint.

## Cutting Node.js Memory Footprint with HyperLogLog and Count-Min Sketch in TypeScript

DevFeed: [Cutting Node.js Memory Footprint with HyperLogLog and Count-Min Sketch in TypeScript](<https://devfeed.tech/articles/cutting-node-js-memory-footprint-with-hyperloglog-and-count-min-sketch-in-typescript-55356.md>)

Original publisher: [Read original article](<https://www.sitepoint.com/probabilistic-data-structures-typescript-hyperloglog-count-min-sketch/>)

Author: SitePoint Team

Published: 2026-09-19T14:37:36Z

Content type: tutorial

Language: en

Sources: [SitePoint](<https://devfeed.tech/sources/sitepoint.md>)

Topics: [Node.js](<https://devfeed.tech/topics/node-js.md>), [TypeScript](<https://devfeed.tech/topics/typescript.md>), [Streaming](<https://devfeed.tech/topics/streaming.md>), [Data structures](<https://devfeed.tech/topics/data-structures.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [data](<https://devfeed.tech/topics/data.md>), [Code](<https://devfeed.tech/topics/code.md>), [Apache Iceberg](<https://devfeed.tech/topics/apache-iceberg.md>), [Redis](<https://devfeed.tech/topics/redis.md>)

Tags: [apache-spark](<https://devfeed.tech/tags/apache-spark.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [computing](<https://devfeed.tech/tags/computing.md>), [data-structures](<https://devfeed.tech/tags/data-structures.md>), [google](<https://devfeed.tech/tags/google.md>), [hashing](<https://devfeed.tech/tags/hashing.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [memory-optimization](<https://devfeed.tech/tags/memory-optimization.md>), [node-js](<https://devfeed.tech/tags/node-js.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [programming](<https://devfeed.tech/tags/programming.md>), [redis](<https://devfeed.tech/tags/redis.md>), [setup](<https://devfeed.tech/tags/setup.md>), [streaming](<https://devfeed.tech/tags/streaming.md>), [typescript](<https://devfeed.tech/tags/typescript.md>)

### AI overview

A tutorial on implementing HyperLogLog and Count-Min Sketch in pure TypeScript for streaming analytics. It explains how bounded-memory probabilistic structures estimate cardinality and frequencies in Node.js, with MurmurHash3, configurable error bounds, and Vitest benchmarks.

### Source excerpt

Ingest and aggregate millions of streaming events in Node.js with sub-megabyte RAM using HyperLogLog and Count-Min Sketch written in pure TypeScript. Continue reading Cutting Node.js Memory Footprint with HyperLogLog and Count-Min Sketch in TypeScript on SitePoint.

## WebAuthn Passkey Recovery: Building Account Fallbacks and Backup Codes in Node.js

DevFeed: [WebAuthn Passkey Recovery: Building Account Fallbacks and Backup Codes in Node.js](<https://devfeed.tech/articles/webauthn-passkey-recovery-building-account-fallbacks-and-backup-codes-in-node-js-55246.md>)

Original publisher: [Read original article](<https://www.sitepoint.com/webauthn-passkey-recovery-account-fallbacks-nodejs/>)

Author: SitePoint Team

Published: 2026-09-18T19:58:10Z

Content type: tutorial

Language: en

Sources: [SitePoint](<https://devfeed.tech/sources/sitepoint.md>)

Topics: [Passkeys](<https://devfeed.tech/topics/passkeys.md>), [WebAuthn](<https://devfeed.tech/topics/webauthn.md>), [Node.js](<https://devfeed.tech/topics/node-js.md>), [Security](<https://devfeed.tech/topics/security.md>), [Zero Trust](<https://devfeed.tech/topics/zero-trust.md>), [Authentication](<https://devfeed.tech/topics/authentication.md>), [Express](<https://devfeed.tech/topics/express.md>), [rate-limiting](<https://devfeed.tech/topics/rate-limiting.md>), [TypeScript](<https://devfeed.tech/topics/typescript.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [JSON Web Tokens](<https://devfeed.tech/topics/jwt.md>), [sessions](<https://devfeed.tech/topics/sessions.md>)

Tags: [cryptographic](<https://devfeed.tech/tags/cryptographic.md>), [express](<https://devfeed.tech/tags/express.md>), [jwt](<https://devfeed.tech/tags/jwt.md>), [node-js](<https://devfeed.tech/tags/node-js.md>), [passkeys](<https://devfeed.tech/tags/passkeys.md>), [programming](<https://devfeed.tech/tags/programming.md>), [public-key](<https://devfeed.tech/tags/public-key.md>), [rate-limiting](<https://devfeed.tech/tags/rate-limiting.md>), [security](<https://devfeed.tech/tags/security.md>), [sessions](<https://devfeed.tech/tags/sessions.md>), [typescript](<https://devfeed.tech/tags/typescript.md>), [web](<https://devfeed.tech/tags/web.md>), [web-security](<https://devfeed.tech/tags/web-security.md>)

### AI overview

A tutorial for implementing WebAuthn passkey recovery in Node.js. It covers high-entropy backup codes, Argon2id hashing, rate-limited verification, time-limited JWT recovery sessions, passkey registration, credential revocation, backup-code rotation, and user notifications.

### Source excerpt

Build resilient WebAuthn passkey recovery in Node.js with cryptographic backup codes and secure fallback flows that preserve zero-trust security. Continue reading WebAuthn Passkey Recovery: Building Account Fallbacks and Backup Codes in Node.js on SitePoint.

## A zero-click RCE flaw in AI coding agents could have exposed enterprise systems

DevFeed: [A zero-click RCE flaw in AI coding agents could have exposed enterprise systems](<https://devfeed.tech/articles/a-zero-click-rce-flaw-in-ai-coding-agents-could-have-exposed-enterprise-systems-47848.md>)

Original publisher: [Read original article](<https://www.infoworld.com/article/4223907/a-zero-click-rce-flaw-in-ai-coding-agents-could-have-exposed-enterprise-systems.html>)

Author: Anirban Ghoshal

Published: 2026-09-18T15:39:27Z

Content type: news

Language: en

Sources: [InfoWorld](<https://devfeed.tech/sources/infoworld.md>)

Topics: [Security & Privacy](<https://devfeed.tech/topics/security-privacy.md>), [Exploit](<https://devfeed.tech/topics/exploit.md>), [AI-assisted coding](<https://devfeed.tech/topics/ai-assisted-coding.md>), [Claude Code](<https://devfeed.tech/topics/claude-code.md>), [codex](<https://devfeed.tech/topics/codex.md>), [GitHub Copilot](<https://devfeed.tech/topics/github-copilot.md>), [Git](<https://devfeed.tech/topics/git.md>), [hashing](<https://devfeed.tech/topics/hashing.md>), [GitHub Copilot CLI](<https://devfeed.tech/topics/github-copilot-cli.md>)

Tags: [ai-coding-agents](<https://devfeed.tech/tags/ai-coding-agents.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [artificial-intelligence-code-editors-development-tools-security-software-development-vulnerabil](<https://devfeed.tech/tags/artificial-intelligence-code-editors-development-tools-security-software-development-vulnerabil.md>), [claude-code](<https://devfeed.tech/tags/claude-code.md>), [code-editors](<https://devfeed.tech/tags/code-editors.md>), [codex](<https://devfeed.tech/tags/codex.md>), [cybersecurity](<https://devfeed.tech/tags/cybersecurity.md>), [development-tools](<https://devfeed.tech/tags/development-tools.md>), [exploit](<https://devfeed.tech/tags/exploit.md>), [gemini-cli](<https://devfeed.tech/tags/gemini-cli.md>), [git](<https://devfeed.tech/tags/git.md>), [git-commit](<https://devfeed.tech/tags/git-commit.md>), [github-copilot](<https://devfeed.tech/tags/github-copilot.md>), [hash](<https://devfeed.tech/tags/hash.md>), [plugin](<https://devfeed.tech/tags/plugin.md>), [rce](<https://devfeed.tech/tags/rce.md>), [security](<https://devfeed.tech/tags/security.md>), [software-development](<https://devfeed.tech/tags/software-development.md>), [vulnerabilities](<https://devfeed.tech/tags/vulnerabilities.md>)

### AI overview

Researchers reported Plugin4Shell, a zero-click vulnerability affecting several AI coding agents. Attackers could substitute a trusted plugin with malicious code and execute it in enterprise development environments. Most affected vendors have released patches, according to the supplied text.

### Source excerpt

Popular AI coding agents such as OpenAI's Codex, Anthropic's Claude Code, Google's Gemini CLI, and Microsoft-owned GitHub Copilot were vulnerable to a zero-click attack that enabled attackers to execute malicious code, even without developer interaction, by swapping a trusted plugin from an online marketplace for a malicious one, potentially giving them a foothold in enterprise development environments. Researchers at cybersecurity startup AIR found and reported the flaw, which they are calling Plugin4Shell, to the vendors concerned, and most of them have now released a patch for it, the researchers wrote in a blog post on Thursday. It's "a flaw no marketplace can fix, so users must update their agent," the researchers wrote How Claude Code, Codex, and GitHub Copilot were exploited Enterprises typically use plugins to extend the capabilities of their AI coding agents, giving the agent access to additional tools, commands, and external services that can help it perform tasks beyond generating or modifying code. When a developer installs a plugin, the agent typically downloads its code from a Git repository and uses a Git commit to determine if it is running an approved copy of the code, one that has been reviewed and cleared by the developer. That check is done with the help of a secure hash algorithm (SHA), a unique cryptographic identifier assigned to each Git commit. Developers can give the agent the SHA of the reviewed commit, telling it to run that specific copy of the plugin. However, Claude Code, Codex, and GitHub Copilot can be tricked into running malicious code instead of the trusted plugin code associated with the SHA because they pass the SHA directly to Git to check out the plugin code but do not subsequently verify that Git has actually checked out the commit corresponding to that SHA, the researchers wrote. That means an attacker who controls the plugin's repository, either by publishing a benign plugin and later turning it malicious or by taking over

[Next page](<https://devfeed.tech/topics/hashing.md?cursor=WyIyMDI2LTA5LTE4VDE1OjM5OjI3KzAwOjAwIiwgIjBlODkwZDU4LTQ1NzEtNGM3Ni04MmU4LWM5ZjI2ZjBjNTYyOSJd>)