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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Show HN: Checking 320M passwords in milliseconds with serverless bloom filters

33 点作者 thomasj超过 7 年前

2 条评论

natch超过 7 年前
&quot;found password in bloom filter:...&quot; is sort of a misleading message. Bloom filters don&#x27;t tell you that something is present. They can tell you either that something is not present, or that it is <i>likely</i> to be present.
评论 #15025740 未加载
slackingoff2017超过 7 年前
Interesting, but you probably didn&#x27;t need to write your own filter :). Google&#x27;s Guava library has the best designed and performing Bloom filter I&#x27;ve ever seen. Lockless concurrency, extremely fast hashing function.
评论 #15025733 未加载