Erofs – Enhanced Read-Only File System – The Linux Kernel Documentation
EROFS is an enhanced read-only file system that utilizes fixed-sized output compression for data. This method allows for higher compression ratios by leveraging historical dictionaries from popular LZ77-based algorithms. The system introduces logical clusters to manage variable-sized extents and supports big physical clusters for improved data handling.
- ▪EROFS implements fixed-sized output compression generating fixed-sized compressed data blocks from variable-sized input.
- ▪The introduction of big pclusters allows for multiple variable-sized extents to be used for compressed data deduplication.
- ▪Logical clusters are used to indicate whether a new extent is generated within a specified range.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Kernel |
| Canonical URL | https://docs.kernel.org/filesystems/erofs.html |
| Publication time | Fri, 29 May 2026 14:12:12 +0000 |
| Retrieval time | 2026-05-29T14:20:01.346Z |
| Last seen | 2026-05-29T14:20:01.346Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | M5W1ZQiU6Vtj |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Data compression¶ EROFS implements fixed-sized output compression which generates fixed-sized compressed data blocks from variable-sized input in contrast to other existing fixed-sized input solutions. Relatively higher compression ratios can be gotten by using fixed-sized output compression since nowadays popular data compression algorithms are mostly LZ77-based and such fixed-sized output approach can be benefited from the historical dictionary (aka. sliding window). In details, original (uncompressed) data is turned into several variable-sized extents and in the meanwhile, compressed into physical clusters (pclusters).
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Kernel.
Discussion
0 commentsMore from Kernel
