{"openapi":"3.1.0","info":{"title":"Fast Hash API","version":"1.0.0","description":"Non-cryptographic hash functions — the fast hashes used in hash tables, bloom filters, sharding, deduplication and cache keys. Give it text (UTF-8) or raw bytes as hex and it returns the digest under every algorithm at once, or under one named algorithm: FNV-1 and FNV-1a (32- and 64-bit), djb2, sdbm, Jenkins one-at-a-time, CRC-16 (CCITT-FALSE and ARC/IBM), Fletcher-16 and Fletcher-32, and MurmurHash3 (x86 32-bit, with an optional seed). Each digest is returned in hex and as an unsigned integer. Everything is computed locally and deterministically, so the same input always maps to the same hash — exactly what you need for stable bucketing and lookups. These are deliberately NOT for security: they are fast and well-distributed, not collision-resistant. Ideal for hash-table and bloom-filter implementations, consistent sharding and partitioning, cache and dedup keys, A/B bucketing, and teaching how hashing works. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. For cryptographic hashes (SHA, MD5, HMAC) use a hash API, and for CRC-32/Adler-32 integrity checksums use a checksum API.","contact":{"name":"PremiumApi","url":"https://www.oanor.com/by/premiumapi"}},"servers":[{"url":"https://api.oanor.com/fasthash-api","description":"oanor gateway"}],"tags":[{"name":"Hash"},{"name":"Meta"}],"components":{"securitySchemes":{"oanorKey":{"type":"apiKey","in":"header","name":"x-oanor-key","description":"Get your key at https://www.oanor.com/developer/keys"}}},"security":[{"oanorKey":[]}],"paths":{"/v1/algorithm":{"get":{"operationId":"get_v1_algorithm","tags":["Hash"],"summary":"Hash with one algorithm","description":"","parameters":[{"name":"algorithm","in":"query","required":true,"description":"e.g. fnv1a_32, murmur3_32, crc16_ccitt","schema":{"type":"string"},"example":"crc16_ccitt"},{"name":"text","in":"query","required":false,"description":"Text","schema":{"type":"string"},"example":"123456789"},{"name":"hex","in":"query","required":false,"description":"Or hex","schema":{"type":"string"}},{"name":"seed","in":"query","required":false,"description":"Seed for murmur3","schema":{"type":"string"},"example":"0"}],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"hex":"29b1","bits":16,"uint":10673,"algorithm":"crc16_ccitt","input_bytes":9},"meta":{"timestamp":"2026-06-03T17:42:14.612Z","request_id":"c3e47f0c-26b8-4da3-8c61-eb1096bfd948"},"status":"ok","message":"Hash (one algorithm)","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}},"/v1/hash":{"get":{"operationId":"get_v1_hash","tags":["Hash"],"summary":"Hash with every algorithm","description":"","parameters":[{"name":"text","in":"query","required":false,"description":"Text to hash (UTF-8)","schema":{"type":"string"},"example":"foobar"},{"name":"hex","in":"query","required":false,"description":"Or raw bytes as hex","schema":{"type":"string"}},{"name":"seed","in":"query","required":false,"description":"Seed for murmur3 (default 0)","schema":{"type":"string"},"example":"0"}],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"hashes":{"djb2":{"hex":"fde460be","uint":4259602622},"sdbm":{"hex":"a6437b0d","uint":2789440269},"fnv1_32":{"hex":"31f0b262","uint":837857890},"fnv1_64":{"hex":"340d8765a4dda9c2","uint":"3750802935296928194"},"fnv1a_32":{"hex":"bf9cf968","uint":3214735720},"fnv1a_64":{"hex":"85944171f73967e8","uint":"9625390261332436968"},"crc16_arc":{"hex":"b0c8","uint":45256},"fletcher16":{"hex":"ad7b","uint":44411},"fletcher32":{"hex":"85734437","uint":2238923831},"murmur3_32":{"hex":"a4c4d4bd","seed":0,"uint":2764362941},"crc16_ccitt":{"hex":"be35","uint":48693},"jenkins_oat":{"hex":"f952fde7","uint":4182965735}},"input_bytes":6,"seed_for_murmur3":0},"meta":{"timestamp":"2026-06-03T17:42:14.719Z","request_id":"59d63834-e84c-4779-9fd9-201fb8c6d086"},"status":"ok","message":"Hash (all algorithms)","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}},"/v1/meta":{"get":{"operationId":"get_v1_meta","tags":["Meta"],"summary":"Spec","description":"","parameters":[],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"name":"Fast Hash API","notes":"Non-cryptographic — do not use for passwords, signatures or integrity against tampering. MurmurHash3 is x86_32. Nothing is stored.","version":"v1","endpoints":[{"path":"/v1/hash","params":{"hex":"or raw bytes as hex","seed":"seed for murmur3 (default 0)","text":"text to hash (UTF-8)"},"returns":"every algorithm's digest"},{"path":"/v1/algorithm","params":{"seed":"for murmur3","text":"or hex","algorithm":"one of the listed names"},"returns":"that one algorithm's digest"},{"path":"/v1/meta","params":[],"returns":"this document"}],"algorithms":["fnv1_32","fnv1a_32","fnv1_64","fnv1a_64","djb2","sdbm","jenkins_oat","crc16_ccitt","crc16_arc","fletcher16","fletcher32","murmur3_32"],"description":"Non-cryptographic hash functions — the fast hashes used in hash tables, bloom filters, sharding, deduplication and cache keys. Give it text (UTF-8) or raw bytes as hex and it returns the digest under every algorithm at once, or under one named algorithm: FNV-1 and FNV-1a (32- and 64-bit), djb2, sdbm, Jenkins one-at-a-time, CRC-16 (CCITT-FALSE and ARC/IBM), Fletcher-16 and Fletcher-32, and MurmurHash3 (x86 32-bit, with an optional seed). Each digest is returned in hex and as an unsigned integer. Everything is computed locally and deterministically, so the same input always maps to the same hash — exactly what you need for stable bucketing and lookups. These are NOT for security: they are fast and well-distributed, not collision-resistant. Ideal for hash-table and bloom-filter implementations, consistent sharding, cache and dedup keys, A/B bucketing, and teaching how hashing works. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. For cryptographic hashes (SHA, MD5, HMAC) use a hash API, and for CRC-32/Adler-32 integrity checksums use a checksum API."},"meta":{"timestamp":"2026-06-03T17:42:14.824Z","request_id":"10e7e2a8-41ae-4d93-b44c-71522248f481"},"status":"ok","message":"Meta","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}}},"x-oanor-pricing":[{"slug":"free","name":"Free","price_cents_month":0,"monthly_call_quota":6135,"rps_limit":2,"hard_limit":true},{"slug":"starter","name":"Starter","price_cents_month":765,"monthly_call_quota":15650,"rps_limit":8,"hard_limit":true},{"slug":"pro","name":"Pro","price_cents_month":2755,"monthly_call_quota":207500,"rps_limit":20,"hard_limit":true},{"slug":"mega","name":"Mega","price_cents_month":6555,"monthly_call_quota":1080000,"rps_limit":50,"hard_limit":true}],"x-oanor-marketplace-url":"https://www.oanor.com/api/fasthash-api"}