{"id":30012646,"url":"https://github.com/namada-net/leanbridgetree","last_synced_at":"2025-08-05T14:13:50.973Z","repository":{"id":307261043,"uuid":"1028902522","full_name":"namada-net/leanbridgetree","owner":"namada-net","description":"Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves.","archived":false,"fork":false,"pushed_at":"2025-07-30T10:05:04.000Z","size":31,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-07-30T10:39:37.171Z","etag":null,"topics":["append-only","merkle-proof","merkle-tree","rust","space-efficient"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/namada-net.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"COPYING.md","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,"zenodo":null}},"created_at":"2025-07-30T08:24:44.000Z","updated_at":"2025-07-30T10:05:08.000Z","dependencies_parsed_at":"2025-08-01T11:00:33.438Z","dependency_job_id":null,"html_url":"https://github.com/namada-net/leanbridgetree","commit_stats":null,"previous_names":["namada-net/leanbridgetree"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/namada-net/leanbridgetree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namada-net%2Fleanbridgetree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namada-net%2Fleanbridgetree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namada-net%2Fleanbridgetree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namada-net%2Fleanbridgetree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/namada-net","download_url":"https://codeload.github.com/namada-net/leanbridgetree/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/namada-net%2Fleanbridgetree/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268910476,"owners_count":24327519,"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-05T02:00:12.334Z","response_time":2576,"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":["append-only","merkle-proof","merkle-tree","rust","space-efficient"],"created_at":"2025-08-05T14:13:49.814Z","updated_at":"2025-08-05T14:13:50.949Z","avatar_url":"https://github.com/namada-net.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# `leanbridgetree`\n\nThis is a Rust crate that provides an implementation of an append-only Merkle\ntree structure. Individual leaves of the merkle tree may be marked such that\nwitnesses will be maintained for the marked leaves as additional nodes are\nappended to the tree, but leaf and node data not specifically required to\nmaintain these witnesses is not retained, for space efficiency.\n\nThe crate also supports using \"bridges\" containing the minimal possible amount\nof data to advance witnesses for marked leaves data up to the latest state of\nthe tree without having to append each intermediate leaf individually, given\na bridge between the desired states computed by an outside source. The state\nof the tree is internally represented as a set of such bridges.\n\n## [`Documentation`](https://docs.rs/leanbridgetree)\n\n## License\n\nLicensed under either of\n\n * Apache License, Version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or\n   http://www.apache.org/licenses/LICENSE-2.0)\n * MIT license ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)\n\nat your option.\n\n### Contribution\n\nUnless you explicitly state otherwise, any contribution intentionally submitted\nfor inclusion in the work by you, as defined in the Apache-2.0 license, shall\nbe dual licensed as above, without any additional terms or conditions.\n\n## Original work\n\nThis crate is a heavily modified fork of the excellent [`bridgetree`] crate from\nZcash Zebra. The fork started by creating a new commit history from the tree at\n`b93e70980009caa857d244e7c4c8f1992bd4a478` in the original repository.\n\n[`bridgetree`]: https://github.com/zcash/incrementalmerkletree/tree/main/bridgetree\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnamada-net%2Fleanbridgetree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnamada-net%2Fleanbridgetree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnamada-net%2Fleanbridgetree/lists"}