{"id":16572749,"url":"https://github.com/lemire/stronglyuniversalstringhashing","last_synced_at":"2025-04-05T16:08:24.895Z","repository":{"id":66054946,"uuid":"10040230","full_name":"lemire/StronglyUniversalStringHashing","owner":"lemire","description":"Benchmark showing the we can randomly hash strings very quickly with good universality ","archived":false,"fork":false,"pushed_at":"2025-01-23T21:02:23.000Z","size":562,"stargazers_count":136,"open_issues_count":3,"forks_count":12,"subscribers_count":10,"default_branch":"master","last_synced_at":"2025-03-29T15:07:59.647Z","etag":null,"topics":["hashing","universality"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lemire.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2013-05-13T20:13:50.000Z","updated_at":"2025-02-18T07:34:10.000Z","dependencies_parsed_at":null,"dependency_job_id":"5aa499e9-b1b0-4717-aac9-2b3b804523a3","html_url":"https://github.com/lemire/StronglyUniversalStringHashing","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2FStronglyUniversalStringHashing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2FStronglyUniversalStringHashing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2FStronglyUniversalStringHashing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lemire%2FStronglyUniversalStringHashing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lemire","download_url":"https://codeload.github.com/lemire/StronglyUniversalStringHashing/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247361690,"owners_count":20926643,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["hashing","universality"],"created_at":"2024-10-11T21:28:29.709Z","updated_at":"2025-04-05T16:08:24.864Z","avatar_url":"https://github.com/lemire.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"StronglyUniversalStringHashing\n==============================\n\nVery fast [universal hash\nfamilies](https://en.wikipedia.org/wiki/Universal_hashing) on strings.\n\nSample results on a regular x64 (Skylake) processor:\n```\nGoogle's City                        CPU cycle/byte = 0.216047 \t \n64-bit VHASH                         CPU cycle/byte = 0.215097 \t \n64-bit CLHASH                        CPU cycle/byte = 0.091786 \t\nSipHash                              CPU cycle/byte = 1.414069\n```\n\n\nThis software includes the experimental code from the following research papers...\n\n\n* Daniel Lemire and Owen\nKaser, [Faster 64-bit universal hashing using carry-less\nmultiplications](http://arxiv.org/abs/1503.03465), Journal of Cryptographic Engineering 6 (3), 2016.\n* Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire, [Regular and almost universal hashing: an efficient implementation](https://arxiv.org/abs/1609.09840), Software: Practice and Experience (to appear).\n* Owen Kaser and Daniel Lemire, [Strongly universal string hashing is fast](http://arxiv.org/abs/1202.4961), Computer Journal (2014) 57 (11): 1624-1638.\n\nAcknowledgements\n==================\n\nThanks to Nathan Kurz for noticing that GCC 4.7 requires\nno-tree-vectorize to produce correct results.\n\nUsage\n======\n\nTo test speed:\n\n    make benchmark-target\n    # disable some processor features that add noise to benchmarks:\n    cd scripts/; sudo ./master.sh; cd ..\n    ./benchmark/benchmark.exe\n    ./benchmark/variablelengthbenchmark.exe\n\nTo test correctness of hash functions using PCLMULQDQ:\n\n    make test-target\n    for test in ./test/correctness/*.exe; do $test; done\n\nOr more simply...\n\n    ./run_unit.sh\n\nRelated projects\n=================\n\nThere is a very simple clhash library in C: https://github.com/lemire/clhash\n\nFor a project with similar goals, see: https://github.com/lemire/fasthashing\n\nLicensing\n==========\n\nThis project is licenced as described in the LICENSE file, with the\nfollowing exceptions for code written by other authors:\n\n  * smhasher and CityHash are MIT licensed.\n\n  * VHASH and siphash are public domain.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flemire%2Fstronglyuniversalstringhashing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flemire%2Fstronglyuniversalstringhashing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flemire%2Fstronglyuniversalstringhashing/lists"}