{"id":15456548,"url":"https://github.com/tabcat/prollipop","last_synced_at":"2025-08-29T02:30:55.471Z","repository":{"id":234602202,"uuid":"766255826","full_name":"tabcat/prollipop","owner":"tabcat","description":"A modded Prolly-tree implementation in Typescript","archived":false,"fork":false,"pushed_at":"2025-05-08T07:01:00.000Z","size":783,"stargazers_count":13,"open_issues_count":3,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-05-08T08:20:03.830Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/tabcat.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":"2024-03-02T18:58:44.000Z","updated_at":"2025-05-08T07:01:04.000Z","dependencies_parsed_at":null,"dependency_job_id":"ed09f266-6e33-41b7-a5db-0d3fe321e272","html_url":"https://github.com/tabcat/prollipop","commit_stats":{"total_commits":298,"total_committers":1,"mean_commits":298.0,"dds":0.0,"last_synced_commit":"c6fafce7a9f32be92106f50cc6d343c6dd156aab"},"previous_names":["tabcat/dd-tree","tabcat/prollipop"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/tabcat/prollipop","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tabcat%2Fprollipop","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tabcat%2Fprollipop/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tabcat%2Fprollipop/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tabcat%2Fprollipop/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tabcat","download_url":"https://codeload.github.com/tabcat/prollipop/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tabcat%2Fprollipop/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272611569,"owners_count":24964380,"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-29T02:00:10.610Z","response_time":87,"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":[],"created_at":"2024-10-01T22:33:06.360Z","updated_at":"2025-08-29T02:30:55.455Z","avatar_url":"https://github.com/tabcat.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# prollipop 🍭\n\nA modded [Prolly-tree](https://www.dolthub.com/blog/2024-03-03-prolly-trees/) implementation in Typescript.\n\n## Features\n\n- **Efficient diff** - yields entry and bucket diffs!\n- **Powerful cursor api** - climb 🌳s like a pro\n- **Structural validation** - codec is aware of tree context\n\n## Project Status\n\nIt's in a decent state but have not done performance analysis. API breaks will result in major version change.\n\nI haven't tested with non-local blockstores. Things may not work well with networked blockstores.\n\n## Data-structure\n\nThis package implements a modded prolly-tree in Typescript. Most relevant code is in [`src/mutate.ts`](https://github.com/tabcat/prollipop/blob/master/src/mutate.ts) and [`src/diff.ts`](https://github.com/tabcat/prollipop/blob/master/src/diff.ts).\n\nmods:\n\n- (number, uint8array) tuples for keys\n- right-side backbone\n- key-defined boundaries instead of rolling-hash\n\n## Install\n\n`npm install prollipop`\n\n## Build\n\n`pnpm install \u0026\u0026 pnpm build`\n\n## Usage\n\n**See [usage.test.ts](https://github.com/tabcat/prollipop/blob/master/test/usage.test.ts)!!!**\n\n**API [docs](https://tabcat.github.io/prollipop/)**\n\n**Example [database](https://github.com/tabcat/prollipop/blob/master/src/database.ts)**\n\n## Learning Resources:\n\nAs you can see from the list below, a lot of ideas have been stolen from the [Dolt](https://www.dolthub.com/) project's blog so be sure to check them out!\n\n- [Prolly Trees](https://www.dolthub.com/blog/2024-03-03-prolly-trees/)\n  - author: [Tim Sehn](https://github.com/timsehn)\n  - implementation: [dolt](https://github.com/dolthub/dolt)\n  - relevance: great introduction to prolly-trees\n\n- [Prolly Tree PoC and technical writeup](https://github.com/waku-org/research/issues/78)\n  - author: [ABresting](https://github.com/ABresting)\n  - implementation: [Prolly-tree-Waku-Message](https://github.com/ABresting/Prolly-Tree-Waku-Message)\n  - relevance: Custom implementation of prolly-tree with right side backbone\n\n- [Merklizing the key/value store for fun and profit](https://joelgustafson.com/posts/2023-05-04/merklizing-the-key-value-store-for-fun-and-profit)\n  - author: [Joel Gustafson](https://joelgustafson.com/)\n  - implementation: [okra-js](https://github.com/canvasxyz/okra-js/tree/main/packages/okra)\n  - relevance: content-defined merkle trees: A node is the first child of its parent if u32(node.hash[0..4]) \u003c (2^32 / Q).\n\n- [Efficient Diff on Prolly-trees](https://www.dolthub.com/blog/2020-06-16-efficient-diff-on-prolly-trees/)\n  - author: [Aaron Son](https://github.com/reltuk)\n  - implementation: [dolt](https://github.com/dolthub/dolt)\n  - relevance: excellent visual examples for prolly-tree diffs\n\n- [Only Consider Keys](https://docs.dolthub.com/architecture/storage-engine/prolly-tree#only-consider-keys)\n  - author: [Tim Sehn](https://github.com/timsehn)\n  - implementation: [dolt](https://github.com/dolthub/dolt)\n  - relevance: only consider keys for chunk boundary, not keys + values\n\n- [Range-Based Set Reconciliation](https://logperiodic.com/rbsr.html)\n  - author: [Doug Hoyte](https://hoytech.com/about)\n  - relevance: Negantrophy section uses [number, hash] tuples as keys\n\n### Additional Resources:\n\n- https://github.com/canvasxyz/okra?tab=readme-ov-file#design\n- https://github.com/ipld/ipld/blob/prolly-trees/specs/advanced-data-layouts/prollytree/spec.md\n- https://github.com/mikeal/prolly-trees\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftabcat%2Fprollipop","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftabcat%2Fprollipop","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftabcat%2Fprollipop/lists"}