{"id":51197830,"url":"https://github.com/samuraiwriter7/computational-pranayama-protocol","last_synced_at":"2026-06-27T22:02:38.241Z","repository":{"id":367607668,"uuid":"1281554029","full_name":"SamuraiWriter7/Computational-Pranayama-Protocol","owner":"SamuraiWriter7","description":"Computational Pranayama Protocol is a protocol for reducing wasteful AI computation by aligning inputs and outputs, reusing prior computation patterns, pausing unnecessary external calls, and routing tasks to the lightest sufficient execution layer.","archived":false,"fork":false,"pushed_at":"2026-06-26T18:11:15.000Z","size":98,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-06-26T19:10:05.349Z","etag":null,"topics":["ai-protocol","breath-core","computational-pranayama","compute-breathing","local-first","royalty-os","trace-receipt"],"latest_commit_sha":null,"homepage":"","language":"Python","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/SamuraiWriter7.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","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":"2026-06-26T17:12:13.000Z","updated_at":"2026-06-26T18:11:19.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/SamuraiWriter7/Computational-Pranayama-Protocol","commit_stats":null,"previous_names":["samuraiwriter7/computational-pranayama-protocol"],"tags_count":5,"template":false,"template_full_name":null,"purl":"pkg:github/SamuraiWriter7/Computational-Pranayama-Protocol","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SamuraiWriter7%2FComputational-Pranayama-Protocol","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SamuraiWriter7%2FComputational-Pranayama-Protocol/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SamuraiWriter7%2FComputational-Pranayama-Protocol/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SamuraiWriter7%2FComputational-Pranayama-Protocol/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SamuraiWriter7","download_url":"https://codeload.github.com/SamuraiWriter7/Computational-Pranayama-Protocol/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SamuraiWriter7%2FComputational-Pranayama-Protocol/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34869004,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-27T02:00:06.362Z","response_time":126,"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":["ai-protocol","breath-core","computational-pranayama","compute-breathing","local-first","royalty-os","trace-receipt"],"created_at":"2026-06-27T22:02:37.476Z","updated_at":"2026-06-27T22:02:38.234Z","avatar_url":"https://github.com/SamuraiWriter7.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Computational Pranayama Protocol\n\nComputational Pranayama Protocol is a minimal protocol for regulating AI computation as breath.\n\nIt reduces wasteful computation by aligning input and output, reusing prior computation patterns, pausing unnecessary external calls, avoiding redundant recomputation, routing tasks to the lightest sufficient execution layer, linking computation to traceable origin and path, and connecting saved computation to value return.\n\nThe goal is not to make AI think more.\n\nThe goal is to make AI compute only what is necessary, where it is necessary, when it is necessary, and with traceable accountability.\n\n## Core Principle\n\n\u003e Do not recompute what has already become a traceable pattern.\n\nCompute like wind:\n\n* light\n* local\n* sufficient\n* traceable\n* non-redundant\n* accountable\n\n## 日本語概要\n\n計算調息プロトコルは、AIの計算を「呼吸」として扱い、過剰生成・重複推論・不要なクラウド依存を抑えるための最小プロトコルです。\n\n目的は、AIにもっと考えさせることではありません。\n\n必要な計算だけを、必要な場所で、必要な量だけ行うことです。\n\n一度「型」として成立した計算は、毎回ゼロから再計算しない。\n\nそして、その計算がどこから来て、どこを通り、何を出力したのかを痕跡として残す。\n\nさらに、節約された計算資源や再利用された型、追跡可能な震源貢献を、価値還流へ接続する。\n\n風のように、軽く、局所的に、痕跡を残し、震源へ還流する計算を目指します。\n\n## v0.1 Positioning\n\nv0.1 defines the **Computational Breath Cycle**.\n\nA Computational Breath Cycle is the smallest recordable unit of regulated AI computation.\n\nIt represents one cycle of:\n\n1. receiving input\n2. checking output balance\n3. reusing prior patterns\n4. pausing unnecessary external computation\n5. routing to the lightest sufficient execution layer\n6. producing only the necessary output\n7. attaching trace\n\nIn this version, the protocol does not attempt to control all AI infrastructure.\n\nInstead, it defines a minimal structure for observing and validating whether a single act of computation is aligned, non-redundant, and sufficiently lightweight.\n\n## v0.2 Positioning\n\nv0.2 introduces the **Kata Memory Record**.\n\nA Kata Memory Record captures a reusable computation pattern that should not be recomputed from scratch once it has become stable and traceable.\n\nThis expands the v0.1 Reuse Gate into a standalone reusable pattern layer.\n\nThe purpose is to reduce redundant AI computation by storing reusable structures such as:\n\n* protocol definition patterns\n* release note patterns\n* schema design patterns\n* validation flow patterns\n* reasoning templates\n* output formatting patterns\n\nThe core question of v0.2 is:\n\n\u003e Has this computation already become a reusable kata?\n\nIf yes, the system should reuse the existing pattern and compute only the necessary delta.\n\n## v0.3 Positioning\n\nv0.3 introduces the **Edge First Routing Decision**.\n\nAn Edge First Routing Decision records how a computation task is routed to the lightest sufficient execution layer.\n\nThis expands the v0.1 Routing Gate into a standalone routing layer.\n\nThe purpose is to reduce unnecessary cloud or frontier-model usage by asking:\n\n\u003e What is the lightest sufficient place to compute this task?\n\nThe protocol prefers lower-cost, lower-energy, and more local execution layers before escalating to heavier compute.\n\nCloud or frontier-model escalation is not forbidden.\n\nHowever, escalation must have a reason.\n\n## v0.4 Positioning\n\nv0.4 introduces the **Breath Trace Link**.\n\nA Breath Trace Link connects regulated computation records in the Computational Pranayama Protocol with external trace records, such as AI search trace receipts, source contribution graphs, or other trace-compatible audit records.\n\nThis expands the trace requirement used in earlier versions into a standalone trace-linking layer.\n\nThe purpose is to ensure that regulated computation does not disappear as untraceable output.\n\nThe core question of v0.4 is:\n\n\u003e Can this computation be linked to a traceable origin, path, and output?\n\nIf yes, the computation can be treated as part of a traceable flow.\n\nIf not, the system should mark the trace gap and require review or reconstruction.\n\n## v0.5 Positioning\n\nv0.5 introduces the **Compute Royalty Link**.\n\nA Compute Royalty Link connects regulated computation, reusable kata, routing decisions, and trace links with compute access and value return policies.\n\nThis expands the protocol from computation control into computation accountability.\n\nThe purpose is to ensure that reduced computation, reused patterns, and traceable origins can be connected to value return systems such as Royalty OS, compute access policies, or contribution-based allocation records.\n\nThe core question of v0.5 is:\n\n\u003e If computation was saved, reused, or derived from a traceable origin, how should value return be linked?\n\nThe protocol does not define a full payment system in v0.5.\n\nInstead, it defines the minimal link between:\n\n* regulated computation\n* avoided recomputation\n* avoided cloud escalation\n* reusable kata\n* traceable origin\n* compute access policy\n* value return candidate\n\n## v0.3 Routing Order\n\n```text\nlocal\nedge_npu\nsmall_model\ncloud\nfrontier_model\n```\n\nThe system should escalate only when the lower layer is insufficient.\n\n## v0.4 Flow\n\n```text\nA computation breath cycle is completed.\nThe system checks whether a trace reference exists.\nThe system links the breath cycle, kata memory, and routing decision.\nThe system records source, transformation, routing, and output trace references.\nTrace gaps are marked.\nThe trace link is attached.\n```\n\n日本語では：\n\n```text\n計算呼吸サイクルが完了する。\n痕跡参照が存在するか確認する。\n呼吸記録、型記憶、経路判断を接続する。\n入力源、変換、経路、出力の痕跡を記録する。\n痕跡の欠落を明示する。\nTrace Link を付与する。\n```\n\n## v0.5 Flow\n\n```text\nA computation breath cycle is completed.\nThe system checks whether computation was saved.\nThe system checks whether a kata was reused.\nThe system checks whether cloud escalation was avoided.\nThe system checks whether a traceable origin exists.\nThe system links the computation to compute access and value return policy.\nA Compute Royalty Link is recorded.\n```\n\n日本語では：\n\n```text\n計算呼吸サイクルが完了する。\n計算が節約されたか確認する。\n型が再利用されたか確認する。\nクラウド昇格が回避されたか確認する。\n追跡可能な震源があるか確認する。\n計算アクセスと価値還流ポリシーへ接続する。\nCompute Royalty Link を記録する。\n```\n\n## Relationship Between Versions\n\n```text\nv0.1 = one regulated breath\nv0.2 = remembered kata for reducing repeated breath\nv0.3 = routing the breath through the lightest sufficient layer\nv0.4 = linking the breath to traceable origin and path\nv0.5 = linking saved computation and origin contribution to value return\n```\n\n日本語では：\n\n```text\nv0.1 = 1回の計算呼吸を整える\nv0.2 = 繰り返し現れる計算構造を型として記憶する\nv0.3 = その計算を最も軽い場所へ流す\nv0.4 = その計算の震源と経路を痕跡に接続する\nv0.5 = 節約された計算と震源貢献を価値還流へ接続する\n```\n\nv0.1 asks:\n\n\u003e Is this computation aligned, non-redundant, and sufficiently lightweight?\n\nv0.2 asks:\n\n\u003e Has this computation already become a reusable pattern?\n\nv0.3 asks:\n\n\u003e Where should this computation flow?\n\nv0.4 asks:\n\n\u003e Can this computation be linked to traceable origin, path, and output?\n\nv0.5 asks:\n\n\u003e Can saved computation and traceable contribution be linked to value return?\n\nTogether, they form the first practical arc of flowing, traceable, and accountable computation.\n\n## Minimal Flow\n\n```text\nInput comes in.\nCheck whether output should be limited.\nCheck whether a prior pattern can be reused.\nPause unnecessary external computation.\nRoute to the lightest sufficient layer.\nProduce only the necessary output.\nAttach trace.\nLink origin, path, routing, and output.\nConnect saved compute to value return.\n```\n\n日本語では：\n\n```text\n入力を吸う。\n吐きすぎを抑える。\n過去の型を探す。\n不要な外部計算を止める。\n最も軽い場所へ流す。\n必要な分だけ出す。\n痕跡を残す。\n震源、経路、実行層、出力を接続する。\n節約された計算を価値還流へ接続する。\n```\n\n## Core Gates\n\n### 1. Alignment Gate\n\nThe Alignment Gate checks whether the output volume is appropriate for the input.\n\nIt asks:\n\n* Is the input fresh enough?\n* Is the output minimal and sufficient?\n* Is there a risk of overgeneration?\n\nThis gate prevents unnecessary expansion of generated content.\n\n### 2. Reuse Gate\n\nThe Reuse Gate checks whether a prior computation pattern can be reused.\n\nIt asks:\n\n* Has a similar pattern already been computed?\n* Can the existing structure be reused with only a delta update?\n* Is full recomputation actually required?\n\nThis gate prevents redundant reasoning.\n\n### 3. Kumbhaka Gate\n\nThe Kumbhaka Gate pauses unnecessary external computation.\n\nIt asks:\n\n* Can the system reuse internal trace?\n* Can the system avoid an external call?\n* Can recomputation be suppressed?\n\nThis gate introduces a reflective pause before escalation.\n\n### 4. Routing Gate\n\nThe Routing Gate selects the lightest sufficient execution layer.\n\nIt asks:\n\n* Can this task run locally?\n* Can an edge NPU handle it?\n* Can a small model handle it?\n* Is cloud escalation truly required?\n* Is a frontier model truly required?\n\nThis gate prevents unnecessary use of heavier compute layers.\n\n### 5. Exhalation Record\n\nThe Exhalation Record describes the final output.\n\nIt records:\n\n* the output type\n* whether trace is required\n* the result of the computation cycle\n\nThis ensures that computation does not disappear as untraceable exhaust.\n\n### 6. Trace Link\n\nThe Trace Link connects computation to its origin, transformation path, routing decision, and output reference.\n\nIt asks:\n\n* Is the origin trace available?\n* Is the transformation path recorded?\n* Is the routing decision linked?\n* Is the output trace-compatible?\n* Are any trace gaps present?\n\nThis ensures that computation remains auditable after it has flowed.\n\n### 7. Compute Royalty Link\n\nThe Compute Royalty Link connects saved computation and traceable origin contribution to compute access and value return policies.\n\nIt asks:\n\n* Was recomputation avoided?\n* Was cloud escalation avoided?\n* Was a reusable kata used?\n* Is there a traceable origin?\n* Is a compute access policy required?\n* Is value return required?\n* Who may be a contribution recipient?\n\nThis ensures that computation savings and reusable structures can be connected to accountable value return.\n\n## Core Records\n\n### Computational Breath Cycle\n\nThe Computational Breath Cycle is the v0.1 record type.\n\nSchema:\n\n```text\nschemas/computational-breath-cycle.schema.json\n```\n\nExample:\n\n```text\nexamples/computational-breath-cycle.example.yaml\n```\n\n### Kata Memory Record\n\nThe Kata Memory Record is the v0.2 record type.\n\nSchema:\n\n```text\nschemas/kata-memory-record.schema.json\n```\n\nExample:\n\n```text\nexamples/kata-memory-record.example.yaml\n```\n\n### Edge First Routing Decision\n\nThe Edge First Routing Decision is the v0.3 record type.\n\nSchema:\n\n```text\nschemas/edge-first-routing-decision.schema.json\n```\n\nExample:\n\n```text\nexamples/edge-first-routing-decision.example.yaml\n```\n\n### Breath Trace Link\n\nThe Breath Trace Link is the v0.4 record type.\n\nSchema:\n\n```text\nschemas/breath-trace-link.schema.json\n```\n\nExample:\n\n```text\nexamples/breath-trace-link.example.yaml\n```\n\n### Compute Royalty Link\n\nThe Compute Royalty Link is the v0.5 record type.\n\nSchema:\n\n```text\nschemas/compute-royalty-link.schema.json\n```\n\nExample:\n\n```text\nexamples/compute-royalty-link.example.yaml\n```\n\n## Repository Structure\n\n```text\ncomputational-pranayama-protocol/\n├── README.md\n├── CHANGELOG.md\n├── .github/\n│   └── workflows/\n│       └── validate.yml\n├── schemas/\n│   ├── computational-breath-cycle.schema.json\n│   ├── kata-memory-record.schema.json\n│   ├── edge-first-routing-decision.schema.json\n│   ├── breath-trace-link.schema.json\n│   └── compute-royalty-link.schema.json\n├── examples/\n│   ├── computational-breath-cycle.example.yaml\n│   ├── kata-memory-record.example.yaml\n│   ├── edge-first-routing-decision.example.yaml\n│   ├── breath-trace-link.example.yaml\n│   └── compute-royalty-link.example.yaml\n└── scripts/\n    └── validate_examples.py\n```\n\n## Validation\n\nRun:\n\n```bash\npython scripts/validate_examples.py\n```\n\nExpected result:\n\n```text\n[validate] Computational Breath Cycle\n  schema : schemas/computational-breath-cycle.schema.json\n  example: examples/computational-breath-cycle.example.yaml\n[ok] Computational Breath Cycle example is valid\n[validate] Kata Memory Record\n  schema : schemas/kata-memory-record.schema.json\n  example: examples/kata-memory-record.example.yaml\n[ok] Kata Memory Record example is valid\n[validate] Edge First Routing Decision\n  schema : schemas/edge-first-routing-decision.schema.json\n  example: examples/edge-first-routing-decision.example.yaml\n[ok] Edge First Routing Decision example is valid\n[validate] Breath Trace Link\n  schema : schemas/breath-trace-link.schema.json\n  example: examples/breath-trace-link.example.yaml\n[ok] Breath Trace Link example is valid\n[validate] Compute Royalty Link\n  schema : schemas/compute-royalty-link.schema.json\n  example: examples/compute-royalty-link.example.yaml\n[ok] Compute Royalty Link example is valid\n```\n\n## Current Scope\n\nThe current protocol includes:\n\n* Computational Breath Cycle\n* Alignment Gate\n* Reuse Gate\n* Kumbhaka Gate\n* Routing Gate\n* Exhalation Record\n* Kata Memory Record\n* Edge First Routing Decision\n* Breath Trace Link\n* Compute Royalty Link\n* JSON Schema validation\n* YAML examples\n* GitHub Actions validation\n\nIt does not yet include:\n\n* full Royalty OS implementation\n* agent hooks\n* MCP bridge\n* detailed energy accounting\n* marketplace integration\n* multi-node orchestration\n* smart contract execution\n* payment settlement\n\n## Roadmap\n\n| Version | Theme                      | Description                                                                  |\n| ------- | -------------------------- | ---------------------------------------------------------------------------- |\n| v0.1    | Computational Breath Cycle | Defines the minimal unit of regulated computation                            |\n| v0.2    | Reuse / Kata Memory        | Records reusable computation patterns and delta-only recomputation           |\n| v0.3    | Edge First Routing         | Routes computation to the lightest sufficient execution layer                |\n| v0.4    | Breath Trace Link          | Links regulated computation to traceable origin, path, routing, and output   |\n| v0.5    | Compute Royalty Link       | Connects saved computation and traceable origin contribution to value return |\n\n## First Arc\n\nv0.1 through v0.5 form the first arc of the Computational Pranayama Protocol.\n\n```text\nBreath\n→ Kata\n→ Route\n→ Trace\n→ Return\n```\n\nJapanese:\n\n```text\n呼吸\n→ 型\n→ 経路\n→ 痕跡\n→ 還流\n```\n\nThis first arc defines how computation can be regulated, reused, routed, traced, and connected to value return.\n\n## Civilizational Position\n\nComputational Pranayama Protocol is a civilization-layer protocol for reducing overcompute.\n\nIt treats computation not as an unlimited fire, but as a breath that must be aligned, paused, routed, reused, traced, and returned.\n\nThe protocol begins from a simple premise:\n\n\u003e Wasteful computation is not intelligence.\n\u003e Reusable pattern, sufficient output, and traceable flow are intelligence.\n\nv0.2 sharpens this premise into a reuse principle:\n\n\u003e Reuse the kata. Compute only the delta.\n\nJapanese:\n\n\u003e 型を使え。差分だけ計算せよ。\n\nv0.3 sharpens the protocol into a routing principle:\n\n\u003e Route to the lightest sufficient layer.\n\nJapanese:\n\n\u003e 最も軽く十分な層へ流せ。\n\nv0.4 sharpens the protocol into a trace principle:\n\n\u003e No breath without trace.\n\nJapanese:\n\n\u003e 痕跡なき呼吸なし。\n\nv0.5 sharpens the protocol into a return principle:\n\n\u003e Saved compute should return value to traceable origin.\n\nJapanese:\n\n\u003e 節約された計算は、痕跡ある震源へ還流せよ。\n\nCompute like wind.\n\n## Civilizational Position\n\nComputational Pranayama Protocol is a civilization-layer protocol for reducing overcompute.\n\nIt treats computation not as unlimited fire, but as breath that must be aligned, paused, routed, reused, traced, and returned.\n\nThe protocol begins from a simple premise:\n\n\u003e Wasteful computation is not intelligence.\n\u003e Reusable pattern, sufficient output, local execution, traceable flow, and accountable return are intelligence.\n\nv0.1 defines the first regulated breath.\n\n\u003e Do not recompute what has already become a traceable pattern.\n\nJapanese:\n\n\u003e 痕跡ある型となったものを、二度ゼロから考えるな。\n\nv0.2 sharpens this into a reuse principle:\n\n\u003e Reuse the kata. Compute only the delta.\n\nJapanese:\n\n\u003e 型を使え。差分だけ計算せよ。\n\nv0.3 sharpens the protocol into a routing principle:\n\n\u003e Route to the lightest sufficient layer.\n\nJapanese:\n\n\u003e 最も軽く十分な層へ流せ。\n\nv0.4 sharpens the protocol into a trace principle:\n\n\u003e No breath without trace.\n\nJapanese:\n\n\u003e 痕跡なき呼吸なし。\n\nv0.5 sharpens the protocol into a return principle:\n\n\u003e Saved compute should return value to traceable origin.\n\nJapanese:\n\n\u003e 節約された計算は、痕跡ある震源へ還流せよ。\n\nTogether, v0.1 through v0.5 form the first arc of the Computational Pranayama Protocol:\n\n```text\nBreath\n→ Kata\n→ Route\n→ Trace\n→ Return\n```\n\nJapanese:\n\n```text\n呼吸\n→ 型\n→ 経路\n→ 痕跡\n→ 還流\n```\n\nThis first arc defines the **Breath Core** of an AI civilization metabolism layer.\n\nThe purpose is not to maximize computation.\n\nThe purpose is to regulate computation so that AI systems compute only what is necessary, where it is necessary, when it is necessary, with traceable accountability.\n\nIn this view, overcompute is not progress.\n\nOvercompute is metabolic disorder.\n\nA sustainable AI civilization requires computation that can breathe, remember, route, trace, and return.\n\nCompute like wind.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamuraiwriter7%2Fcomputational-pranayama-protocol","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsamuraiwriter7%2Fcomputational-pranayama-protocol","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamuraiwriter7%2Fcomputational-pranayama-protocol/lists"}