{"id":17658656,"url":"https://github.com/ruuda/fibint","last_synced_at":"2025-04-14T23:44:02.510Z","repository":{"id":17750887,"uuid":"20600289","full_name":"ruuda/fibint","owner":"ruuda","description":"Compute Fibonacci numbers efficiently using finite fields","archived":false,"fork":false,"pushed_at":"2020-05-01T19:09:00.000Z","size":23,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-14T23:43:58.453Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ruuda.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":"copying","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-06-07T18:51:21.000Z","updated_at":"2025-02-09T22:29:15.000Z","dependencies_parsed_at":"2022-09-24T18:43:30.413Z","dependency_job_id":null,"html_url":"https://github.com/ruuda/fibint","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ruuda%2Ffibint","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ruuda%2Ffibint/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ruuda%2Ffibint/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ruuda%2Ffibint/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ruuda","download_url":"https://codeload.github.com/ruuda/fibint/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248981259,"owners_count":21193143,"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":[],"created_at":"2024-10-23T15:28:00.209Z","updated_at":"2025-04-14T23:44:02.492Z","avatar_url":"https://github.com/ruuda.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"fibint\n======\nCompute Fibonacci numbers efficiently using finite fields. This allows for\nFibonacci numbers to be computed from a closed-form expression, by using only\ninteger arithmetic. For any integer width, this makes it possible to compute\nall Fibonacci numbers representable by that integer, without resorting to\nfloating-point numbers or wider integers.\n\nHow it works\n------------\nInstead of using the closed-form expression for computing the n-th Fibonacci\nnumber in the field of real numbers, it uses an analogous closed-form\nexpression in a finite field that is big enough to contain the largest\nrepresentable Fibonacci number.\n\nSee my [blog post](https://ruudvanasseldonk.com/2014/07/01/fibonacci-numbers-in-finite-fields)\nfor a more thorough explanation.\n\nLicence\n-------\nThis project is an implementation of a mathematical concept. The\nimplementation is licensed under the MIT license. See the file `copying`.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fruuda%2Ffibint","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fruuda%2Ffibint","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fruuda%2Ffibint/lists"}