TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Show HN: New compression algorithm beats ZSTD by 14%

1 点作者 seccode10 个月前
Hi all, I made a data compression algorithm that works as follows: Replace common bigrams with a fixed value: &quot;of the&quot; =&gt; &quot;of e&quot; &quot;and she&quot; =&gt; &quot;and e&quot; &quot;when there&quot; =&gt; &quot;when e&quot;<p>To decompress, look up the bigram dictionary for the right value of e.<p>I&#x27;ve had some weird bugs in the decompression process, so I&#x27;m looking forward to others looking at this.

1 comment

metadat10 个月前
What kind of data is it 14% better on?<p>The algorithm code looks like it&#x27;s actually using Zstd, is that right?<p>Please show some benchmarks. I&#x27;d like to repeat your test!
评论 #41220715 未加载