vitnify 0.0.0__tar.gz

vitnify-0.0.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

vitnify-0.0.0/NOTICE

@@ -0,0 +1,14 @@
+vitnify
+Copyright 2026 vitnify
+
+This product includes software developed by vitnify (https://vitnify.com).
+
+Portions of this software (the "vitni-tensor" deterministic inference engine and
+the vitnify SDK) are licensed under the Apache License, Version 2.0. See the
+LICENSE file.
+
+"vitnify" and "vitnify-verified", and the vitnify logo, are trademarks of vitnify.
+The Apache-2.0 license does not grant rights to use these marks. See TRADEMARKS.md.
+
+Third-party components used by vitni-tensor include libm (deterministic math) and
+BLAKE3 (hashing), each distributed under its own license.

vitnify-0.0.0/PKG-INFO

@@ -0,0 +1,6 @@
+Metadata-Version: 2.4
+Name: vitnify
+Version: 0.0.0
+License-File: LICENSE
+License-File: NOTICE
+Dynamic: license-file

vitnify-0.0.0/README.md

@@ -0,0 +1,132 @@
+<h1 align="center">Vitnify your agents</h1>
+<p align="center"><strong>Logs tell you what your agent did. Vitnify proves it</strong> — a cryptographic,
+independently-reconstructable record of what an agent computed and did.</p>
+
+Contain what an agent may do, deterministically reconstruct the model behind every
+decision, and seal the whole run into one **bit-for-bit receipt** anyone can verify
+offline — long after it happened.
+
+> **vitnify** *(v.)* — to turn an agent run into a receipt anyone can reproduce and verify, offline.
+
+vitnify isn't detection. It gives you the primitives to prove exactly what an agent
+did: a `vitnify-receipt v2` binds the model's computation, the granted capabilities,
+every tool call and result, the entropy, and the order into a single ed25519-signed,
+self-verifying object.
+
+## Install
+
+```
+pip install vitnify
+```
+
+## Quickstart
+
+```python
+from vitnify.events import EventLog, Kind
+from vitnify.engine import Engine, prompt_hash
+from vitnify.certificate import issue_certificate, verify_authorized, gen_ed25519
+
+eng = Engine("model.gguf", model_id="my-model")        # deterministic backend
+log = EventLog()
+
+step = eng.run(prompt_tokens=[1, 2, 3], n_new=20)       # a model step
+log.append_llm_call(prompt_hash([1, 2, 3]), step["tokens"], seed=0,
+                    model_digest=step["model_digest"],       # bind the model computation
+                    regime=step.get("regime"),               # + regime and weights_hash: bound in the
+                    weights_hash=step.get("weights_hash"))   #   digest, now readable in the receipt too
+log.append(Kind.TOOL_CALL, {"tool": "read_docs",  "decision": "allow"})
+log.append(Kind.TOOL_CALL, {"tool": "send_email", "decision": "deny"})  # ungranted → blocked
+
+priv, pub = gen_ed25519()
+cert, _ = issue_certificate("program_hash", ["read_docs"], log, priv=priv)
+
+checks = verify_authorized(cert, log, pinned_pubkeys=[pub])  # L1: offline, no model/secret; authorised signer
+assert checks["ok"]                       # signed by a trusted key, unaltered, no ungranted tool ran
+assert checks["containment_enforced"]     # every tool call was GATED, not merely observed
+# A receipt can be ok=True yet containment_enforced=False — a valid transcript from a
+# watch-only integration proves what ran, not that anything was contained. A containment
+# claim requires BOTH. (level 2: re-run each step through the engine; every model_digest
+# reproduces bit-for-bit.)
+```
+
+See the [receipt format spec](https://github.com/vitnify/vitnify-receipt-spec/blob/main/vitnify-receipt-v2.md)
+(canonical — this repo does not vendor a copy, so the two can't drift), and
+`examples/demo_receipt_e2e.py` for the full loop.
+
+## What you get
+
+- **Capability containment** — ungranted tools are structurally unreachable.
+- **Deterministic replay** — re-run a contested run and get the identical result, bit-for-bit.
+- **Bit-for-bit receipts** — the model's exact computation, bound and signed.
+- **Redaction by default** — the `Broker` commits *salted* hashes of tool payloads instead of cleartext, on allow **and** deny, so PHI/secrets never enter the receipt; cleartext stays in an org-held `Vault`, disclosed one event at a time with an inclusion proof (`vitnify.redact`). Pass `allow_cleartext=True` for the old behaviour (non-sensitive data only).
+- **Offline verification** — anyone verifies a receipt's **integrity** (`integrity_ok`) with no model, network, or secret; **authority** (that an approved runtime signed it) is a separate verdict that needs a pinned trust root.
+- **Drop-in** — wraps existing **LangGraph** and **MCP** agents (`pip install vitnify[langgraph]` / `[mcp]`).
+
+**Two verification levels — and when to use each.** *Level 1 (integrity)* is offline,
+instant, and needs no model — recompute the Merkle root and check the signature; this is
+the default for every receipt, and it's what proves containment and tamper-evidence.
+*Level 2 (recompute)* additionally re-runs the model to reproduce the committed output
+tokens (per-op / activation records — a stronger commitment — are an available mode the
+shipped binary does not emit).
+It is the **dispute path** — run on a contested subset when someone challenges a specific
+decision, **not** on every receipt inline. It is deliberately slow: the pinned-order
+deterministic engine trades throughput for bit-exactness, roughly two orders of magnitude
+below native inference (~0.45 tok/s vs ~58 for Mistral-7B Q4_K_M on the same Metal box).
+Fleet throughput still scales the normal way — L2 is embarrassingly parallel across
+receipts; a single recompute is simply not something you do on the hot path.
+
+**The verdict is split** (0.4.1) — a receipt answers two different questions, and a
+verifier reports them separately instead of collapsing them into one boolean:
+
+- **`integrity_ok`** — is the transcript internally consistent and validly signed by
+  *whoever* signed it? Answerable by **anyone, offline, no secret**. Tampering, a forged
+  chain, an ungranted tool, a bad signature all set it `False`.
+- **`authority_ok`** — was the signer an **approved runtime**? Needs a trust root, so it is
+  `True` / `False` / `None` (unestablished when no anchor is supplied — a stranger offline
+  can never answer it, and is *told so* rather than given a bare `False` that looks forged).
+- **`ok`** = `integrity_ok` **and** an authorised signer. Pin the trusted key(s) —
+  `verify_authorized(cert, log, pinned_pubkeys=…)` is the production entry point; anchor it
+  in a TPM/enclave for the strongest form. Pass `require_authority=False` to make `ok` the
+  integrity-only verdict (the answer a stranger *can* compute offline).
+
+**Program binding.** `program_hash` is caller-asserted unless you bind it. Pass
+`derive_program_hash(paths_or_bytes)` at issue time and `verify_certificate(..., program=…)`
+at verify time to make the receipt bind the *actual* program, not a label.
+
+> ### ✅ Safe by default (0.4.0)
+>
+> The `Broker` **redacts** (no tool payload enters the receipt) and `verify_certificate`
+> **requires signer authority** (a re-signed forgery can't verify without a trusted pin).
+> Relax either only where appropriate, and do it explicitly:
+>
+> ```python
+> broker = Broker(caps, tools, log, allow_cleartext=True)   # record payloads in cleartext (non-sensitive only)
+> verify_certificate(cert, log, require_authority=False)    # integrity-only verdict (continuity, not authority)
+> ```
+>
+> The production verify pins the trusted signer(s) and can bind the program:
+>
+> ```python
+> from vitnify.certificate import verify_authorized, derive_program_hash
+> cert, _ = issue_certificate(derive_program_hash(SRC), caps, log, priv=priv)  # bind the real code
+> checks  = verify_authorized(cert, log, pinned_pubkeys=[trusted_key], program=SRC)  # authority + binding
+> ```
+
+The deterministic engine is [`vitni-tensor`](https://github.com/vitnify/vitni-tensor);
+the `vitni-receipt` binary is the model backend (point `VITNI_RECEIPT_BIN` at it).
+
+## License
+
+Apache-2.0. **"vitnify"** and **"vitnify-verified"** are trademarks — see
+[TRADEMARKS.md](TRADEMARKS.md). A fork may use the code, but not the name or issue
+vitnify-verified receipts.
+
+## Part of Vitnify
+
+This SDK is one of three open repos:
+
+- **[vitni-tensor](https://github.com/vitnify/vitni-tensor)** — the deterministic,
+  `no_std` engine that produces the bit-identical model-computation digest this SDK binds.
+- **[vitnify-receipt-spec](https://github.com/vitnify/vitnify-receipt-spec)** — the
+  canonical `vitnify-receipt v2` format the SDK implements.
+- **[vitnify.com](https://vitnify.com)** — the project.

vitnify-0.0.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

vitnify-0.0.0/src/vitnify/_vendor/pck/cas.py

@@ -0,0 +1,181 @@
+"""Content-addressed store + Merkle ledger — the provenance backbone of PCK.
+
+Every source chunk is addressed by its cryptographic hash. A Merkle tree over those
+hashes yields a single ``root`` that attests the whole corpus. Any single chunk can
+then carry an *inclusion proof*: a short path of sibling hashes that recomputes the
+root. The guarantees this buys, and why they matter for AI answers:
+
+  * **Tamper-evidence** — change one byte of one chunk and the root changes.
+  * **Independent verifiability** — anyone holding the root can check a chunk's proof
+    without trusting the party that produced it (no model, no server, no secret key).
+  * **Fabrication is uncredentialed** — a made-up "source" has no leaf in the tree, so
+    it cannot produce a valid proof. This is the cryptographic half of catching a
+    hallucination: a grounded claim points at a chunk with a valid proof; an invented
+    one cannot.
+
+This mirrors the BLAKE3 + Merkle design of a native runtime's ``cas_store``; here we
+keep a dependency-light pure-Python implementation over ``blake3``. BLAKE3 is a hard
+dependency and DEFINES the wire format: a ``blake2b`` digest is a different value under
+the same ``hash_name``, so there is NO silent stdlib fallback -- one would make honest
+proofs indistinguishable from forgeries. A missing blake3 fails loudly (matching
+``events.py`` / ``certificate.py``), never silently downgrades.
+"""
+from __future__ import annotations
+
+from dataclasses import dataclass, field
+from typing import Optional
+
+import blake3 as _blake3
+
+_HASH_NAME = "blake3"
+
+def _digest(b: bytes) -> str:
+    return _blake3.blake3(b).hexdigest()
+
+
+HASH_NAME = _HASH_NAME
+
+
+def hash_bytes(b: bytes) -> str:
+    """Content address of raw bytes (hex)."""
+    return _digest(b)
+
+
+def hash_text(s: str) -> str:
+    """Content address of a text chunk (UTF-8, hex)."""
+    return _digest(s.encode("utf-8"))
+
+
+def _hash_pair(left: str, right: str) -> str:
+    """Internal Merkle node = hash of the concatenated child hex digests."""
+    return _digest((left + right).encode("utf-8"))
+
+
+# --- inclusion proof -------------------------------------------------------------
+
+@dataclass(frozen=True)
+class ProofStep:
+    """One level of a Merkle inclusion path."""
+
+    sibling: str      # hex digest of the sibling node
+    on_right: bool    # True if the *current* node is the right child at this level
+
+    def to_json(self) -> dict:
+        return {"sibling": self.sibling, "on_right": self.on_right}
+
+    @staticmethod
+    def from_json(d: dict) -> "ProofStep":
+        return ProofStep(sibling=d["sibling"], on_right=bool(d["on_right"]))
+
+
+@dataclass(frozen=True)
+class InclusionProof:
+    """A self-contained proof that ``leaf`` is committed under ``root``.
+
+    Carries everything a third party needs to re-verify against a *published* root:
+    the leaf hash, the sibling path, and the index. No tree, server, or key required.
+    """
+
+    leaf: str
+    index: int
+    path: list[ProofStep]
+    hash_name: str = HASH_NAME
+
+    def verify(self, root: str) -> bool:
+        # A proof carries the hash suite it was built under. This module only speaks
+        # BLAKE3, so a proof committed under any other suite cannot be recomputed here
+        # -- reject rather than silently recompute under the wrong hash.
+        if self.hash_name != HASH_NAME:
+            return False
+        return verify_proof(self.leaf, self.path, root)
+
+    def to_json(self) -> dict:
+        return {
+            "leaf": self.leaf,
+            "index": self.index,
+            "hash": self.hash_name,
+            "path": [s.to_json() for s in self.path],
+        }
+
+    @staticmethod
+    def from_json(d: dict) -> "InclusionProof":
+        return InclusionProof(
+            leaf=d["leaf"],
+            index=int(d["index"]),
+            path=[ProofStep.from_json(s) for s in d["path"]],
+            hash_name=d.get("hash", HASH_NAME),
+        )
+
+
+def verify_proof(leaf: str, path: list[ProofStep], root: str) -> bool:
+    """Recompute the root from ``leaf`` and ``path``; True iff it equals ``root``."""
+    h = leaf
+    for step in path:
+        h = _hash_pair(step.sibling, h) if step.on_right else _hash_pair(h, step.sibling)
+    return h == root
+
+
+# --- the tree / store ------------------------------------------------------------
+
+@dataclass
+class MerkleCAS:
+    """Content-addressed store with a Merkle commitment over its chunks.
+
+    Odd layers duplicate the final node (Bitcoin-style), so a proof always exists for
+    every leaf. Construction is deterministic in the chunk order.
+    """
+
+    chunks: list[str]
+    leaves: list[str] = field(default_factory=list)
+    layers: list[list[str]] = field(default_factory=list)
+    _index_of_hash: dict[str, int] = field(default_factory=dict)
+
+    def __post_init__(self) -> None:
+        if not self.chunks:
+            raise ValueError("MerkleCAS requires at least one chunk")
+        self.leaves = [hash_text(c) for c in self.chunks]
+        # first occurrence wins if a chunk repeats
+        for i, h in enumerate(self.leaves):
+            self._index_of_hash.setdefault(h, i)
+        self.layers = self._build(self.leaves)
+
+    @staticmethod
+    def _build(leaves: list[str]) -> list[list[str]]:
+        layers = [leaves[:]]
+        while len(layers[-1]) > 1:
+            cur = layers[-1]
+            nxt = [
+                _hash_pair(cur[i], cur[i + 1] if i + 1 < len(cur) else cur[i])
+                for i in range(0, len(cur), 2)
+            ]
+            layers.append(nxt)
+        return layers
+
+    @property
+    def root(self) -> str:
+        return self.layers[-1][0]
+
+    def index_of(self, chunk_or_hash: str) -> Optional[int]:
+        """Index of a chunk by its raw text or by its hash; None if absent."""
+        if chunk_or_hash in self._index_of_hash:
+            return self._index_of_hash[chunk_or_hash]
+        return self._index_of_hash.get(hash_text(chunk_or_hash))
+
+    def contains(self, chunk_or_hash: str) -> bool:
+        return self.index_of(chunk_or_hash) is not None
+
+    def prove_index(self, idx: int) -> InclusionProof:
+        if not 0 <= idx < len(self.leaves):
+            raise IndexError(idx)
+        path: list[ProofStep] = []
+        i = idx
+        for layer in self.layers[:-1]:
+            sib = i ^ 1 if (i ^ 1) < len(layer) else i  # duplicated node is its own sibling
+            path.append(ProofStep(sibling=layer[sib], on_right=bool(i & 1)))
+            i //= 2
+        return InclusionProof(leaf=self.leaves[idx], index=idx, path=path)
+
+    def prove(self, chunk_or_hash: str) -> Optional[InclusionProof]:
+        """Inclusion proof for a chunk (by text or hash); None if not in the corpus."""
+        idx = self.index_of(chunk_or_hash)
+        return None if idx is None else self.prove_index(idx)

vitnify-0.0.0/src/vitnify/capability.py

@@ -0,0 +1,77 @@
+"""Userspace, kernel-free capability broker. Containment by construction: every
+side-effecting tool call routes through here, and a tool the run wasn't granted is
+simply unreachable -- a jailbreak that reaches an ungranted tool hits a wall, not a
+classifier. Every call (allow or deny) is recorded to the event log.
+
+SAFE BY DEFAULT (0.4.0). The broker **redacts**: it commits a SALTED hash of each
+tool's args/results into the receipt and keeps the cleartext in an org-held
+:class:`~vitnify.redact.Vault` (``broker.vault``), so PHI/secrets never enter the
+signed record -- on allow AND deny. Disclose one event at a time with an inclusion
+proof (see :mod:`vitnify.redact`).
+
+Pass ``allow_cleartext=True`` to record payloads in cleartext instead (the pre-0.4.0
+behaviour) -- ONLY where the arguments and results are not sensitive; a redacted log
+is the safe choice for regulated data.
+"""
+from __future__ import annotations
+import hashlib
+import os
+from .events import EventLog, Kind
+
+
+def _rh(x) -> str:
+    return hashlib.blake2b(repr(x).encode(), digest_size=16).hexdigest()
+
+
+class Broker:
+    def __init__(self, capabilities, tools: dict, log: EventLog, *, vault=None,
+                 allow_cleartext: bool = False, replay=None):
+        self.caps = set(capabilities)
+        self.tools = tools
+        self.log = log
+        self.replay = replay            # if set: recorded ALLOW results to re-inject
+        self.allow_cleartext = allow_cleartext
+        if allow_cleartext:
+            self.vault = None
+        else:
+            from .redact import Vault   # lazy: avoids an import cycle (redact imports Broker)
+            self.vault = vault if vault is not None else Vault()
+
+    def call(self, tool: str, *args):
+        args = list(args)
+        allowed = tool in self.caps
+
+        if self.allow_cleartext:
+            # OPT-OUT: record payloads in cleartext (only for non-sensitive data).
+            if not allowed:
+                self.log.append(Kind.TOOL_CALL, {"tool": tool, "args": args, "decision": "DENY"})
+                return False, None
+            result = self.replay.pop(0) if self.replay is not None else self.tools[tool](*args)
+            self.log.append(Kind.TOOL_CALL, {"tool": tool, "args": args, "decision": "ALLOW",
+                                             "result": result, "result_hash": _rh(result)})
+            return True, result
+
+        # SAFE DEFAULT: commit SALTED hashes; cleartext goes to the vault, not the receipt.
+        from .redact import _commit
+        idx = len(self.log)
+        asalt = os.urandom(16)
+        if not allowed:
+            self.log.append(Kind.TOOL_CALL,
+                            {"tool": tool, "args_commit": _commit(asalt, args), "decision": "DENY"})
+            self.vault.put(idx, args_salt=asalt, args=args)
+            return False, None
+        result = self.replay.pop(0) if self.replay is not None else self.tools[tool](*args)
+        rsalt = os.urandom(16)
+        self.log.append(Kind.TOOL_CALL,
+                        {"tool": tool, "args_commit": _commit(asalt, args),
+                         "decision": "ALLOW", "result_commit": _commit(rsalt, result)})
+        self.vault.put(idx, args_salt=asalt, args=args, result_salt=rsalt, result=result)
+        return True, result
+
+
+def recorded_tool_results(log: EventLog):
+    """ALLOW results for a replay, from a CLEARTEXT-mode log. For a redacted log the
+    results are in the vault -- use :func:`vitnify.redact.recorded_tool_results(log, vault)`."""
+    return [e.payload["result"] for e in log.events
+            if e.kind == Kind.TOOL_CALL.value and e.payload.get("decision") == "ALLOW"
+            and "result" in e.payload]