10 ms·
Meow Hash (2018)
- invincivlepvt 5y ago<a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Search Engine Optimization</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Search Engine Optimisation</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Search Engine Optimisation Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Search Engine Optimization Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Services</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Services Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Services Agency</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Services Company</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Services Agency Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">SEO Services Company Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best SEO Services Company</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best SEO Services</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best SEO Services Agency</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best Search Engine Optimisation Services</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best Search Engine Optimization Services</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best Search Engine Optimization Services Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best Search Engine Optimisation Services Jalandhar</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Local SEO</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">Best Local SEO</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">National SEO</a> <a href="https://invincivlepvt.com/search-engine-optimization-jalandhar/ https://invincivlepvt.com/search-engine-optimization-jalandh..." rel="nofollow">National SEO</a>
- kortex 5y agoThis is great! Many applications (like dedupe) don't need full crypto guarantees. If you need something fast, and crypto secure, I recommend checking out Blake3/b3sum. I'm just learning about XXH3 in this thread so I cannot comment on how it stacks up but I love b3sum for fast file hashing. https://github.com/BLAKE3-team/BLAKE3/tree/master/b3sum https://github.com/BLAKE3-team/BLAKE3/tree/master/b3sum
- rurban 5y agoFor comparison: https://github.com/rurban/smhasher/ https://github.com/rurban/smhasher/ It's indeed pretty fast ( among the top 5), but not particularly good. It fails some basic tests. Rather use xxh3, t1ha or farmhash
- daniel-thompson 5y agoCan you elaborate on what it fails? https://mollyrocket.com/meowhash https://mollyrocket.com/meowhash claims: > It cleanly passes every test in smhasher
- pepoluan 5y agoMeowHash page last updated 2018. smhasher page last updated several days ago.
- cateye 5y agoI really enjoyed reading this the clear and concise way of explanation as documentation. While I was totally not interested in a hash function whatsoever, I read the whole thing :)
- deleted 5y ago[deleted]
- Traubenfuchs 5y ago> we have benchmarked all the ones we could find Those results would increase the value of this article from "very low" to "medium".
- chalst 5y agoThe README for xxhash has benchmarks covering fast hashes including Meow: https://github.com/Cyan4973/xxHash/wiki/Performance-comparison https://github.com/Cyan4973/xxHash/wiki/Performance-comparis...
- Cilvic 5y agoI know +1 is against the rules, but I think this deserves a positive comment. I enjoyed reading it, thanks for taking the time and giving back to the ecosystem.
- amenghra 5y agoWould be interesting to compare it to siphash.
- adamgordonbell 5y agoFound this in the readme: Due to recent discoveries by Peter Schmidt-Nielsen, we have decided to reclassify Meow hash 0.5/calico from level 3 to level 1. This means that we recommend not to use this hash for message authentication codes, or for hash tables in scenarios where collision induced denial-of-service attacks are a concern. For level 3/MAC capabilities consider migrating to SipHash. If the performance of SipHash is not satisfying, continuing to use Meow 0.5 for hash tables is better than migrating to another fast hash.
- CodesInChaos 5y agoSiphash has pretty bad performance on large inputs. From what I remember, even MD5 was faster.
- Comevius 5y agoGoogle made faster Siphash variants, and also HighwayHash that's much faster. https://github.com/google/highwayhash https://github.com/google/highwayhash
- buildbot 5y agoThis could be super useful for deduplicating large photo datasets! It might be worth changing this link to the github, there’s a lot more info on the hash there.
- bityard 5y ago> This could be super useful for deduplicating large photo datasets! That is indeed the use case mentioned in the article. A hash like this is useful for deduplicating large _file_ datasets but for deduplicating images in particular, you really want a perceptual hash. Because two images files can _look_ identical but have slightly (or wildly) different byte streams. The trade-off is that perceptual hashes are notorious for false positives in large datasets.
- buildbot 5y agoYep, just happy someone was looking into it, I currently use xxHash for this. Perceptual hashing for photos isn't great in my opinion, for example I have many raw photos that look very similar, the only difference may be a slightly higher shutter speed, or a correction of the camera angle. I'm guessing many perceptual hashes would mark these as duplicate. Maybe that's what many want, it's not what I want personally.
- pepoluan 5y agoAnd what's wrong with xxHash? According to xxHash's performance comparison page, xxHash is faster than MeowHash.
- kayamon 5y agoI once saw a guy dedupe a folder by batch-converting them to low quality JPEG thumbnails then sorting by size.
- NKosmatos 5y agoCame here to say the same thing :-) Anyone know of a free(ish) software based on a very fast hashing algorith for checking large number of images? My intention is to check for bit-rot and other unforeseen data corruptions between backup disks, I assume many others must have a similar use case.
- da_big_ghey 5y agoSeahash came out very well last I have seen in it, any comparison? https://docs.rs/seahash/4.1.0/seahash/ https://docs.rs/seahash/4.1.0/seahash/
- pepoluan 5y agoXXHash author last updated the following page on Aug 10 of this year: https://github.com/Cyan4973/xxHash/wiki/Performance-comparison https://github.com/Cyan4973/xxHash/wiki/Performance-comparis...
- apavlo 5y agoSMHasher benchmark numbers are here (including Meow Hash): https://github.com/rurban/smhasher#readme https://github.com/rurban/smhasher#readme
- CodesInChaos 5y agoThe quality column on that page seems dubious, since it lists test failures for secure cryptographic hashes.
- pkhuong 5y agoCryptographic hashes mostly look at collisions for the whole output (or precisely truncated outputs). There can still be patterns or clumping in short ranges of the output bits for certain input families, as long as the full outputs differ. For example, the identity function is extremely resistant to collisions. However, it doesn't mix the input bits, so it's not a great hash function.
- CodesInChaos 5y agoModern cryptographic hashes (SHA3, Blake2/3) are designed to be indistinguishable from a random oracle. And even MD5/SHA1/SHA2 should not be distinguishable by a statistical test suite. So if any of them fails a test, it means that either: 1. A statistical test found a flaw crytographers did not yet discover (very unlikely, especially since multiple cryptographic hashes fail) 2. The test suite integrated/implemented the hash function incorrectly. This test suite seems to key the hash functions in an unsupported way, though I'm skeptical that's responsible for the failures. 3. The test suite is flawed and has a significant chance of producing test failures for an ideal hash function.
- pkhuong 5y agosmhasher does not report any failure for blake3. The one failure for blake2b 256 is not ideal for a hash function, but not necessarily evidence that the function doesn't look like a random value: `Sparse` generated 50643 16-bit values, hashed them, and found 2 collisions in the high 32 bits of the output. I'm not sure what kind of flaw in the test harness you think can explain that. There could definitely be issues in the integration code that lets the harness call into all these functions. For example, smhasher finds issues with SHA3 for the "PerlinNoise" input sets. That input set hashes small integers in [0, 4096), with seeds in [0, 4096); I'm not convinced the sha3 wrapper does anything useful with the seed here https://github.com/rurban/smhasher/blob/37cffd7b9cdaa2140c5313070e7f30879a547b6b/Hashes.h#L956-L963 https://github.com/rurban/smhasher/blob/37cffd7b9cdaa2140c53... . I expect something similar is happening with SHA1 and SHA2. The MD5 row shows no failure; only the function that truncates to the low 32 bit has failures. You can read the test harness or the test log (e.g., https://github.com/rurban/smhasher/blob/master/doc/blake2b-256.txt https://github.com/rurban/smhasher/blob/master/doc/blake2b-2...) and apply your own significance threshold. The statistical tests are nothing special or novel (counting collisions in bitranges of the input, and bias in individual bits, mostly); the interesting part is how the various tests generate interesting sets of inputs. In the end, it's a bit like the PRNG wars: you can always come up with a test that makes a function look bad, but a ton of failure is definitely a bad sign.
- lmilcin 5y agoNow the only issue is, I will be an instant subject of ridicule if my team sees me using something called "Meow Hash".
- failrate 5y agoToo bad, there's also the very useful Squirrel3 Noise Hash.
- 0des 5y agoWhy?
- recursive 5y agoNot everyone can do it, but I recommend ignoring ridicule that's not well founded.
- jnwatson 5y agoYou better not use a VCS that’s also a common insult then.
- gkbrk 5y agoI guess you should avoid using stuff like a Python interpreter, a Squeak VM, socks proxies or Cha Cha encryption too. If your team dismisses good solutions because it has "meow" in the name, you probably need a better team. I would recommend that they alias their `cat` command as "concatenate" in order to prevent further ridicule.
- cb321 5y agoI have measured (on a Skylake core) the hash from Daniel Lemire, Owen Kaser, "Faster 64-bit universal hashing using carry-less multiplications, Journal of Cryptographic Engineering (to appear)" at t_cycles = (0.00741 +- 0.00098 cycles/byte) * bytes + (37.43 +- 0.48) which is roughly 135 B/cycle (675 GB/s at 5 GHz) or over 2x faster than the claim here. Admittedly, that 37 cycle fixed cost is probably quite a bit higher, and I don't know how well the bit mixing compares. Parenthetically, a time equation (like t_cycles = coef * bytes + fixedCost) is a more convenient way to summarize performance of this kind of thing than the constant short string/long string mumble-mumble. Yes, loop unrolling/etc. can create step-ish functions and a linear regression is pretty approximate (but my stderrs are pretty small above), but even so..much less tripping over words.
- pkhuong 5y agoumash (https://github.com/backtrace-labs/umash https://github.com/backtrace-labs/umash) has a similar structure PH block structure (and similar universality guarantees), but was designed for decent bit mixing (enough to satisfy smhasher, unlike CLHASH, which needs an additional finalizer) with a lower fixed time cost: 22 cycles for a one-byte hash on a 2.5 GHz Xeon 8175M. I'm not sure how one would use that linear regression. What kind of hardware offers 675 GB/s of memory bandwidth? 140 bytes/cycle is easily more than twice the L2 read bandwidth offered by any COTS chip I'm aware of. There are also warm up effects past the fixed cost of setup and finalizers that slow down hashing for short input. For what range of input sizes (and hot/cold cache state) would you say the regression is a useful model?
- cb321 5y agoI was only doing short < 1024 byte strings in L1 (like URI lengths-ish). I'm well aware no memory system on typical HW can deliver that (EDIT: "at large space scale"). The article itself mentions a similar calculation (but at their slower scale) which is why I included it. And yes, warm up absolutely matters. My numbers are for the best case path which is among the only easy things to even define, IMO. Worst and average are sooooo much harder/assumption-riddled. Then you argue a lot about said assumptions. I do the minimum times of many runs in an inner loop and the regression on those min-time results. So, the min-loops will warm up everything like branch predictors, etc. I'd suspect the regression model would hold up to usable L1 cache (e.g. 30 KiB or so). Beyond that, it's mostly just measuring the memory system not the hash function..and I'm not sure what the point of that is. Separation of concerns would suggest L1 perf is most relevant to the "hash calculation part". (IMO, many benchmarks confuse this.) And, yeah..modern memory systems suck. Simple back of the envelope would suggest some DIMM-oriented workload would be waiting on the DIMMs like 95% of the time, usually much higher on Xeons with their low single core BW (maybe 98%!). The Meow article sort of alludes to that as well with less detail. Single core Xeon BW is always a huge disappointment. Forces you to go (very) parallel just to saturate DIMMs (EDIT: which in turn cannot saturate even a single L1!). BTW, it sounds like you know all of this (and maybe more) and I don't mean to suggest otherwise, but I thought some numbers/details might assist other passersby. { EDIT: Also, the stderr on that slope is ~13%. So, it's possible 135 is really 128 (1.05x lower), the 2 cache line/cycle load limit or something like that. This doesn't mean the 640 GB/s rate number is wrong - it just underscores how mismatched memory systems are at their various scales. } { EDIT: and yes, 128/16 = 8x faster than meow, not 2x. Oops. }
- wolf550e 5y agoHow does it compare to XXH3? https://github.com/Cyan4973/xxHash https://github.com/Cyan4973/xxHash https://github.com/rurban/smhasher#readme https://github.com/rurban/smhasher#readme says XXH3 is 16GB/s while meow is 17GB/s.
- caeril 5y ago> How does it compare to XXH3? XX is a slightly better hashing function, meow is slightly faster. Take your pick. Life is about tradeoffs.
- pepoluan 5y agoWell, the page for MeowHash is written in 2018. xxHash Performance Comparison page is last updated in 2021, and in that page XXH3 is faster than MeowHash: https://github.com/Cyan4973/xxHash/wiki/Performance-comparison https://github.com/Cyan4973/xxHash/wiki/Performance-comparis...
- DeathArrow 5y agoi7-9700K can reach up to 4.9 Ghz and Meow Hash can hash at a rate of 16 bytes per cycle. That means 78 GB/s. xxHash rate is 31.5 GB/s on that CPU.
- wolf550e 5y agoScroll down, XXH3 is 59 GB/s using AVX2 while meow is 58 GB/s in their benchmark.
- anonova 5y agoA detailed analysis of Meow Hash: https://peter.website/meow-hash-cryptanalysis https://peter.website/meow-hash-cryptanalysis It's not the highest of quality hash functions (see the SMHasher benchmarks), but it is fast. A great alternative is XXH3 (https://cyan4973.github.io/xxHash/ https://cyan4973.github.io/xxHash/), which has seen far more usage in practice.
- ilitirit 5y agoI can vouch for xxHash (it does what it says on the can), but I'm really curious to hear from who have experience with meow hash.
- thomasahle 5y agoXXH3 has issues too. There are certain inputs, independent of the seed, on which it collides much more often than it should. On the other hand a hash like UMash guarantees low collisions on any input: https://engineering.backtrace.io/2020-08-24-umash-fast-enough-almost-universal-fingerprinting/ https://engineering.backtrace.io/2020-08-24-umash-fast-enoug...
- jdcarter 5y agoI'm using XXHash3 for verifying data integrity of large (10+MB) blobs. Very fast and appears to work very well in my testing--it's never missed any bit error I've thrown at it. Aside: when storing hashes, be sure to store the hash type as well so that you can change it later if needed, e.g. "xxh3-[hash value]". RFC-6920 also has things to say about storing hash types and values, although I haven't seen its format in common use.
- njt 5y ago> be sure to store the hash type as well so that you can change it later if needed Thanks for sharing this, I'd been doing this on my own for my own stuff (eg. foo.txt-xxh32-ea79e094), but it's good to know someone else has thought it through. I ran into the problem once where someone had named some files foo-fb490c or something similar without any annotation, and when there was a problem, it took a file to figure out they were using truncated sha256 hashes.
- ed25519FUUU 5y ago> The Meow hash is a high-speed hash function named after the character Meow in Meow the Infinite. As someone who doesn’t watch cartoons I’m constantly surprised at the influence cartoons and anime is having on modern tech especially with regards to computer science.
- arduinomancer 5y agoTo add some context Casey is one of the creators of Meow the Infinite
- phtrivier 5y agoIn this case, the comic Meow the Infinite is actually done by the same game shop behing the meow hash.
- caeril 5y agoNot sure you can call MR a "game shop". Pretty sure it's just Casey, with Anna on contract.
- alecco 5y ago(2018)
- scriptdevil 5y agoI recently used seahash in rust for a similar job. This seems to fall in the same niche.
- NelsonMinar 5y agoI wish there was a consensus non-cryptographic hash algorithm. Something that hashes arbitrary data to 128 or 256 bit keys with good randomness, few collisions on typical input data, and universal implementation. Most programmers I know reach for SHA-1 (or if we're being honest, MD5). But a cryptohash is really wasteful if you don't need the cryptographic properties. Last I looked at this Murmurhash was the closest to widely used with some folks saying Metrohash was better. But that was years ago. Judging by this discussion xxHash is the new hotness?
- pspeter3 5y agoI’m curious too about the differences between Murmurhash and xxHash. I’ve been using Murmur in my side projects.
- pkhuong 5y agoThe production of seed-independent collisions for various versions of murmurhash (e.g., http://emboss.github.io/blog/2012/12/14/breaking-murmur-hash-flooding-dos-reloaded/ http://emboss.github.io/blog/2012/12/14/breaking-murmur-hash...) motivated siphash. In general, when there's no positive proof of collision bounds, I would assume (un)lucky inputs can collide much more often than usual, even when you change the seed. The difference between murmurhash and xxhash in that regard is that anyone can download code to generate murmurhash collisions, while code to make xxhash cry is still unknown/secret. XXH3 is also a lot faster for long strings, and I believe comparable to murmurhash for short inputs.
- tromp 5y ago> I wish there was a consensus non-cryptographic hash algorithm I think Siphash serves that role pretty well. It's one of the most if not the most secure among non-cryptographic hashes, and quite speedy, especially with SIMD implementations. One need only consider alternatives if one wants to trade off a bit of security for even higher speed.
- NelsonMinar 5y ago
- arduinomancer 5y agoA collision was reported a couple months ago https://github.com/cmuratori/meow_hash/issues/80 https://github.com/cmuratori/meow_hash/issues/80
- Accacin 5y agoThe back and forth in that thread is incredibly interesting too.
- oefrha 5y agoDiscussed at the time: https://news.ycombinator.com/item?id=18262627 https://news.ycombinator.com/item?id=18262627
- dang 5y agoThanks! Macroexpanded: Meow Hash: A high-speed non-cryptographic hash function - https://news.ycombinator.com/item?id=18262627 https://news.ycombinator.com/item?id=18262627 - Oct 2018 (68 comments) Also: Cryptanalysis of Meow Hash - https://news.ycombinator.com/item?id=27978878 https://news.ycombinator.com/item?id=27978878 - July 2021 (9 comments)
- kazinator 5y ago> Because we have to process hundreds of gigabytes of art assets to build game packages, we wanted a fast, non-cryptographic hash for use in change detection and deduplication. We had been using a cryptographic hash (SHA-1), but it was unnecessarily slowing things down. That's because you were doing a potentially silly thing: hashing every byte. What does a hash tell you? If two hashes are different, it confirms that the objects are different. If two hashes are the same, they could be the same object or they could be different. For that purpose, you don't have to hash everything: just hash the areas where objects are likely to differ. If two 15 gigabyte files are likely to have differences in their first kilobyte, then hashing just first kilobyte (negligibly fast) will work just as well as hashing 15 gigabytes. If two files are of different length, then they are not the same. How about: hash(<length> + <first kilobyte> + <last kilobyte>) For deduplication, a 32 bit CRC could probably be reasonably efficient. No matter what hash you use, you have to verify the collisions. If CRC32 is enough to make false positives rare over your type of data set, it's good enough.
- cb321 5y agoThis is roughly how https://github.com/c-blake/cligen/blob/master/examples/dups.nim https://github.com/c-blake/cligen/blob/master/examples/dups.... can work. There is little question that changing the scale of the problem very much lessons performance sensitivity to the hash.
- andruc 5y ago"just hash the areas where objects are likely to differ" Correct me if I'm wrong but given these are art assets, wouldn't "determining where the objects are likely to differ" itself be an expensive/hard problem?
- daemin 5y agoOnce you need to load any parts of a file into memory you might as well compute the hash for all the bytes that you've loaded into memory. The act of loading the bytes from permanent storage (even NVME SSD) is likely to be many orders of magnitude slower than actually computing the hash. So it makes no sense to just "hash parts of the file" when in all likelihood the entire file will be getting loaded into memory even if you actively read only a few bytes from each 4k block.
- wiskinator 5y agoI love this website because I went to the link, didn't know what a PWA was, went to the root website and STILL don't know what a PWA is. I'm going to try the old trick of saying the wrong thing so someone corrects me. Clearly a PWA is a Pug With Attitude. Is this a Jonathon and Noodle sponsored app?
- bowmessage 5y agoI think you may have commented on the wrong article. (Did you mean to comment on "Publish Your PWAs to the iOS App Store" [0])? [0] https://news.ycombinator.com/item?id=29040793 https://news.ycombinator.com/item?id=29040793
- PebblesRox 5y agoA PWA is a Progressive Web App. https://developer.mozilla.org/en-US/docs/Web/Progressive_web_apps https://developer.mozilla.org/en-US/docs/Web/Progressive_web...
- snapetom 5y agoI've been using Hashids (https://hashids.org/ https://hashids.org/). It's been fine performance-wise and well supported across languages.
- andruc 5y agoCare to share your definition of fine, and give at least a ballpark on the size of the assets you're using it on?
- snapetom 5y agoIt's a pretty small app for some researchers. Front end is Angular, backend is an API in Bottle. At most, there's 10 people generating data, and about 40 people on reading data. Most times are 10 users uploading, and 5-10 users reading. The readers are external partners. Hashid is to obfuscate ids we have in another system so these external people cannot tie the data back due to privacy issues. It generates about 1000 rows of data across 4 PostGresql tables in a given day. I like how the algorithm has been well supported across languages. We have no problems with it on the Python side. An analyst runs monthly reports using R against the data (so about 30k records pulled. Numbers are summarized and stats are generated. The hashing isn't a bottleneck at all.
- cbsmith 5y agoAs noted in the post title, the original article is from 2018. I had either forgotten about Meow hash or just never knew about it, so I appreciate the post, but I was curious about the timing of the post.
- bmn__ 5y ago> I was curious about the timing of the post. cmuratori mentioned meowhash in passing in a recent (i.e. few days ago) Refterm or optimisation video. It is possible that user DeathArrow watched this, too, and decided to submit the project homepage to HN.