HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
cloudflare
trie-hard
Rust2024–2024
cloudflare / trie-hard

trie-hard

Novel implementation of a Trie data structure optimized for small, sparse maps

Data & DatabasesLibraries & SDKs
Explore on GitHubRead Hacker News discussions
3Distinct people
3Mentions
0Explicit recommenders
618GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Novel implementation of a Trie data structure optimized for small, sparse maps

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:03:16 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day3 dated mentions

Observed mentions: 2024-09-10 18:52:43 UTC to 2024-10-07 10:27:23 UTC.

012024-09-10 00:00:00 UTC to 2024-09-11 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsSep 102024-09-11 00:00:00 UTC to 2024-09-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-12 00:00:00 UTC to 2024-09-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-13 00:00:00 UTC to 2024-09-14 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2024-09-14 00:00:00 UTC to 2024-09-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-15 00:00:00 UTC to 2024-09-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-16 00:00:00 UTC to 2024-09-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-17 00:00:00 UTC to 2024-09-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-18 00:00:00 UTC to 2024-09-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-19 00:00:00 UTC to 2024-09-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-20 00:00:00 UTC to 2024-09-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-21 00:00:00 UTC to 2024-09-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-22 00:00:00 UTC to 2024-09-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-23 00:00:00 UTC to 2024-09-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsSep 232024-09-24 00:00:00 UTC to 2024-09-25 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-25 00:00:00 UTC to 2024-09-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-26 00:00:00 UTC to 2024-09-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-27 00:00:00 UTC to 2024-09-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-28 00:00:00 UTC to 2024-09-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-29 00:00:00 UTC to 2024-09-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-30 00:00:00 UTC to 2024-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-01 00:00:00 UTC to 2024-10-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-02 00:00:00 UTC to 2024-10-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-03 00:00:00 UTC to 2024-10-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-04 00:00:00 UTC to 2024-10-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-05 00:00:00 UTC to 2024-10-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-06 00:00:00 UTC to 2024-10-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-07 00:00:00 UTC to 2024-10-08 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsOct 7

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Sep 102024-09-10 00:00:00 UTC2024-09-11 00:00:00 UTC101
Sep 112024-09-11 00:00:00 UTC2024-09-12 00:00:00 UTC000
Sep 122024-09-12 00:00:00 UTC2024-09-13 00:00:00 UTC000
Sep 132024-09-13 00:00:00 UTC2024-09-14 00:00:00 UTC101
Sep 142024-09-14 00:00:00 UTC2024-09-15 00:00:00 UTC000
Sep 152024-09-15 00:00:00 UTC2024-09-16 00:00:00 UTC000
Sep 162024-09-16 00:00:00 UTC2024-09-17 00:00:00 UTC000
Sep 172024-09-17 00:00:00 UTC2024-09-18 00:00:00 UTC000
Sep 182024-09-18 00:00:00 UTC2024-09-19 00:00:00 UTC000
Sep 192024-09-19 00:00:00 UTC2024-09-20 00:00:00 UTC000
Sep 202024-09-20 00:00:00 UTC2024-09-21 00:00:00 UTC000
Sep 212024-09-21 00:00:00 UTC2024-09-22 00:00:00 UTC000
Sep 222024-09-22 00:00:00 UTC2024-09-23 00:00:00 UTC000
Sep 232024-09-23 00:00:00 UTC2024-09-24 00:00:00 UTC000
Sep 242024-09-24 00:00:00 UTC2024-09-25 00:00:00 UTC000
Sep 252024-09-25 00:00:00 UTC2024-09-26 00:00:00 UTC000
Sep 262024-09-26 00:00:00 UTC2024-09-27 00:00:00 UTC000
Sep 272024-09-27 00:00:00 UTC2024-09-28 00:00:00 UTC000
Sep 282024-09-28 00:00:00 UTC2024-09-29 00:00:00 UTC000
Sep 292024-09-29 00:00:00 UTC2024-09-30 00:00:00 UTC000
Sep 302024-09-30 00:00:00 UTC2024-10-01 00:00:00 UTC000
Oct 12024-10-01 00:00:00 UTC2024-10-02 00:00:00 UTC000
Oct 22024-10-02 00:00:00 UTC2024-10-03 00:00:00 UTC000
Oct 32024-10-03 00:00:00 UTC2024-10-04 00:00:00 UTC000
Oct 42024-10-04 00:00:00 UTC2024-10-05 00:00:00 UTC000
Oct 52024-10-05 00:00:00 UTC2024-10-06 00:00:00 UTC000
Oct 62024-10-06 00:00:00 UTC2024-10-07 00:00:00 UTC000
Oct 72024-10-07 00:00:00 UTC2024-10-08 00:00:00 UTC101

What Hacker News says

3 sources
kristianp·Sep 13, 2024
I tried a problem I was looking at recently, to refactor a small rust crate to use one datatype instead of an enum, to help me understand the code better. I found o1-mini made a decent attempt, but couldn't provide error free code. o1-preview was able to provide code that compiled and passed all but the test that is expected to fail, given the change I asked it to make. This is the prompt I gave: simplify this rust library by removing the different sized enums and only using the U8 size. For example MasksByByte is an enum, change it to be an alias for the U8 datatype. Also the u256 datatype isn't required, we only want U8, so remove all references to U256 as well. The original crate is trie-hard [1][2] and I forked it and put the models attempts in the fork [3]. I also quickly wrote it up at [4] [1] https://blog.cloudflare.com/pingora-
Read the rest
saving-compute-1-percent... [2] https://github.com/cloudflare/trie-hard [3] https://github.com/kpm/trie-hard-simple/tree/main/attempts [4] https://blog.reyem.dev/post/refactoring_rust_with_chatgpt-o1...
In Notes on OpenAI's new o1 chain-of-thought models
SkiFire13·Sep 10, 2024
By looking at the source code [1] they have a discriminated union with 3 variants representing the possible combinations of representing a valid word and leading to more nodes (excluding the case where it is neither, which is impossible). So the node for the 'o' in "do" should be a `SearchOrLeaf` storing "do", its corresponding value (the `T`, in a set this would be empty) and the `SearchNode` containing the successors, which should only contain a 't' to "dot". [1]: https://github.com/cloudflare/trie-hard/blob/3d8163ca2d9208c...
In A good day to trie-hard: saving compute 1% at a time

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.