{"id":30325752,"url":"https://github.com/torao/slate","last_synced_at":"2026-05-20T07:05:01.669Z","repository":{"id":146622381,"uuid":"359104931","full_name":"torao/slate","owner":"torao","description":"Slate: Reference implementation of Stratified Hash Tree, an immutable and appendable hash tree (Merkle tree).","archived":false,"fork":false,"pushed_at":"2025-09-24T00:47:54.000Z","size":1310,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-28T06:20:09.933Z","etag":null,"topics":["blockchain","data-structures","database","hash","merkle-tree","merkletree"],"latest_commit_sha":null,"homepage":"https://hazm.at/mox/algorithm/structural-algorithm/stratified-hash-tree/index.html","language":"Rust","has_issues":true,"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/torao.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2021-04-18T09:56:30.000Z","updated_at":"2025-09-24T00:47:58.000Z","dependencies_parsed_at":"2025-12-26T19:00:50.488Z","dependency_job_id":null,"html_url":"https://github.com/torao/slate","commit_stats":null,"previous_names":["torao/banded-hash-tree","torao/stratified-hash-tree","torao/slate"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/torao/slate","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torao%2Fslate","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torao%2Fslate/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torao%2Fslate/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torao%2Fslate/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/torao","download_url":"https://codeload.github.com/torao/slate/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/torao%2Fslate/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31766465,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-13T15:25:13.801Z","status":"ssl_error","status_checked_at":"2026-04-13T15:25:09.162Z","response_time":93,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["blockchain","data-structures","database","hash","merkle-tree","merkletree"],"created_at":"2025-08-17T23:07:39.326Z","updated_at":"2026-05-20T07:05:01.664Z","avatar_url":"https://github.com/torao.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Slate: Stratified Hash Tree\n\n[![Build](https://github.com/torao/stratified-hash-tree/actions/workflows/build.yml/badge.svg)](https://github.com/torao/stratified-hash-tree/actions/workflows/build.yml)\n\nこのクレートは時間的局所性を持ち不変で木構造の完全な履歴を保持する効率的な追記指向のハッシュツリー (Merkle Tree) 構造である Stratified Hash Tree について説明します (同様のデータ構造やアルゴリズム十分に調査したわけではないが、ここで述べるアルゴリズムに関する呼称や研究などを見つけられていないため、ここでは SLATE という名前で呼びます)。これはログ構造のデータベースとして使用することができる。\n\n## Slate の特徴\n\n* 時系列データのように追加のみが行われるリスト構造。\n* データの追加位置を示すインデックスにツリー構造を構築する。このツリー構造は不変であり、ハッシュツリー (Merkle Tree) として使用する\n  ことによってデータの破損や改ざんを検出することができる。\n* データの増加によってツリーは成長する。ただし、ツリー構造の完全な履歴を保持していることから、ある時点でのハッシュツリーをいつでも参照することが\n  できる。\n* append, read, range scan, full scan 操作が可能。delete はハッシュ値のみを残し削除することはできる。\n\n## Append\n\n![append operations from 1 to 16 on the Stratified Hash Tree](docs/slate.gif)\n\n## How to build, test, and benchmark\n\n```shell\nrustup default stable\ncargo build\ncargo test\ncargo bench\nsamply record cargo bench\n```\n\nThe benchamrks have been moved to a different repository.\n\n* \u003chttps://github.com/torao/slate-benchamrk\u003e\n\n## See Also\n\n* [My personal research page for more detail](https://hazm.at/mox/algorithm/structural-algorithm/stratified-hash-tree/index.html).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftorao%2Fslate","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftorao%2Fslate","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftorao%2Fslate/lists"}