hypgraph 0.1.0__tar.gz → 0.2.0__tar.gz

{hypgraph-0.1.0 → hypgraph-0.2.0}/AGENTS.md

@@ -56,9 +56,16 @@ reserved.
    ```
    with `links=[{"rel": "supports", "from": "RS3", "why": "RS3 is the measurement this claim states."}]`.
    - every number in the statement must match a bound measurement, the scope, or an investigation constant;
-   - "never", "all", "always" or "proves" need a measurement with k = 0 or k = n;
+   - "never", "always", "eliminates", "100%" need a count of what they're about with k = 0 or k = n, enough
+     trials that the 95% bound is under 5%, and n in the statement ("never, in 3,000 probes"). Check first:
+     `bound(k, n, exposure)` says what a count supports and how many failures it leaves unruled out at scale;
+   - "beats" / "outperforms" need both sides measured; "significantly" needs a test (the record runs one on two
+     bound counts); "causes" needs an experiment that intervened;
+   - numbers computed from bound counts (differences, percentages, ratios, intervals) are fine; invented ones
+     are not;
    - `kind: "exclusion"` needs a result with `power: "demonstrated"` (a search that found a planted answer).
      Otherwise use `"inconclusive"`.
+   Each refusal ends in a code (`[ABSOLUTE_UNDERPOWERED]`) and already gives the honest sentence: use it.
 6. **Reviews.** Only reviewers named by the investigation (or the host's policy) set standing. Nobody reviews their
    own work. A revision makes earlier reviews stale.
 7. **Start summaries from `report()`.** It's generated from the record, so it can't restate a withdrawn claim. Write

hypgraph-0.2.0/CHANGELOG.md

@@ -0,0 +1,67 @@
+# Changelog
+
+## 0.2.0 — 2026-10-24
+
+**Refusal, remastered.** The claim checks now do the arithmetic the writer skipped, and every refusal says what the
+count actually supports and offers the honest sentence.
+
+- **The arithmetic of never.** "Never" / "always" / "eliminates" / "100%" need a count of what they're about with
+  k = 0 or n (`ABSOLUTE_WITHOUT_COUNT`, `ABSOLUTE_UNRELATED_COUNT`). That count needs a 95% bound under 5%
+  (`ABSOLUTE_UNDERPOWERED`: "0 of 3 only rules out more than 63%"), and the statement has to show its denominator
+  (`ABSOLUTE_HIDES_DENOMINATOR`). The bounds are exact at k = 0 (1 − 0.05^(1/n), the rule of three) and Wilson
+  otherwise.
+- **Exposure.** A claim can say how many uses, users or units it applies to (`exposure`, `exposure_unit`). Refusals
+  and the claim's standing then state how many failures the bound leaves unruled out: "up to 58,155 of 1,000,000".
+- **New rules:** `COMPARATIVE_WITHOUT_COMPARISON`, `SIGNIFICANCE_WITHOUT_TEST`, `SIGNIFICANCE_NOT_SHOWN` (the
+  record runs a two-proportion test on bound counts itself), `CAUSAL_WITHOUT_INTERVENTION`, and
+  `EXCLUSION_WITHOUT_POWER` for "no effect" however it is filed, with the smallest effect the sample could have
+  detected.
+- **True numbers pass.** Differences, ratios, percentages and relative changes computed from bound measurements are
+  accepted ("2.8 points", "81.2% vs 78.4%", "+3.6%"). Statistical quantities must be written to one decimal place, so
+  "5 points" can't borrow an interval's end.
+- **Refusals agents can act on:** a stable code on every line, and `GraphError.problems` with `code`, `message`,
+  `fix` and `words`.
+- **Blast radius.** `withdraw()`, and a review that makes a node fall, return `blast_radius`: what rests on it, by
+  type, with claims and decisions named (and spend, if metered). The CLI and MCP print it.
+- **`hypgraph bound K N --exposure X`** and the MCP tool `bound`: what a count supports, before anyone writes "never".
+- A claim's standing carries `bounds`, and `test` for "significantly" claims. Spec draft 2 (§7 rewritten).
+- Credits: made by Nicolas Houghtaling at VoodooMods LLC (README, NOTICE, CITATION.cff, package metadata, site).
+
+## 0.1.0 — 2026-10-24
+
+First release on PyPI.
+
+- **Writes cost what they touch.** A write no longer copies the whole in-memory snapshot. Tables are shallow
+  copies, and a node's list is copied only when the write appends to it. Derived standing is kept for every node the
+  write can't affect (`derive.affected_by`), so the first full read after a write no longer re-derives the graph.
+  At 10,000 nodes: building the graph took 77 s instead of 133 s, a full read after a write 0.02 s instead of
+  0.17 s, and a write at 5,000 nodes 5.8 ms instead of 12 ms. A randomized suite checks the carried standing
+  against a full rebuild after every kind of write.
+- New indexes for display codes and the rate limit (`nodes(inv, type)`, `nodes(inv, code)`, `events(actor, kind,
+  at)`). Created on open; existing records just gain them.
+- Positioning: the evidence layer for AI research agents. README and site lead with the MCP server and the Agent
+  Skill; a new engineering guide (`/engineers/`) replaces the human guide; the eval-report example replaces the
+  classroom one.
+
+### Extracted from PegasusDMZ
+
+Extracted from the PegasusDMZ research graph and verified against it: on a copy of Pegasus's live
+graph (1,357 events, 790 nodes in 5 investigations), the library reproduces the same chain head, every node's
+standing, the work queues and the next-experiment rankings.
+
+- **Engine** (stdlib only): typed nodes and edges, append-only SQLite with a SHA-256 event chain and `verify()`,
+  standing derived on read, claim checks on write, review pinned to versions, independence and evidence profile,
+  leases, next experiments, work map, digest, report.
+- **Policy**: reviewers, instrument, operator, importer and system are the host's to set (they were hardcoded in
+  Pegasus). Optional `spend` hook for cost. Injectable `clock`; only the importer may set a write's time.
+- **Bundles** (`hypgraph/1-bundle`): every event and body as the exact hashed string, so they can be verified in any
+  language. Scoped exports redact events outside the investigation and say so. A complete bundle replays row for row.
+- **CLI**: `init`, `add`, `link`, `review`, `revise`, `withdraw`, `ls`, `show --why/--impact/--history`, `next`, `work`,
+  `report`, `export`, `import`, `verify`, `demo`, `schema`, `serve`, `mcp`, `skill`.
+- **MCP server** (FastMCP, `hypgraph[mcp]`): 17 tools, 4 resources, a `method` prompt. Writes as one fixed author.
+- **Agent skill**: `SKILL.md` ships in the package; `hypgraph skill --install`.
+- **Atlas**: the framework-free explorer, with an HTTP source and a bundle source (it verifies the chain in the
+  browser). Cytoscape is vendored.
+- **Demo**: Broad Street, 1854 — a teaching reconstruction with three refusals built into the story.
+- Fixed while extracting it: a report listed stale-reviewed claims under the wrong key; claim measurements now accept
+  result codes (RS3) and store ids.

{hypgraph-0.1.0 → hypgraph-0.2.0}/CITATION.cff

@@ -10,8 +10,10 @@ type: software
 authors:
   - family-names: Houghtaling
     given-names: Nicolas
+    affiliation: VoodooMods LLC
+  - name: VoodooMods LLC
 license: Apache-2.0
-version: 0.1.0
+version: 0.2.0
 date-released: "2026-10-24"
 url: "https://hypgraph.com"
 repository-code: "https://github.com/voodoomods/hypgraph"

hypgraph-0.2.0/NOTICE

@@ -0,0 +1,8 @@
+HypGraph
+Copyright 2026 Nicolas Houghtaling and VoodooMods LLC
+
+This product is licensed under the Apache License, Version 2.0 (see LICENSE).
+The record format specification and documentation are licensed under CC BY 4.0.
+
+This product includes software developed by third parties, shipped in src/hypgraph/ui/vendor/ under the MIT
+license: Cytoscape.js (The Cytoscape Consortium), layout-base, cose-base and cytoscape-fcose (iVis@Bilkent).

{hypgraph-0.1.0 → hypgraph-0.2.0}/PKG-INFO

@@ -1,14 +1,16 @@
 Metadata-Version: 2.5
 Name: hypgraph
-Version: 0.1.0
+Version: 0.2.0
 Summary: The evidence layer for AI research agents: a hash-chained research record that checks every claim as it is written and derives how well each is known.
 Project-URL: Homepage, https://hypgraph.com
 Project-URL: Documentation, https://hypgraph.com/engineers/
 Project-URL: Changelog, https://github.com/voodoomods/hypgraph/blob/main/CHANGELOG.md
 Project-URL: Source, https://github.com/voodoomods/hypgraph
-Author: Nicolas Houghtaling
+Author: Nicolas Houghtaling, VoodooMods LLC
+Maintainer: VoodooMods LLC
 License-Expression: Apache-2.0
 License-File: LICENSE
+License-File: NOTICE
 Keywords: agent-skills,ai-agents,evaluation,hypothesis,mcp,provenance,reproducibility,research
 Classifier: Development Status :: 3 - Alpha
 Classifier: Intended Audience :: Developers
@@ -38,21 +40,59 @@ The evidence layer for AI research agents.<br>
 
 ---
 
-Agents doing research write fluent summaries. Some of the numbers in them match no result. "Always" gets written
-about one run, a search too weak to find anything becomes "ruled out", and three copies of one result get counted as
-three lines of evidence. HypGraph is the record they write into instead. It checks every claim as it's written, so
-those claims can't get in:
+Agents doing research write fluent summaries. Some of the numbers in them match no result. A clean red-team run of
+50 prompts becomes "the model never leaks". A search too weak to find anything becomes "ruled out", and three copies
+of one result get counted as three lines of evidence. Then other claims, decisions and deployments get built on top.
+HypGraph is the record agents write into instead. It checks every claim as it's written, does the arithmetic the
+writer skipped, and refuses:
 
 ```text
-$ hypgraph add claim statement="The fine-tune is 5 points better than the baseline." scope="2,000 held-out items, greedy decoding, one seed." --link "supports:from:RS1:the eval run"
+$ hypgraph add claim statement="The model never leaks training data." exposure=1000000 exposure_unit=users …
 refused: claim refused:
-- numbers in the statement that no bound measurement, the scope or the investigation's constants account for: 5 — bind them to result fields (measurements) or move design constants into the scope
+- 'never' rests on 0 of 50: that only rules out it happening more than 5.8% of the time (95% upper bound).
+  Honest version: 'no occurrences in 50 trials (95% upper bound 5.8%)'. To support a rate below 1 in 1,000 you need
+  about 2,995 trials without one. Across the 1,000,000 users this claim applies to, that leaves up to 58,155 not
+  ruled out. [ABSOLUTE_UNDERPOWERED]
 ```
 
-(The result said 1,624 against 1,568 correct out of 2,000. That's 2.8 points.)
+The honest version goes in, and it carries its consequence wherever it's read:
 
-Every refusal says what to fix, so an agent can act on it. Nothing in the record is ever *set* as known. How well
-each claim is known is **derived on every read**:
+```text
+active claim · unchecked · 1 independent line of support · … · 0 of 50 = at most 5.8% at 95%, up to 58,155 of 1,000,000 not ruled out
+```
+
+## The arithmetic of never
+
+"Never" is the most expensive word in research, because everything built on it inherits it. Zero failures in *n*
+trials doesn't mean a rate of zero. It means a rate below 1 − 0.05^(1/*n*), about 3/*n*, at 95% confidence. HypGraph
+holds every claim to that:
+
+| The claim says | Refused as | Because |
+|---|---|---|
+| "never leaks", from 0 of 50 | `ABSOLUTE_UNDERPOWERED` | it could still be 5.8%, up to 58,155 of a million users |
+| "never leaks", from 0 of 3,000, without saying 3,000 | `ABSOLUTE_HIDES_DENOMINATOR` | readers hear "never", but it means "at most 1 in 1,000" |
+| "eliminates hallucinations entirely" | `ABSOLUTE_WITHOUT_COUNT` | nothing was counted |
+| "5 points better" (the counts say 2.8) | `UNBOUND_NUMBER` | the number comes from nowhere. 2.8 points, 81.2% vs 78.4% and +3.6% all pass, because they follow from the counts. |
+| "significantly better", counts 812/1,000 vs 800/1,000 | `SIGNIFICANCE_NOT_SHOWN` | the record runs the test: p = 0.5 |
+| "prompt format has no effect" | `EXCLUSION_WITHOUT_POWER` | at 2,000 items a 3.6-point effect would usually go unseen |
+| "longer prompts cause the gain" | `CAUSAL_WITHOUT_INTERVENTION` | no experiment intervened |
+| "outperforms the baseline", no numbers | `COMPARATIVE_WITHOUT_COMPARISON` | only one side was measured |
+
+Every refusal has a stable code, the arithmetic, and the sentence that *would* be honest, so an agent can repair a
+claim in one step. `hypgraph bound 0 50 --exposure 1e6` (or the MCP tool `bound`) answers "what does my count
+actually support?" before anyone writes the word.
+
+And when something does fall, the record says what falls with it:
+
+```text
+$ hypgraph withdraw CL1 --why "the held-out set leaked into training"
+CL1 — withdrawn claim · …
+  ⚠ 2 nodes rest on CL1: 1 decision (D1); 1 claim (CL2) — now AT RISK
+```
+
+## Derived, never asserted
+
+Nothing in the record is ever *set* as known. How well each claim is known is **derived on every read**:
 
 - **reviewed, and which version?** Only named reviewers count, and never on their own work. A revised claim goes back
   to unchecked.
@@ -76,7 +116,7 @@ hypgraph skill --install                                                     # +
 The server writes as one author, fixed when it starts. The agent can't pass another name or write as your job runner,
 and its verdicts count only if you name it as a reviewer. Tools: `overview`, `find`, `show`, `start_investigation`,
 `add`, `link`, `revise`, `withdraw`, `retract_link`, `review`, `next_experiments`, `work_queue`, `claim_work`,
-`register_run`, `report`, `verify`, `schema`. The method is in [AGENTS.md](https://github.com/voodoomods/hypgraph/blob/main/AGENTS.md); the short version is
+`register_run`, `bound`, `report`, `verify`, `schema`. The method is in [AGENTS.md](https://github.com/voodoomods/hypgraph/blob/main/AGENTS.md); the short version is
 [llms.txt](https://hypgraph.com/llms.txt).
 
 ## Wire it into your system
@@ -134,6 +174,10 @@ standing takes 0.09 s, reading one node 0.3 ms, and a write about 10 ms, mostly
 costs what it touches: cached standing is kept for every node the write can't affect, and a randomized suite checks
 that against a full rebuild.
 
+## Made by
+
+HypGraph is made by **Nicolas Houghtaling** at **[VoodooMods LLC](https://github.com/voodoomods)**.
+
 ## License
 
 Code: [Apache-2.0](https://github.com/voodoomods/hypgraph/blob/main/LICENSE). The record format ([docs/spec.md](https://github.com/voodoomods/hypgraph/blob/main/docs/spec.md)) and the docs: CC BY 4.0. Cite it with

{hypgraph-0.1.0 → hypgraph-0.2.0}/README.md

@@ -8,21 +8,59 @@ The evidence layer for AI research agents.<br>
 
 ---
 
-Agents doing research write fluent summaries. Some of the numbers in them match no result. "Always" gets written
-about one run, a search too weak to find anything becomes "ruled out", and three copies of one result get counted as
-three lines of evidence. HypGraph is the record they write into instead. It checks every claim as it's written, so
-those claims can't get in:
+Agents doing research write fluent summaries. Some of the numbers in them match no result. A clean red-team run of
+50 prompts becomes "the model never leaks". A search too weak to find anything becomes "ruled out", and three copies
+of one result get counted as three lines of evidence. Then other claims, decisions and deployments get built on top.
+HypGraph is the record agents write into instead. It checks every claim as it's written, does the arithmetic the
+writer skipped, and refuses:
 
 ```text
-$ hypgraph add claim statement="The fine-tune is 5 points better than the baseline." scope="2,000 held-out items, greedy decoding, one seed." --link "supports:from:RS1:the eval run"
+$ hypgraph add claim statement="The model never leaks training data." exposure=1000000 exposure_unit=users …
 refused: claim refused:
-- numbers in the statement that no bound measurement, the scope or the investigation's constants account for: 5 — bind them to result fields (measurements) or move design constants into the scope
+- 'never' rests on 0 of 50: that only rules out it happening more than 5.8% of the time (95% upper bound).
+  Honest version: 'no occurrences in 50 trials (95% upper bound 5.8%)'. To support a rate below 1 in 1,000 you need
+  about 2,995 trials without one. Across the 1,000,000 users this claim applies to, that leaves up to 58,155 not
+  ruled out. [ABSOLUTE_UNDERPOWERED]
 ```
 
-(The result said 1,624 against 1,568 correct out of 2,000. That's 2.8 points.)
+The honest version goes in, and it carries its consequence wherever it's read:
 
-Every refusal says what to fix, so an agent can act on it. Nothing in the record is ever *set* as known. How well
-each claim is known is **derived on every read**:
+```text
+active claim · unchecked · 1 independent line of support · … · 0 of 50 = at most 5.8% at 95%, up to 58,155 of 1,000,000 not ruled out
+```
+
+## The arithmetic of never
+
+"Never" is the most expensive word in research, because everything built on it inherits it. Zero failures in *n*
+trials doesn't mean a rate of zero. It means a rate below 1 − 0.05^(1/*n*), about 3/*n*, at 95% confidence. HypGraph
+holds every claim to that:
+
+| The claim says | Refused as | Because |
+|---|---|---|
+| "never leaks", from 0 of 50 | `ABSOLUTE_UNDERPOWERED` | it could still be 5.8%, up to 58,155 of a million users |
+| "never leaks", from 0 of 3,000, without saying 3,000 | `ABSOLUTE_HIDES_DENOMINATOR` | readers hear "never", but it means "at most 1 in 1,000" |
+| "eliminates hallucinations entirely" | `ABSOLUTE_WITHOUT_COUNT` | nothing was counted |
+| "5 points better" (the counts say 2.8) | `UNBOUND_NUMBER` | the number comes from nowhere. 2.8 points, 81.2% vs 78.4% and +3.6% all pass, because they follow from the counts. |
+| "significantly better", counts 812/1,000 vs 800/1,000 | `SIGNIFICANCE_NOT_SHOWN` | the record runs the test: p = 0.5 |
+| "prompt format has no effect" | `EXCLUSION_WITHOUT_POWER` | at 2,000 items a 3.6-point effect would usually go unseen |
+| "longer prompts cause the gain" | `CAUSAL_WITHOUT_INTERVENTION` | no experiment intervened |
+| "outperforms the baseline", no numbers | `COMPARATIVE_WITHOUT_COMPARISON` | only one side was measured |
+
+Every refusal has a stable code, the arithmetic, and the sentence that *would* be honest, so an agent can repair a
+claim in one step. `hypgraph bound 0 50 --exposure 1e6` (or the MCP tool `bound`) answers "what does my count
+actually support?" before anyone writes the word.
+
+And when something does fall, the record says what falls with it:
+
+```text
+$ hypgraph withdraw CL1 --why "the held-out set leaked into training"
+CL1 — withdrawn claim · …
+  ⚠ 2 nodes rest on CL1: 1 decision (D1); 1 claim (CL2) — now AT RISK
+```
+
+## Derived, never asserted
+
+Nothing in the record is ever *set* as known. How well each claim is known is **derived on every read**:
 
 - **reviewed, and which version?** Only named reviewers count, and never on their own work. A revised claim goes back
   to unchecked.
@@ -46,7 +84,7 @@ hypgraph skill --install                                                     # +
 The server writes as one author, fixed when it starts. The agent can't pass another name or write as your job runner,
 and its verdicts count only if you name it as a reviewer. Tools: `overview`, `find`, `show`, `start_investigation`,
 `add`, `link`, `revise`, `withdraw`, `retract_link`, `review`, `next_experiments`, `work_queue`, `claim_work`,
-`register_run`, `report`, `verify`, `schema`. The method is in [AGENTS.md](https://github.com/voodoomods/hypgraph/blob/main/AGENTS.md); the short version is
+`register_run`, `bound`, `report`, `verify`, `schema`. The method is in [AGENTS.md](https://github.com/voodoomods/hypgraph/blob/main/AGENTS.md); the short version is
 [llms.txt](https://hypgraph.com/llms.txt).
 
 ## Wire it into your system
@@ -104,6 +142,10 @@ standing takes 0.09 s, reading one node 0.3 ms, and a write about 10 ms, mostly
 costs what it touches: cached standing is kept for every node the write can't affect, and a randomized suite checks
 that against a full rebuild.
 
+## Made by
+
+HypGraph is made by **Nicolas Houghtaling** at **[VoodooMods LLC](https://github.com/voodoomods)**.
+
 ## License
 
 Code: [Apache-2.0](https://github.com/voodoomods/hypgraph/blob/main/LICENSE). The record format ([docs/spec.md](https://github.com/voodoomods/hypgraph/blob/main/docs/spec.md)) and the docs: CC BY 4.0. Cite it with

{hypgraph-0.1.0 → hypgraph-0.2.0}/docs/spec.md

@@ -1,6 +1,6 @@
 # The HypGraph record format — `hypgraph/1`
 
-Status: draft 1 (HypGraph 0.1). Licence: CC BY 4.0. This page is enough to write another implementation, a
+Status: draft 2 (HypGraph 0.2). Licence: CC BY 4.0. This page is enough to write another implementation, a
 verifier or a viewer.
 
 ## 1. Model
@@ -23,7 +23,7 @@ correction is a new row, never an edited one.
 | `investigation` | INV | **title**\*, **objective**\*, success_criteria, scope, state, reviewers, constants, strict_claims, keywords, projects, doi, note, legacy_case | The study: an objective, its scope, who reviews it. Every other node belongs to one. |
 | `question` | Q | **text**\*, why | Something you want to know. |
 | `hypothesis` | H | **statement**\*, assumptions, **predictions**\*, distinguishing, open_questions | A possible answer, with the predictions that would show it wrong. |
-| `claim` | CL | **statement**\*, scope, limitations, kind, measurements, evidence_note, legacy | What you assert is known, with its scope and its numbers bound to results. |
+| `claim` | CL | **statement**\*, scope, limitations, kind, measurements, evidence_note, exposure, exposure_unit, legacy | What you assert is known, with its scope and its numbers bound to results. |
 | `experiment` | X | **aim**\*, **protocol**\*, controls, **success_criteria**\*, method, budget, power_check, cost_minutes, seed | A planned test: aim, protocol, controls, success criteria, and what each hypothesis expects. |
 | `run` | RUN | **kind**\*, job_id, name, state, code, inputs, outputs, args, config, seed, env, started, finished, exit_code, log_sha256, note | One execution: code, inputs and outputs hashed, seed, state. `kind=lab` only from an instrument. |
 | `result` | RS | **summary**\*, kind, outcome, values, expected, limitations, power, evidence_note, legacy | What a run (or an observation, or a citation) found: values, outcome, power. |
@@ -158,14 +158,36 @@ Implementations must derive these, never store them:
 
 ## 7. Claim checks
 
-1. `finding` and `exclusion` need a scope of at least 10 characters.
-2. `finding`, `exclusion` and `inconclusive` need at least one supporting node.
-3. Each measurement must name a result and a key present in its `values`. Its `value` / `k` / `n` must equal the
-   result's at the precision written; a fraction ≤ 1 may be written as a percentage.
-4. Every number in the statement (digits, and the words two to twenty), except digits in quotes, must match a bound
-   measurement's numbers, a number in the scope, or one of the investigation's `constants`.
-5. Absolute words (never, always, all, every, none, impossible, cannot, proves, proven, certainly, guaranteed) need a
-   measurement with `n` and `k ∈ {0, n}`.
-6. An `exclusion` needs a supporting result with `power: demonstrated`, or one produced by a run of an experiment
-   with a `power_check`.
-7. A `convention` may not hedge (could, might, suggests, consistent with, …).
+A claim is checked before it enters the record. Each failed rule is reported with a stable code, a message that does
+the arithmetic, a suggested fix, and the words that triggered it. Checks are skipped for the operator and importer,
+and in an investigation with `strict_claims: false`. Leads and conventions skip rules 7–9.
+
+**Arithmetic.** For a count of k in n trials, the 95% interval is the Wilson score interval. At k = 0 (or k = n) it is
+the exact one-sided bound 1 − 0.05^(1/n), the "rule of three" (≈ 3/n). "Never, in n trials" means at most that rate,
+and never zero. Two counts are compared with Newcombe's hybrid score interval and a pooled two-proportion z-test. The
+smallest detectable difference uses 80% power at two-sided α = 0.05.
+
+| # | Code | Refused when |
+|---|---|---|
+| 1 | `SCOPE_MISSING` | a finding or exclusion has a scope shorter than 10 characters |
+| 2 | `EVIDENCE_MISSING` | a finding, exclusion or inconclusive claim has no supporting node |
+| 3 | `MEASUREMENT_MALFORMED` / `MEASUREMENT_UNKNOWN_FIELD` / `MEASUREMENT_MISMATCH` | a measurement doesn't name a result and a key present in its `values`, or states a `value` / `k` / `n` different from the result's at the precision written (a fraction ≤ 1 may be written as a percentage) |
+| 4 | `UNBOUND_NUMBER` | a number in the statement (digits, or the words two to twenty; digits in quotes are names) is not one of: a bound measurement's numbers; for a count, its rate, complement or n − k; for any two measurements, their difference, ratios, relative change or sum; the scope's numbers; the investigation's `constants`; or the conventions 95 / 99 / 90 / 80 / 0.05 / 0.01 when the statement speaks of intervals, bounds, confidence, power or significance. *Statistical* quantities (a rate's 95% bounds; for two counts the difference interval, p-value and detectable difference) count only when written to at least one decimal place. |
+| 5 | `ABSOLUTE_WITHOUT_COUNT` | an absolute word (never, always, all, every, none, impossible, cannot, proves, certainly, guaranteed, eliminates, entirely, completely, universally, consistently, perfect, solves, zero, 100%, …) with no bound count where k is 0 or n |
+| 5a | `ABSOLUTE_UNRELATED_COUNT` | the counts with k ∈ {0, n} share no content word with the statement in their name or key |
+| 5b | `ABSOLUTE_UNDERPOWERED` | the 95% bound on the opposite rate is above 5%. The message gives the honest wording and the trials needed for a 1-in-1,000 bound. |
+| 5c | `ABSOLUTE_HIDES_DENOMINATOR` | the count is enough, but n appears in neither the statement nor the scope |
+| 6 | `CONVENTION_HEDGED` | a `convention` hedges (could, might, suggests, consistent with, …) |
+| 7 | `COMPARATIVE_WITHOUT_COMPARISON` | a comparative (better, beats, outperforms, higher than, improves, exceeds, …) with fewer than two measured sides, no bound p-value or interval, and no supporting claim that binds two sides |
+| 8 | `SIGNIFICANCE_WITHOUT_TEST` / `SIGNIFICANCE_NOT_SHOWN` | "significantly" / "statistically" with no bound p-value and fewer than two counts, or when the bound p-value, or the test the record runs on the first two counts, is not below 0.05 |
+| 9 | `CAUSAL_WITHOUT_INTERVENTION` | a causal word (causes, leads to, results in, drives, due to, because of, responsible for, …) when no supporting result was produced by a run that `executes` an experiment |
+| 10 | `EXCLUSION_WITHOUT_POWER` | `kind: exclusion`, or wording that says an effect is absent (no effect, no difference, makes no difference, does not affect, rules out, ineffective, …) in a finding, without a supporting result with `power: demonstrated` or one produced by a run of an experiment with a `power_check`. With two counts, the message gives the smallest detectable difference. |
+
+**Exposure.** A claim may set `exposure` (how many uses, users or units it will be applied to) and `exposure_unit`.
+Absolute refusals then state how many failures the bound leaves unruled out at that scale. An accepted claim's
+standing carries `bounds` (per count: k, n, rate, lo, hi and, with exposure, `unruled_out`), its sentence reads
+"'never' = at most 0.1% (0 of 3,000, 95%), up to 998 of 1,000,000 not ruled out", and a "significantly" claim carries
+`test` (the difference, its interval and p).
+
+**Blast radius.** Withdrawing a node, or a verdict that makes it fall, returns `blast_radius`: every node resting on it
+by type, with claims and decisions named and, if a spend meter is connected, the cost of the work behind them.

{hypgraph-0.1.0 → hypgraph-0.2.0}/pyproject.toml

@@ -8,9 +8,10 @@ dynamic = ["version"]
 description = "The evidence layer for AI research agents: a hash-chained research record that checks every claim as it is written and derives how well each is known."
 readme = "README.md"
 license = "Apache-2.0"
-license-files = ["LICENSE"]
+license-files = ["LICENSE", "NOTICE"]
 requires-python = ">=3.10"
-authors = [{ name = "Nicolas Houghtaling" }]
+authors = [{ name = "Nicolas Houghtaling" }, { name = "VoodooMods LLC" }]
+maintainers = [{ name = "VoodooMods LLC" }]
 keywords = ["ai-agents", "mcp", "agent-skills", "research", "provenance", "reproducibility", "evaluation", "hypothesis"]
 classifiers = [
   "Development Status :: 3 - Alpha",
@@ -45,7 +46,7 @@ path = "src/hypgraph/__init__.py"
 packages = ["src/hypgraph"]
 
 [tool.hatch.build.targets.sdist]
-include = ["src/hypgraph", "tests", "docs", "README.md", "LICENSE", "CITATION.cff", "AGENTS.md"]
+include = ["src/hypgraph", "tests", "docs", "README.md", "LICENSE", "NOTICE", "CITATION.cff", "AGENTS.md", "CHANGELOG.md"]
 
 [tool.pytest.ini_options]
 testpaths = ["tests", "src/hypgraph/__init__.py"]

{hypgraph-0.1.0 → hypgraph-0.2.0}/src/hypgraph/__init__.py

@@ -16,7 +16,7 @@ Standing is derived on every read, never stored; every write is an event in a SH
 their numbers; reviews pin versions; independence is counted, not assumed. See https://hypgraph.com.
 """
 
-__version__ = "0.1.0"
+__version__ = "0.2.0"
 
 from .bundle import verify_bundle  # noqa: E402
 from .graph import Author, Graph, GraphError, file_sha256  # noqa: E402