reckon-rcdr 0.1.1__tar.gz

reckon_rcdr-0.1.1/CHANGELOG.md

@@ -0,0 +1,76 @@
+# Changelog
+
+## 0.1.1 — 2026-07-28
+
+First published release. No API change from 0.1.0; the additions are evidence and
+documentation, which for this project is the substance rather than the packaging.
+
+### Evidence
+
+- **Temporal probe** (`demo/temporal_replay.py`). The hardest case for the thesis, since
+  deterministic replay is Temporal's product. The same decision recorded under one threshold
+  and replayed under another diverges identically in both cases, but is caught only when it
+  crosses a command boundary; when it merely changes a returned value, replay succeeds
+  silently while the replayed code decides the opposite. The history's `binaryChecksum` is
+  identical across both decisions, because the threshold is not in the build.
+- **LangGraph probe** (`demo/langgraph_replay.py`). Three threads, one identical persisted
+  rationale, two outcomes; the deciding threshold occurs in zero of 12,286 persisted bytes.
+  The re-emitted records reproduce all three observed outcomes.
+- **Ablation** (`demo/ablation.py` → `demo/ABLATION.md`). Each field deleted from a
+  C2-complete record and the verifier re-run: 10 of 13 fields are load-bearing, and the three
+  that are not are named rather than defended.
+
+### Docs
+
+- `docs/ARGUMENT.md` — the thesis stated narrowly, the evidence, the rr boundary, the
+  non-goals, and what would falsify the whole thing.
+- `docs/RCDR-v0.1.md` §3.1 separates **admissibility** from soundness: a class states what
+  the evidence supports, not what a system may do with it. Demotion only; never gate on
+  self-confidence; undeclared reversibility reads as irreversible.
+- `execution.pure` documented in §4.8, which §5.1 already relied on.
+
+## 0.1.0 — 2026-07-28 (unpublished)
+
+First release. Implements RCDR v0.1 (`docs/RCDR-v0.1.md`) end to end.
+
+### Emitter
+
+- `Recorder` / `Decision` context manager emitting RCDR records to a sink.
+- `predicate.id` is a content hash of canonical predicate structure — operator plus
+  operand identities — rather than a name or source location.
+- `policy.resolution.provenance` is a closed enum including `unknown`, which caps a
+  record at C0. Invalid values raise rather than being coerced.
+- `candidates.completeness` defaults to `taken_only`; `exhaustive` is an explicit
+  declaration the caller makes and is never inferred from candidates having been logged.
+- `execution.path_digest` covers the resolution sources actually used, so two decisions
+  with identical dependencies but different resolution regimes hash differently.
+- The emitter refuses to guess: comparing against an unregistered policy raises, and
+  closing a decision without an outcome raises.
+- `JsonlSink` and `MemorySink`.
+
+### Verifier
+
+- `verify()` implements §5.1 exactly and reports a capability class, never a score.
+- `verify_run()` reports a run at its weakest decision and names which decisions fell
+  short and what they were missing.
+- `boundary()` reports the C3 boundary: given a decision to flip, it splits the run into
+  an evidence region and a hypothesis region and names the edge where evidence ends.
+  C3 is never certified.
+
+### CLI
+
+- `reckon verify <run.jsonl> --class C{0,1,2,3} [--json]`, exit code 1 when the requested
+  class is unsupported so it can gate a pipeline.
+- `reckon boundary <run.jsonl> --decision <id> [--json]`.
+
+### Demo
+
+- `demo/` runs the before/after arc over the decision log from a real OPA v1.18.2 probe
+  containing two decisions with identical input, bundle revision and engine version that
+  came out opposite ways.
+
+### Known scope limits
+
+No tamper evidence, no signatures, no anchoring — the demonstrated threat is omission.
+No confidentiality. No inference over uninstrumented systems: the demo's "before" mapping
+was written by hand. Any implementation reporting a C3 certification is non-conforming.

reckon_rcdr-0.1.1/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.

reckon_rcdr-0.1.1/MANIFEST.in

@@ -0,0 +1,11 @@
+include LICENSE
+include CHANGELOG.md
+include docs/RCDR-v0.1.md
+include demo/README.md
+include demo/*.py
+include demo/evidence/*
+
+recursive-include tests *.py
+
+global-exclude __pycache__
+global-exclude *.py[cod]

reckon_rcdr-0.1.1/PKG-INFO

@@ -0,0 +1,156 @@
+Metadata-Version: 2.4
+Name: reckon-rcdr
+Version: 0.1.1
+Summary: The capture layer for autonomous decisions — emit and verify replay-complete decision records (RCDR v0.1)
+Author-email: Ola <laolex55@gmail.com>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/Laolex/reckon
+Project-URL: Specification, https://github.com/Laolex/reckon/blob/main/docs/RCDR-v0.1.md
+Project-URL: Source, https://github.com/Laolex/reckon
+Keywords: replay,audit,provenance,policy,agents,observability,rcdr
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Software Development :: Quality Assurance
+Classifier: Topic :: System :: Logging
+Classifier: Typing :: Typed
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: dev
+Requires-Dist: pytest>=8; extra == "dev"
+Requires-Dist: build>=1.2; extra == "dev"
+Requires-Dist: twine>=5; extra == "dev"
+Dynamic: license-file
+
+# Reckon
+
+**The capture layer for autonomous decisions.** Capture is the primitive; replay exists to
+prove capture worked.
+
+An autonomous system that made a decision you now regret leaves behind a record. The
+question you want to ask that record is not "what happened" — it is *"would this have gone
+the other way under a different policy?"* Reckon exists because that question is usually
+unanswerable, and because nothing in the record tells you it is unanswerable.
+
+## The finding
+
+Five systems were probed: OPA, LangGraph, Temporal, and the decision logs of a live
+Hyperliquid and a live Polymarket agent. Every one produced records that looked sufficient
+and were not.
+
+Three are reproducible here from the original probe artifacts, in [`demo/`](demo/):
+
+- **OPA.** A sound policy engine, versioned bundles and a complete decision log still
+  produced two decisions with **identical input, identical bundle revision and identical
+  engine version that came out opposite ways** — and nothing in the record revealed which
+  regime was in force.
+- **LangGraph.** Three threads, one identical persisted rationale, two different outcomes.
+  The threshold that separated them occurs in **zero of 12,286 persisted bytes**. The record
+  faithfully kept the reasoning that did not decide, and dropped the predicate that did.
+- **Temporal.** The hardest case, since deterministic replay *is* its product. The same
+  divergence — history says `trade`, replayed code decides `skip` — is caught when the
+  decision schedules an activity and **silent when it only changes a returned value**.
+  Detection is drawn at command boundaries, not at decisions.
+
+So: replay soundness is not compositional. It is a property of the whole execution path, not
+of the components in it. And no record carries its own soundness proof.
+
+The argument in full is in [`docs/ARGUMENT.md`](docs/ARGUMENT.md), including the
+non-goals and what would falsify it.
+
+## Capability classes
+
+The verifier reports a class, never a score. A percentage over incommensurable kinds of
+missing evidence manufactures exactly the false confidence that made the OPA failure
+undetectable.
+
+| Class | Counterfactual | Additionally requires |
+|---|---|---|
+| **C0** Identity | reproduce what happened | execution model, determinism |
+| **C1** Tightening | admit strictly fewer actions | predicate structure, compared value, resolved policy |
+| **C2** Loosening | admit more actions | the rejected candidate set and their values |
+| **C3** State-Coupled | a changed decision perturbs later state | **not certifiable by anyone** |
+
+C0–C2 are deductive given capture. C3 is not deductive for anyone — past the first flip it
+is counterfactual inference, not replay. Reckon's honest top guarantee is: certify soundness
+through C2, and for C3 certify *where the evidence ends*.
+
+## Install
+
+```
+pip install reckon-rcdr
+```
+
+Python 3.11+, no runtime dependencies. The distribution is `reckon-rcdr`; the import name
+and the CLI command are both `reckon`.
+
+## Use
+
+```python
+from reckon import JsonlSink, Recorder
+
+rec = Recorder(sink=JsonlSink("run.jsonl"), run_id="run-1", emitter="my-agent")
+
+with rec.decision(action="transfer", pure=True) as d:
+    d.policy("policy.limit", value=5000, provenance="bundled", source="opa:bundle")
+    allowed = d.check("lt", left="request.amount", value=4200, right="policy.limit")
+    d.candidate("transfer", compared_value=4200, outcome="admit", predicate="p:limit")
+    d.candidate("hold", compared_value=4200, outcome="reject", predicate="p:limit")
+    d.candidates_exhaustive()
+    d.admit() if allowed else d.reject()
+```
+
+```
+$ python -m reckon verify run.jsonl --class C2
+Requested: Loosening Replay (C2)
+Available: C2
+Decisions: C2 x1
+
+$ python -m reckon boundary run.jsonl --decision d-4f21a0c9e113
+```
+
+Exit code is non-zero when the requested class is unsupported, so it can gate a pipeline. A
+build should be able to fail because the evidence needed to re-adjudicate a decision was
+never captured.
+
+## The emitter refuses to guess
+
+Comparing against a policy that was never registered raises. Closing a decision without an
+outcome raises. `pure` is a declaration the caller makes, never something the SDK infers, so
+an undeclared decision without a seed fails C0. Absent candidate completeness reads as
+`taken_only`; unestablished provenance is written as `unknown` and caps the record at C0.
+
+Each of those is deliberately inconvenient. A record that quietly fills its own gaps is the
+failure this whole project is named after.
+
+## Layout
+
+| Path | |
+|---|---|
+| `docs/RCDR-v0.1.md` | the record format — the normative document |
+| `docs/ARGUMENT.md` | the argument: thesis, evidence, novelty, non-goals |
+| `src/reckon/` | emitter, verifier, run-level verifier, CLI |
+| `demo/` | three before/after arcs over real probe artifacts, plus the ablation |
+| `demo/ABLATION.md` | which fields are load-bearing — generated, not asserted |
+| `tests/` | every assertion traces to a requirement in the spec |
+
+```
+pip install -e ".[dev]"
+python -m pytest
+```
+
+## License
+
+Apache-2.0. Chosen over MIT for the express patent grant: RCDR is meant to be implemented
+by other people, and an implementer should not have to wonder about that.
+
+## Scope
+
+No tamper evidence, no signatures, no anchoring — the demonstrated threat is omission, not
+modification. No confidentiality. No inference over uninstrumented systems: RCDR describes
+what an instrumented emitter must produce, and recovering decision semantics from arbitrary
+code is a separate and much harder problem. Any implementation reporting a C3 certification
+is non-conforming.

reckon_rcdr-0.1.1/README.md

@@ -0,0 +1,129 @@
+# Reckon
+
+**The capture layer for autonomous decisions.** Capture is the primitive; replay exists to
+prove capture worked.
+
+An autonomous system that made a decision you now regret leaves behind a record. The
+question you want to ask that record is not "what happened" — it is *"would this have gone
+the other way under a different policy?"* Reckon exists because that question is usually
+unanswerable, and because nothing in the record tells you it is unanswerable.
+
+## The finding
+
+Five systems were probed: OPA, LangGraph, Temporal, and the decision logs of a live
+Hyperliquid and a live Polymarket agent. Every one produced records that looked sufficient
+and were not.
+
+Three are reproducible here from the original probe artifacts, in [`demo/`](demo/):
+
+- **OPA.** A sound policy engine, versioned bundles and a complete decision log still
+  produced two decisions with **identical input, identical bundle revision and identical
+  engine version that came out opposite ways** — and nothing in the record revealed which
+  regime was in force.
+- **LangGraph.** Three threads, one identical persisted rationale, two different outcomes.
+  The threshold that separated them occurs in **zero of 12,286 persisted bytes**. The record
+  faithfully kept the reasoning that did not decide, and dropped the predicate that did.
+- **Temporal.** The hardest case, since deterministic replay *is* its product. The same
+  divergence — history says `trade`, replayed code decides `skip` — is caught when the
+  decision schedules an activity and **silent when it only changes a returned value**.
+  Detection is drawn at command boundaries, not at decisions.
+
+So: replay soundness is not compositional. It is a property of the whole execution path, not
+of the components in it. And no record carries its own soundness proof.
+
+The argument in full is in [`docs/ARGUMENT.md`](docs/ARGUMENT.md), including the
+non-goals and what would falsify it.
+
+## Capability classes
+
+The verifier reports a class, never a score. A percentage over incommensurable kinds of
+missing evidence manufactures exactly the false confidence that made the OPA failure
+undetectable.
+
+| Class | Counterfactual | Additionally requires |
+|---|---|---|
+| **C0** Identity | reproduce what happened | execution model, determinism |
+| **C1** Tightening | admit strictly fewer actions | predicate structure, compared value, resolved policy |
+| **C2** Loosening | admit more actions | the rejected candidate set and their values |
+| **C3** State-Coupled | a changed decision perturbs later state | **not certifiable by anyone** |
+
+C0–C2 are deductive given capture. C3 is not deductive for anyone — past the first flip it
+is counterfactual inference, not replay. Reckon's honest top guarantee is: certify soundness
+through C2, and for C3 certify *where the evidence ends*.
+
+## Install
+
+```
+pip install reckon-rcdr
+```
+
+Python 3.11+, no runtime dependencies. The distribution is `reckon-rcdr`; the import name
+and the CLI command are both `reckon`.
+
+## Use
+
+```python
+from reckon import JsonlSink, Recorder
+
+rec = Recorder(sink=JsonlSink("run.jsonl"), run_id="run-1", emitter="my-agent")
+
+with rec.decision(action="transfer", pure=True) as d:
+    d.policy("policy.limit", value=5000, provenance="bundled", source="opa:bundle")
+    allowed = d.check("lt", left="request.amount", value=4200, right="policy.limit")
+    d.candidate("transfer", compared_value=4200, outcome="admit", predicate="p:limit")
+    d.candidate("hold", compared_value=4200, outcome="reject", predicate="p:limit")
+    d.candidates_exhaustive()
+    d.admit() if allowed else d.reject()
+```
+
+```
+$ python -m reckon verify run.jsonl --class C2
+Requested: Loosening Replay (C2)
+Available: C2
+Decisions: C2 x1
+
+$ python -m reckon boundary run.jsonl --decision d-4f21a0c9e113
+```
+
+Exit code is non-zero when the requested class is unsupported, so it can gate a pipeline. A
+build should be able to fail because the evidence needed to re-adjudicate a decision was
+never captured.
+
+## The emitter refuses to guess
+
+Comparing against a policy that was never registered raises. Closing a decision without an
+outcome raises. `pure` is a declaration the caller makes, never something the SDK infers, so
+an undeclared decision without a seed fails C0. Absent candidate completeness reads as
+`taken_only`; unestablished provenance is written as `unknown` and caps the record at C0.
+
+Each of those is deliberately inconvenient. A record that quietly fills its own gaps is the
+failure this whole project is named after.
+
+## Layout
+
+| Path | |
+|---|---|
+| `docs/RCDR-v0.1.md` | the record format — the normative document |
+| `docs/ARGUMENT.md` | the argument: thesis, evidence, novelty, non-goals |
+| `src/reckon/` | emitter, verifier, run-level verifier, CLI |
+| `demo/` | three before/after arcs over real probe artifacts, plus the ablation |
+| `demo/ABLATION.md` | which fields are load-bearing — generated, not asserted |
+| `tests/` | every assertion traces to a requirement in the spec |
+
+```
+pip install -e ".[dev]"
+python -m pytest
+```
+
+## License
+
+Apache-2.0. Chosen over MIT for the express patent grant: RCDR is meant to be implemented
+by other people, and an implementer should not have to wonder about that.
+
+## Scope
+
+No tamper evidence, no signatures, no anchoring — the demonstrated threat is omission, not
+modification. No confidentiality. No inference over uninstrumented systems: RCDR describes
+what an instrumented emitter must produce, and recovering decision semantics from arbitrary
+code is a separate and much harder problem. Any implementation reporting a C3 certification
+is non-conforming.