{"id":20392775,"url":"https://github.com/g3th/chuck-norris-cipher","last_synced_at":"2025-08-28T12:11:28.797Z","repository":{"id":162782498,"uuid":"637277799","full_name":"g3th/Chuck-Norris-Cipher","owner":"g3th","description":"Chuck Norris unary cipher puzzle coded in Kotlin.","archived":false,"fork":false,"pushed_at":"2023-05-08T16:13:44.000Z","size":5,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-05T00:27:48.438Z","etag":null,"topics":["chuck-norris","chuck-norris-cipher","code-puzzle","encrypt","kotlin"],"latest_commit_sha":null,"homepage":"","language":"Kotlin","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/g3th.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-07T03:51:08.000Z","updated_at":"2023-05-07T03:55:01.000Z","dependencies_parsed_at":"2023-05-28T08:30:25.894Z","dependency_job_id":null,"html_url":"https://github.com/g3th/Chuck-Norris-Cipher","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/g3th/Chuck-Norris-Cipher","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FChuck-Norris-Cipher","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FChuck-Norris-Cipher/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FChuck-Norris-Cipher/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FChuck-Norris-Cipher/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/g3th","download_url":"https://codeload.github.com/g3th/Chuck-Norris-Cipher/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FChuck-Norris-Cipher/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272497051,"owners_count":24944614,"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","status":"online","status_checked_at":"2025-08-28T02:00:10.768Z","response_time":74,"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":["chuck-norris","chuck-norris-cipher","code-puzzle","encrypt","kotlin"],"created_at":"2024-11-15T03:45:41.324Z","updated_at":"2025-08-28T12:11:28.733Z","avatar_url":"https://github.com/g3th.png","language":"Kotlin","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Chuck Norris Encryption\n## The Chuck Norris Unary cipher in Kotlin\n### Now With Included Decrypter Function for $0.00!\n\nThis is a common code puzzle found on a number of sites (Codewars, Leetcode etc..) and consists of encrypting words or a series of characters using only 0s. The characters are first converted to a binary string 7 bits long (i.e. 1001010), which is the length of ASCII character codes. These binary strings are then joined into a single string and form the input for the encrypting function. \n\nThe rules of the cipher dictate that the first occurrence of:\n\n1 (bit on) == 0 + a space\n\n0 (bit off) == 00 + a space\n\n\nThen, each subsequent recurring 1 or 0 will not include a space until a different digit occurs. These digits will indicate the total number of 1/0s until the sequence breaks. Example:\n\n1100110 would be: 0 00 (two 1s) 00 00 (two 0s) 0 00 (two 1s) 00 0 (one zero)\n\nThis script allows the user to choose a mode, and it includes a decrypter function which will decode a Chuck-Norris encoded string to a human-discernible message. There is also error handling which checks for illegal strings in both modes.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fg3th%2Fchuck-norris-cipher","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fg3th%2Fchuck-norris-cipher","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fg3th%2Fchuck-norris-cipher/lists"}