Skip to content

Commit

Permalink
Add link to blogpost about read beyond optimization
Browse files Browse the repository at this point in the history
  • Loading branch information
ogxd committed May 15, 2024
1 parent ec05e0a commit 056d097
Showing 1 changed file with 2 additions and 1 deletion.
3 changes: 2 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,8 @@ hashset.insert("hello world");
## Features

### Blazingly Fast 🚀
Up to this date, GxHash is the fastest non-cryptographic hashing algorithm of its class, for all input sizes. This performance is possible mostly thanks to heavy usage of SIMD intrinsics, high ILP construction and a small bytecode (easily inlined and cached).
Up to this date, GxHash is the fastest non-cryptographic hashing algorithm of its class, for all input sizes. This performance is possible mostly thanks to heavy usage of SIMD intrinsics, high ILP construction, a small bytecode (easily inlined and cached) and some ([outrageously unsafe](https://ogxd.github.io/articles/unsafe-read-beyond-of-death/)) tricks.

See the [benchmarks](#benchmarks).

### Highly Robust 🗿
Expand Down

0 comments on commit 056d097

Please sign in to comment.