{"id":20079739,"url":"https://github.com/grachale/search_collisions_sha-512","last_synced_at":"2026-07-08T13:31:00.119Z","repository":{"id":184914478,"uuid":"672674802","full_name":"grachale/search_collisions_SHA-512","owner":"grachale","description":"The provided task is to implement a function or a set of functions for a program designed to find any message whose SHA-512 hash begins with a sequence of zero bits when represented from the leftmost side. In other words, the goal is to locate a message that produces a SHA-512 hash with a leading sequence of zeros.","archived":false,"fork":false,"pushed_at":"2023-07-30T22:11:47.000Z","size":12,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-02T13:23:04.692Z","etag":null,"topics":["cpp","hashfunctions","mathematica","openssl"],"latest_commit_sha":null,"homepage":"","language":"Mathematica","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/grachale.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-07-30T21:59:51.000Z","updated_at":"2023-07-31T19:34:35.000Z","dependencies_parsed_at":"2023-07-30T23:29:26.089Z","dependency_job_id":null,"html_url":"https://github.com/grachale/search_collisions_SHA-512","commit_stats":null,"previous_names":["grachale/search_collisions_sha-512"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/grachale/search_collisions_SHA-512","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grachale%2Fsearch_collisions_SHA-512","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grachale%2Fsearch_collisions_SHA-512/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grachale%2Fsearch_collisions_SHA-512/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grachale%2Fsearch_collisions_SHA-512/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/grachale","download_url":"https://codeload.github.com/grachale/search_collisions_SHA-512/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grachale%2Fsearch_collisions_SHA-512/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35266857,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-08T02:00:06.796Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["cpp","hashfunctions","mathematica","openssl"],"created_at":"2024-11-13T15:24:25.198Z","updated_at":"2026-07-08T13:31:00.082Z","avatar_url":"https://github.com/grachale.png","language":"Mathematica","funding_links":[],"categories":[],"sub_categories":[],"readme":"#  Zero-Bit Prefix Hash of SHA-512 Finder\nThe provided task is to implement a function or a set of functions for a program designed to find any message whose SHA-512 hash begins with a sequence of zero bits when represented from the leftmost side. In other words, the goal is to locate a message that produces a SHA-512 hash with a leading sequence of zeros.\n\n## Details\n\nThis repository contains an implementation of a program to find a message whose SHA-512 hash begins with a sequence of zero bits when represented in big-endian format. In big-endian representation, the bits are ordered from most significant bit (MSB) to least significant bit (LSB), where Byte 0 starts with MSB and ends with LSB, Byte 1 starts with MSB and ends with LSB, and so on until the last byte.\n\nFor example, if two leading zero bits are required, the corresponding byte would be 0010 0111 (0x27).\n\n### Function Parameters\n\nint findHash(int bits, char **message, char **hash)\n\n*bits: The desired number of zero bits in the hash.\n\nmessage: An output parameter containing data for which the corresponding hash was found. The result is stored as a dynamically allocated hexadecimal C string (terminated with \\0).\n\nhash: An output parameter representing the hash of the message from the previous parameter. It is also a dynamically allocated hexadecimal C string.\n\nReturn Value: The function returns 1 on success, 0 on failure or incorrect parameters (e.g., an invalid number of zero bits).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrachale%2Fsearch_collisions_sha-512","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgrachale%2Fsearch_collisions_sha-512","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrachale%2Fsearch_collisions_sha-512/lists"}