{"id":13788463,"url":"https://github.com/0xPolygonZero/plonky","last_synced_at":"2025-05-12T02:33:22.039Z","repository":{"id":49735436,"uuid":"238273021","full_name":"0xPolygonZero/plonky","owner":"0xPolygonZero","description":"Recursive SNARKs based on Plonk and Halo","archived":true,"fork":false,"pushed_at":"2021-10-19T22:10:35.000Z","size":857,"stargazers_count":115,"open_issues_count":8,"forks_count":13,"subscribers_count":8,"default_branch":"master","last_synced_at":"2025-02-21T07:02:17.292Z","etag":null,"topics":["cryptography","halo","plonk","zk-snarks"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/0xPolygonZero.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}},"created_at":"2020-02-04T18:12:18.000Z","updated_at":"2025-02-06T14:42:33.000Z","dependencies_parsed_at":"2022-08-27T07:10:48.449Z","dependency_job_id":null,"html_url":"https://github.com/0xPolygonZero/plonky","commit_stats":null,"previous_names":["0xpolygonzero/plonky","mir-protocol/plonky"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0xPolygonZero%2Fplonky","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0xPolygonZero%2Fplonky/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0xPolygonZero%2Fplonky/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/0xPolygonZero%2Fplonky/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/0xPolygonZero","download_url":"https://codeload.github.com/0xPolygonZero/plonky/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253662800,"owners_count":21944133,"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":["cryptography","halo","plonk","zk-snarks"],"created_at":"2024-08-03T21:00:47.242Z","updated_at":"2025-05-12T02:33:21.634Z","avatar_url":"https://github.com/0xPolygonZero.png","language":"Rust","funding_links":[],"categories":["Implementations"],"sub_categories":[],"readme":"# Plonky\n\nPlonky is a prototype implementation of recursive arguments. It is loosely based on [PLONK](https://eprint.iacr.org/2019/953), with a few customizations:\n\n* While PLONK uses [KZG](https://www.iacr.org/cryptodb/data/paper.php?pubkey=23846)'s pairing-based polynomial commitment scheme, we use a batched variant of the [Halo](https://eprint.iacr.org/2019/1021) technique to recursively verify discrete log based polynomial commitments.\n* The standard PLONK model was designed for arithmetic circuits; it uses a single constraint to verify additive and multiplicative relationships. We use a variety of custom gates, such as a gate which performs a step of a [Rescue](https://eprint.iacr.org/2019/426) permutation. The maximum degree of our constraints is 8, compared to 3 in standard PLONK.\n* In standard PLONK, each gate interacts with three wires, which are typically thought of as two input wires and one output wire. We use a much higher arity -- 9 wires per gate -- although only 6 of them are involved in the permutation argument. The other 3 can be thought of as \"advice\" wires.\n* The zero-knowledge technique in the Plonk paper would cause each witness polynomial's degree to slightly exceed a power of two, which doesn't work well with Halo. We use a [different blinding method](https://mirprotocol.org/blog/Adding-zero-knowledge-to-Plonk-Halo).\n\nFor more details, see [Fast recursive arguments based on Plonk and Halo](https://mirprotocol.org/blog/Fast-recursive-arguments-based-on-Plonk-and-Halo).\n\n\n## Disclaimer\n\nThis code has not been thoroughly reviewed or tested, and should not be used in any production systems.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F0xPolygonZero%2Fplonky","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F0xPolygonZero%2Fplonky","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F0xPolygonZero%2Fplonky/lists"}