Revisit deterministic IDs
Open
Nobody has claimed this yet.
medium
performance
- Dominant language
- Rust
- Stars
- 355
- Forks
- 24
- Avg merge
- 2d 6h
- Merged PRs (30d)
- 17
Description
Our first ID implementation was with blake3, which is fast but was using 8 bytes - spending more memory we could afford. Currently, we're using xxhash with i64, which is decently fast, but still uses more memory than we would like.
Let's explore if we can use u32 (which matches Pyre and Sorbet).
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No file or test is named. Start by locating the current xxhash i64 ID implementation, then compare a u32 approach with the existing blake3 and xxhash choices, including memory and performance. Done means the feasibility of u32 is measured and a clear implementation direction is recorded.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- devtools
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100