@lapxo/obligations 0.4.2 → 0.4.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,130 @@
1
+ {
2
+ "id": "L9-mix-noninjectivity",
3
+ "classification": [
4
+ "law-by-counterexample:existence-of-noninjectivity",
5
+ "measure-with-declared-prior"
6
+ ],
7
+ "policy": "vectors/laws/policy.json",
8
+ "sample": "samples/measures/l9-mix-loss.json",
9
+ "contract": {
10
+ "configuration": "Assignments of each named factor to a named value in the explicitly supplied admissible finite configuration list; duplicate assignments with new IDs are refused.",
11
+ "mix": "Exact rational sum of nonnegative declared weights by value, positive total; unique maximum emits that value, every tie emits the same distinguished bottom.",
12
+ "fork": "Assignments retain all factor names and values, hence are injective on the declared configurations.",
13
+ "prior": "Uniform is a selected modeling choice only when kind=uniform is explicitly present. Without a prior, unmeasured; explicit prior must name every configuration and sum exactly to one.",
14
+ "loss": "H(configuration | mix) under that prior, equal to H(configuration)-H(mix) for a deterministic projection; no causal, M/3, M/4 or algebraic-act contract is added.",
15
+ "ceiling": "budget bounds declared configuration count only; input validation, rational arithmetic and elapsed act cost are not claimed bounded by that count."
16
+ },
17
+ "oracle": {
18
+ "counterexample": {
19
+ "configurations": [
20
+ {
21
+ "x": "a",
22
+ "y": "b"
23
+ },
24
+ {
25
+ "x": "b",
26
+ "y": "a"
27
+ }
28
+ ],
29
+ "sameMix": "tie",
30
+ "distinctNamedForks": true
31
+ },
32
+ "uniformFourConfigurations": {
33
+ "configurationBits": 2,
34
+ "mixBits": 1.5,
35
+ "conditionalLossBits": 0.5,
36
+ "tiePosteriorBits": 1,
37
+ "forkLossBits": 0
38
+ },
39
+ "rejectedInterpretation": "log2(4/3) is not the conditional loss for this prior",
40
+ "numeric": "binary64-log2 approximations; tolerance 1e-12"
41
+ },
42
+ "nativeCapture": {
43
+ "instrument": "@lapxo/bound@0.1.8",
44
+ "mode": "published-host-ABI",
45
+ "host": "dist/cli/host.js",
46
+ "hostSha256": "sha256:b0f52ce76b88ed793543897a0bef490414bfb4af2f5b876a3665dabf8583f879",
47
+ "reader": "test/support/measures-reader.js",
48
+ "implementation": "vectors/laws/implementation-043.json",
49
+ "implementationSha256": "sha256:361492637c3ea9eeec83fe7707fd16a0ae53b8882fe4de212bae1838721b710f",
50
+ "limits": {
51
+ "timeoutMs": 5000,
52
+ "responseBytes": 65536
53
+ },
54
+ "fullFold": false,
55
+ "admission": false,
56
+ "signatures": false,
57
+ "captures": [
58
+ {
59
+ "place": "orchard",
60
+ "case": "yes",
61
+ "input": "[{\"protocol\":\"bound-lock/1\",\"verb\":\"read\",\"rootScope\":\"inputs/sample.json\",\"region\":\"measure\",\"files\":[{\"place\":\"inputs/sample.json\",\"text\":\"{\\\"model\\\":{\\\"factors\\\":[{\\\"id\\\":\\\"x\\\",\\\"weight\\\":\\\"1\\\"},{\\\"id\\\":\\\"y\\\",\\\"weight\\\":\\\"1\\\"}],\\\"alphabet\\\":[\\\"a\\\",\\\"b\\\"],\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"values\\\":[\\\"a\\\",\\\"a\\\"]},{\\\"id\\\":\\\"ab\\\",\\\"values\\\":[\\\"a\\\",\\\"b\\\"]},{\\\"id\\\":\\\"ba\\\",\\\"values\\\":[\\\"b\\\",\\\"a\\\"]},{\\\"id\\\":\\\"bb\\\",\\\"values\\\":[\\\"b\\\",\\\"b\\\"]}],\\\"prior\\\":{\\\"kind\\\":\\\"uniform\\\"}},\\\"policy\\\":{\\\"logarithm\\\":\\\"binary64-log2\\\",\\\"budget\\\":\\\"100\\\"},\\\"expected\\\":{\\\"configurationBits\\\":2,\\\"mixBits\\\":1.5,\\\"lossBits\\\":0.5,\\\"tieConditionalBits\\\":1,\\\"forkLossBits\\\":0},\\\"group\\\":\\\"l9-mix-loss\\\",\\\"place\\\":\\\"orchard\\\"}\\n\"}],\"lines\":[]}]",
62
+ "stdinSha256": "sha256:8490e9d9db186156ef7edd9052bfd4765b516b873d58e0de198cfdf231fb2cb9",
63
+ "status": 0,
64
+ "signal": null,
65
+ "runtimeMs": 126.06233299999985,
66
+ "stdout": "\n[{\"protocol\":\"bound-lock/1\",\"kind\":\"fact\",\"claims\":[{\"scope\":\"measurement/l9-mix-loss/orchard\",\"role\":\"writes\",\"measure\":\"result\",\"bound\":{\"kind\":\"enumerated\",\"values\":[\"{\\\"result\\\":{\\\"status\\\":\\\"measured\\\",\\\"model\\\":\\\"declared-weighted-mix-projection@1\\\",\\\"parameters\\\":{\\\"m\\\":2,\\\"factors\\\":[{\\\"id\\\":\\\"x\\\",\\\"weight\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}},{\\\"id\\\":\\\"y\\\",\\\"weight\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}}],\\\"alphabet\\\":[\\\"a\\\",\\\"b\\\"],\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"values\\\":[\\\"a\\\",\\\"a\\\"]},{\\\"id\\\":\\\"ab\\\",\\\"values\\\":[\\\"a\\\",\\\"b\\\"]},{\\\"id\\\":\\\"ba\\\",\\\"values\\\":[\\\"b\\\",\\\"a\\\"]},{\\\"id\\\":\\\"bb\\\",\\\"values\\\":[\\\"b\\\",\\\"b\\\"]}]},\\\"prior\\\":{\\\"kind\\\":\\\"uniform\\\",\\\"probabilities\\\":[{\\\"configuration\\\":\\\"aa\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}},{\\\"configuration\\\":\\\"ab\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}},{\\\"configuration\\\":\\\"ba\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}},{\\\"configuration\\\":\\\"bb\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}}]},\\\"policy\\\":{\\\"logarithm\\\":\\\"binary64-log2\\\",\\\"budget\\\":\\\"100\\\"},\\\"unit\\\":\\\"bits\\\",\\\"approximation\\\":\\\"binary64-log2\\\",\\\"configurationBits\\\":2,\\\"mixBits\\\":1.5,\\\"lossBits\\\":0.5,\\\"entropyDifferenceBits\\\":0.5,\\\"forkLossBits\\\":0,\\\"mixInjectiveOnConfigurations\\\":false,\\\"mixInjectiveOnPositiveSupport\\\":false,\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"a\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"a\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"a\\\"}]},{\\\"id\\\":\\\"ab\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"tie\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"a\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"b\\\"}]},{\\\"id\\\":\\\"ba\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"tie\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"b\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"a\\\"}]},{\\\"id\\\":\\\"bb\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"b\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"b\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"b\\\"}]}],\\\"outputs\\\":[{\\\"output\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"a\\\"},\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"configurations\\\":[\\\"aa\\\"],\\\"posterior\\\":[{\\\"configuration\\\":\\\"aa\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}}],\\\"conditionalBits\\\":0},{\\\"output\\\":{\\\"kind\\\":\\\"tie\\\"},\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"2\\\"},\\\"configurations\\\":[\\\"ab\\\",\\\"ba\\\"],\\\"posterior\\\":[{\\\"configuration\\\":\\\"ab\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"2\\\"}},{\\\"configuration\\\":\\\"ba\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"2\\\"}}],\\\"conditionalBits\\\":1},{\\\"output\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"b\\\"},\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"configurations\\\":[\\\"bb\\\"],\\\"posterior\\\":[{\\\"configuration\\\":\\\"bb\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}}],\\\"conditionalBits\\\":0}],\\\"meaning\\\":\\\"conditional entropy of the declared configuration given its deterministic mix output; named fork is injective\\\"},\\\"states\\\":[\\\"FREE\\\",\\\"REQUIRED\\\",\\\"FORBIDDEN\\\",\\\"CONFLICT\\\"]}\"]}}]}]\n",
67
+ "stderr": "",
68
+ "stdoutSha256": "sha256:ecb4e88e7e6525974d1e69a52d323501155dc359bf72249621dc1eebd7c73060",
69
+ "stderrSha256": "sha256:e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
70
+ "repeat": {
71
+ "status": 0,
72
+ "runtimeMs": 127.334292,
73
+ "stdoutSha256": "sha256:ecb4e88e7e6525974d1e69a52d323501155dc359bf72249621dc1eebd7c73060",
74
+ "stderr": "",
75
+ "byteIdentical": true,
76
+ "meaning": "fresh host execution, not a cache-reuse receipt"
77
+ }
78
+ },
79
+ {
80
+ "place": "orchard",
81
+ "case": "no",
82
+ "input": "[{\"protocol\":\"bound-lock/1\",\"verb\":\"read\",\"rootScope\":\"inputs/sample.json\",\"region\":\"measure\",\"files\":[{\"place\":\"inputs/sample.json\",\"text\":\"{\\\"model\\\":{\\\"factors\\\":[{\\\"id\\\":\\\"x\\\",\\\"weight\\\":\\\"1\\\"},{\\\"id\\\":\\\"y\\\",\\\"weight\\\":\\\"1\\\"}],\\\"alphabet\\\":[\\\"a\\\",\\\"b\\\"],\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"values\\\":[\\\"a\\\",\\\"a\\\"]},{\\\"id\\\":\\\"ab\\\",\\\"values\\\":[\\\"a\\\",\\\"b\\\"]},{\\\"id\\\":\\\"ba\\\",\\\"values\\\":[\\\"b\\\",\\\"a\\\"]},{\\\"id\\\":\\\"bb\\\",\\\"values\\\":[\\\"b\\\",\\\"b\\\"]}],\\\"prior\\\":{\\\"kind\\\":\\\"explicit\\\",\\\"probabilities\\\":[{\\\"configuration\\\":\\\"aa\\\",\\\"p\\\":\\\"1/8\\\"},{\\\"configuration\\\":\\\"ab\\\",\\\"p\\\":\\\"1/8\\\"},{\\\"configuration\\\":\\\"ba\\\",\\\"p\\\":\\\"1/8\\\"},{\\\"configuration\\\":\\\"bb\\\",\\\"p\\\":\\\"1/8\\\"}]}},\\\"policy\\\":{\\\"logarithm\\\":\\\"binary64-log2\\\",\\\"budget\\\":\\\"100\\\"},\\\"expectedRefusal\\\":\\\"REFUSE·mix-loss prior probabilities must sum exactly to one\\\",\\\"group\\\":\\\"l9-mix-loss\\\",\\\"place\\\":\\\"orchard\\\"}\\n\"}],\"lines\":[]}]",
83
+ "stdinSha256": "sha256:9454f6951a913341f4c5435abaa75d675ef78c675639c9c8f2b5012cda13f595",
84
+ "status": 0,
85
+ "signal": null,
86
+ "runtimeMs": 124.40258300000005,
87
+ "stdout": "\n[{\"protocol\":\"bound-lock/1\",\"kind\":\"refuse\",\"why\":\"Error: REFUSE·mix-loss prior probabilities must sum exactly to one\"}]\n",
88
+ "stderr": "",
89
+ "stdoutSha256": "sha256:22e1ffc0fc7c27e0fed1e1a62dacdd17088a6c0814e2301138c80b0758b3de34",
90
+ "stderrSha256": "sha256:e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
91
+ },
92
+ {
93
+ "place": "catalog",
94
+ "case": "yes",
95
+ "input": "[{\"protocol\":\"bound-lock/1\",\"verb\":\"read\",\"rootScope\":\"inputs/sample.json\",\"region\":\"measure\",\"files\":[{\"place\":\"inputs/sample.json\",\"text\":\"{\\\"model\\\":{\\\"factors\\\":[{\\\"id\\\":\\\"x\\\",\\\"weight\\\":\\\"1\\\"},{\\\"id\\\":\\\"y\\\",\\\"weight\\\":\\\"1\\\"}],\\\"alphabet\\\":[\\\"a\\\",\\\"b\\\"],\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"values\\\":[\\\"a\\\",\\\"a\\\"]},{\\\"id\\\":\\\"ab\\\",\\\"values\\\":[\\\"a\\\",\\\"b\\\"]},{\\\"id\\\":\\\"ba\\\",\\\"values\\\":[\\\"b\\\",\\\"a\\\"]},{\\\"id\\\":\\\"bb\\\",\\\"values\\\":[\\\"b\\\",\\\"b\\\"]}],\\\"prior\\\":{\\\"kind\\\":\\\"uniform\\\"}},\\\"policy\\\":{\\\"logarithm\\\":\\\"binary64-log2\\\",\\\"budget\\\":\\\"100\\\"},\\\"expected\\\":{\\\"configurationBits\\\":2,\\\"mixBits\\\":1.5,\\\"lossBits\\\":0.5,\\\"tieConditionalBits\\\":1,\\\"forkLossBits\\\":0},\\\"group\\\":\\\"l9-mix-loss\\\",\\\"place\\\":\\\"catalog\\\"}\\n\"}],\"lines\":[]}]",
96
+ "stdinSha256": "sha256:8b75462af1be9958dd5abffeb94a37d6803024495466da8c313f207beb9e7745",
97
+ "status": 0,
98
+ "signal": null,
99
+ "runtimeMs": 125.88016700000003,
100
+ "stdout": "\n[{\"protocol\":\"bound-lock/1\",\"kind\":\"fact\",\"claims\":[{\"scope\":\"measurement/l9-mix-loss/catalog\",\"role\":\"writes\",\"measure\":\"result\",\"bound\":{\"kind\":\"enumerated\",\"values\":[\"{\\\"result\\\":{\\\"status\\\":\\\"measured\\\",\\\"model\\\":\\\"declared-weighted-mix-projection@1\\\",\\\"parameters\\\":{\\\"m\\\":2,\\\"factors\\\":[{\\\"id\\\":\\\"x\\\",\\\"weight\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}},{\\\"id\\\":\\\"y\\\",\\\"weight\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}}],\\\"alphabet\\\":[\\\"a\\\",\\\"b\\\"],\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"values\\\":[\\\"a\\\",\\\"a\\\"]},{\\\"id\\\":\\\"ab\\\",\\\"values\\\":[\\\"a\\\",\\\"b\\\"]},{\\\"id\\\":\\\"ba\\\",\\\"values\\\":[\\\"b\\\",\\\"a\\\"]},{\\\"id\\\":\\\"bb\\\",\\\"values\\\":[\\\"b\\\",\\\"b\\\"]}]},\\\"prior\\\":{\\\"kind\\\":\\\"uniform\\\",\\\"probabilities\\\":[{\\\"configuration\\\":\\\"aa\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}},{\\\"configuration\\\":\\\"ab\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}},{\\\"configuration\\\":\\\"ba\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}},{\\\"configuration\\\":\\\"bb\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"}}]},\\\"policy\\\":{\\\"logarithm\\\":\\\"binary64-log2\\\",\\\"budget\\\":\\\"100\\\"},\\\"unit\\\":\\\"bits\\\",\\\"approximation\\\":\\\"binary64-log2\\\",\\\"configurationBits\\\":2,\\\"mixBits\\\":1.5,\\\"lossBits\\\":0.5,\\\"entropyDifferenceBits\\\":0.5,\\\"forkLossBits\\\":0,\\\"mixInjectiveOnConfigurations\\\":false,\\\"mixInjectiveOnPositiveSupport\\\":false,\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"a\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"a\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"a\\\"}]},{\\\"id\\\":\\\"ab\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"tie\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"a\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"b\\\"}]},{\\\"id\\\":\\\"ba\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"tie\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"b\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"a\\\"}]},{\\\"id\\\":\\\"bb\\\",\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"mix\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"b\\\"},\\\"fork\\\":[{\\\"factor\\\":\\\"x\\\",\\\"value\\\":\\\"b\\\"},{\\\"factor\\\":\\\"y\\\",\\\"value\\\":\\\"b\\\"}]}],\\\"outputs\\\":[{\\\"output\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"a\\\"},\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"configurations\\\":[\\\"aa\\\"],\\\"posterior\\\":[{\\\"configuration\\\":\\\"aa\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}}],\\\"conditionalBits\\\":0},{\\\"output\\\":{\\\"kind\\\":\\\"tie\\\"},\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"2\\\"},\\\"configurations\\\":[\\\"ab\\\",\\\"ba\\\"],\\\"posterior\\\":[{\\\"configuration\\\":\\\"ab\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"2\\\"}},{\\\"configuration\\\":\\\"ba\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"2\\\"}}],\\\"conditionalBits\\\":1},{\\\"output\\\":{\\\"kind\\\":\\\"value\\\",\\\"value\\\":\\\"b\\\"},\\\"probability\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"4\\\"},\\\"configurations\\\":[\\\"bb\\\"],\\\"posterior\\\":[{\\\"configuration\\\":\\\"bb\\\",\\\"p\\\":{\\\"numerator\\\":\\\"1\\\",\\\"denominator\\\":\\\"1\\\"}}],\\\"conditionalBits\\\":0}],\\\"meaning\\\":\\\"conditional entropy of the declared configuration given its deterministic mix output; named fork is injective\\\"},\\\"states\\\":[\\\"FREE\\\",\\\"REQUIRED\\\",\\\"FORBIDDEN\\\",\\\"CONFLICT\\\"]}\"]}}]}]\n",
101
+ "stderr": "",
102
+ "stdoutSha256": "sha256:a90a0118bdde5f1fa65353304761ea57b9d67a09155e9174288f3a7501c0b916",
103
+ "stderrSha256": "sha256:e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
104
+ "repeat": {
105
+ "status": 0,
106
+ "runtimeMs": 129.32158299999992,
107
+ "stdoutSha256": "sha256:a90a0118bdde5f1fa65353304761ea57b9d67a09155e9174288f3a7501c0b916",
108
+ "stderr": "",
109
+ "byteIdentical": true,
110
+ "meaning": "fresh host execution, not a cache-reuse receipt"
111
+ }
112
+ },
113
+ {
114
+ "place": "catalog",
115
+ "case": "no",
116
+ "input": "[{\"protocol\":\"bound-lock/1\",\"verb\":\"read\",\"rootScope\":\"inputs/sample.json\",\"region\":\"measure\",\"files\":[{\"place\":\"inputs/sample.json\",\"text\":\"{\\\"model\\\":{\\\"factors\\\":[{\\\"id\\\":\\\"x\\\",\\\"weight\\\":\\\"1\\\"},{\\\"id\\\":\\\"y\\\",\\\"weight\\\":\\\"1\\\"}],\\\"alphabet\\\":[\\\"a\\\",\\\"b\\\"],\\\"configurations\\\":[{\\\"id\\\":\\\"aa\\\",\\\"values\\\":[\\\"a\\\",\\\"a\\\"]},{\\\"id\\\":\\\"ab\\\",\\\"values\\\":[\\\"a\\\",\\\"b\\\"]},{\\\"id\\\":\\\"ba\\\",\\\"values\\\":[\\\"b\\\",\\\"a\\\"]},{\\\"id\\\":\\\"bb\\\",\\\"values\\\":[\\\"b\\\",\\\"b\\\"]}],\\\"prior\\\":{\\\"kind\\\":\\\"explicit\\\",\\\"probabilities\\\":[{\\\"configuration\\\":\\\"aa\\\",\\\"p\\\":\\\"1/8\\\"},{\\\"configuration\\\":\\\"ab\\\",\\\"p\\\":\\\"1/8\\\"},{\\\"configuration\\\":\\\"ba\\\",\\\"p\\\":\\\"1/8\\\"},{\\\"configuration\\\":\\\"bb\\\",\\\"p\\\":\\\"1/8\\\"}]}},\\\"policy\\\":{\\\"logarithm\\\":\\\"binary64-log2\\\",\\\"budget\\\":\\\"100\\\"},\\\"expectedRefusal\\\":\\\"REFUSE·mix-loss prior probabilities must sum exactly to one\\\",\\\"group\\\":\\\"l9-mix-loss\\\",\\\"place\\\":\\\"catalog\\\"}\\n\"}],\"lines\":[]}]",
117
+ "stdinSha256": "sha256:d4dec3671ea9f327062e3e54e2638d9b0c3231a25148d6642db62475b6710612",
118
+ "status": 0,
119
+ "signal": null,
120
+ "runtimeMs": 126.56683399999974,
121
+ "stdout": "\n[{\"protocol\":\"bound-lock/1\",\"kind\":\"refuse\",\"why\":\"Error: REFUSE·mix-loss prior probabilities must sum exactly to one\"}]\n",
122
+ "stderr": "",
123
+ "stdoutSha256": "sha256:22e1ffc0fc7c27e0fed1e1a62dacdd17088a6c0814e2301138c80b0758b3de34",
124
+ "stderrSha256": "sha256:e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
125
+ }
126
+ ],
127
+ "isolation": "two separate working directories with identical digest-verified reader image; no ledger, key or store; one origin"
128
+ },
129
+ "admission": "not performed; no signatures or owner authority"
130
+ }
@@ -0,0 +1,22 @@
1
+ {
2
+ "id": "obligations-mathematical-vectors@1",
3
+ "scope": "Mathematical vector interpretation and test-only byte identity; no admission, signing, origin status or general fold engine.",
4
+ "numeric": {
5
+ "probabilities": "Exact rational arithmetic. Fractions use rational strings or numerator/denominator integer strings. Explicit finite dyadic constants such as 0, 0.25, 0.5 and 1 in fixed tables denote those exact rationals; do not infer measured probabilities from agreement.",
6
+ "integerCertificates": "Integer coefficients, counts and finite certificate identities are exact. State counts and partition witnesses retain their handed finite domains.",
7
+ "logarithms": {"policy":"binary64-log2","meaning":"Entropy, phase and information values computed with Math.log2 are explicit binary64 approximations, not exact real certificates.","defaultAbsoluteTolerance":1e-12,"exception":"A vector or reused historical sample may declare its own decimal precision or tolerance; the specific test must state it."}
8
+ },
9
+ "jsonIdentity": {
10
+ "objectKeys": "Sort object keys lexicographically recursively before JSON serialization.",
11
+ "arrays": "Preserve every array's order, including constraint witnesses, coefficient order, effective act order and timestamps. Never sort arrays merely to make hashes equal.",
12
+ "numbers": "Use the handed finite JSON numbers with standard JSON encoding; no decimal rounding, epsilon normalization or replacement of approximation by an exact claim.",
13
+ "hash": "SHA-256 of the resulting UTF-8 JSON bytes, demonstrated only in tests. A hash establishes byte identity under the declared projection, not theorem truth."
14
+ },
15
+ "claimCollectionProjection": {
16
+ "domain": "Fixed distinct static claims with explicit unique IDs, fixed values and origins, and no order-sensitive widening, withdrawal, epoch or mark interpretation.",
17
+ "operation": "Keep every claim field and sort this explicitly named collection by its unique ID before canonical JSON encoding. This sorting is a projection specific to that unordered collection; it does not reorder the object or its effective acts.",
18
+ "duplicates": "Duplicate IDs fall outside the distinct-claim domain and are refused; conflicting duplicates are never resolved by first/last arrival or a chosen value.",
19
+ "limit": "Equal hashes across arrival permutations apply only to this fixed unordered projection. Distinct effective mark order, including equal-time widening/signature sequence, remains visible and may have different values and hashes."
20
+ },
21
+ "research": "Claimed general hypotheses, C3 unqualified odd-period argmin and any unspecified objective stay open. Passing finite vectors alone does not establish unrestricted proofs or independent origins."
22
+ }
@@ -3,10 +3,11 @@
3
3
  "places": [
4
4
  {
5
5
  "name": "orchard",
6
- "code": "sha256:978a5ef46a25146aea963e22998812e4198628ed97823c71ed83922a2c260840",
6
+ "archiveSha256": "sha256:d0b0c996db09d07b6ea192daf05b89a04519c784341b9b478d59b84b35d939c8",
7
+ "code": "sha256:16593a568f0aef344df7c9f5d3363c86ef3b53f4ecda724f55f08c005f14c401",
7
8
  "tests": {
8
9
  "status": 0,
9
- "stdout": "\u2714 finite exact joint probabilities reproduce the four captured information vectors (151.624459ms)\n\u2714 p=0 is k-invariant; limit statements never overwrite finite or uninformative channels (0.831958ms)\n\u2714 the binary all-wrong channel carries a full bit; plurality is not an information bound (0.165ms)\n\u2714 finite decision accuracy, decision information and posterior information stay separate (9.463667ms)\n\u2714 work budgets refuse before exponential evaluation and logs are explicitly declared (0.327792ms)\n\u2714 equal pair marginals hide XOR dependence; signed coincidence excess keeps the triple deficit (1.731625ms)\n\u2714 uniform independent wrong values exactly match the declared reference (6.408916ms)\n\u2714 independent events with nonuniform labels exceed the uniform reference without proving a cause (0.864208ms)\n\u2714 redelivery and ordering add no event; conflicting values refuse; inputs stay unchanged (0.619458ms)\n\u2714 absence, zero reference and insufficient budget are distinct, never inferred independence (0.322459ms)\n\u2714 estimated marginals condition on truth rather than pooling distinct populations (0.25575ms)\n\u2714 042 installed covering cause preserves declared symmetric channel boundaries (7.677333ms)\n\u2714 042 installed covering cause refuses missing accuracy and invalid probabilities (0.277542ms)\n\u2714 042 installed union bound retains justification and refuses unnamed premises (1.092916ms)\n\u2714 042 installed tolerant count keeps heterogeneous subset bounds and paired failure counterexample (0.834417ms)\n\u2714 042 installed three conditional measures preserve every frozen algebra state (7.96675ms)\n\u2714 analytic eigensystem satisfies residual and orthogonality; inputs are unchanged (1.789125ms)\n\u2714 repeated eigenvalues have no unique top loading; their full variance subspace remains readable (1.515167ms)\n\u2714 subset variance is descriptive, not a probability of error (0.175375ms)\n\u2714 invalid matrices refuse, and an insufficient numerical budget never claims a spectrum (0.526041ms)\n\u2714 spectrum and trace participation ratios agree on handed error events (0.672709ms)\n\u2714 T1 handles counterexample, degeneracies, and large counts without underflow misclassification (0.340666ms)\n\u2714 descent counts distinct scopes, keeps absence unknown, and refuses cycles (0.312541ms)\n\u2714 independent balanced errors and perfectly shared errors have different effective ranks (1.47525ms)\n\u2714 redelivery and declaration order add neither observations nor origins (0.730791ms)\n\u2714 missing observations and no variation do not prove independence (0.112625ms)\n\u2714 population covariance is normalized by the observed event population (0.478084ms)\n\u2714 T5 reference stream reproduces model counts without claiming certification (103.775792ms)\n\u2714 interest is an explicit controlled bias within the reference model (14.584083ms)\n\u2714 declared finite-data fit recovers shared log survival, records residuals and reproducible bootstrap, never \u03a6 or D (3.478417ms)\n\u2714 zero joint counts, absent rank and insufficient resources never report fitted probabilities (0.221ms)\n\u2714 the same finite-data procedure identifies a declared overlapping two-factor system (1.337042ms)\n\u2714 population identification recovers exact shared survival without identifying private versus singleton error (1.6775ms)\n\u2714 rank, zero correctness, incompatible moments and budget retain unidentified or misfit outcomes (0.175208ms)\n\u2714 general declared pair systems recover more than one factor and reject unexplained residuals (0.262417ms)\n\u2714 dissent certificate depends on actual ordered configuration, never on dissent alone (0.556166ms)\n\u2714 M/3 captured covering, partial and impossible-conditioning vectors are exact (2.809417ms)\n\u2714 singleton governance is preserved and collision partitions distinguish zero from absence (0.380041ms)\n\u2714 probe uses the exact posterior and is unmeasured only at zero extension mass (0.131333ms)\n\u2714 validation and budget refuse or remain unmeasured before accumulating a partial result (1.362583ms)\n\u2714 half-even display is independent of binary floating point and uses declared digits (0.136333ms)\n\u2714 controlled T1 and T5 declare their stream and denominators and match handed M/3 populations (64.287542ms)\n\u2714 partition evaluator equals direct wrong-value enumeration for overlapping factors on a three-value cell (0.982292ms)\n\u2714 the actual four algebraic states and their cells survive every descriptive measure unchanged (4.754416ms)\n\u2714 an exact curve retains both binary parameter branches rather than fabricating identification (1.855042ms)\n\u2714 perfect unanimity keeps the whole compatible ambiguity and no causal result (0.21525ms)\n\u2714 paired-group bootstrap retains cross-size sampling dependence and is deterministic (2.403125ms)\n\u2714 counts alone do not invent sampling uncertainty; inconsistent paired outcomes refuse (0.327375ms)\n\u2139 tests 48\n\u2139 suites 0\n\u2139 pass 48\n\u2139 fail 0\n\u2139 cancelled 0\n\u2139 skipped 0\n\u2139 todo 0\n\u2139 duration_ms 348.229875\n",
10
+ "stdout": "✔ L7 exact oracles include sum-p>=1 without triviality and retain stronger 0.4.2 bound (1.917792ms)\n✔ L7 actual dependent witness refutes top-k+1 guarantee (0.140542ms)\n✔ L7 sorted coefficient formula bounds all triples of events on nonuniform four-atom space (50.850667ms)\n✔ L7 pairwise zero correlation cannot pay for joint-independence convolution (0.622959ms)\n✔ L7 refuses absent hypotheses, malformed marginals and count domains by name (0.249459ms)\n✔ L8 fixed numerical controls distinguish odd minimum, negative defect and zero-shift maximum (1.3195ms)\n✔ L8 exhaustively checks the handed finite domain, including degeneracies and symmetry (3.55375ms)\n✔ L8 refuses invalid domains and information interpretations by name (0.318417ms)\n✔ L9: one mix tie hides two named forks; uniform mean loss is half a bit (1.8655ms)\n✔ L9: missing prior stays unmeasured, invalid declared priors refuse by name (0.321833ms)\n✔ L9: support and prior affect loss; zero mass does not imply global injectivity (0.207292ms)\n✔ L9: constant winners may lose information and weight rescaling adds none (0.11575ms)\n✔ L9: named value tie and bottom tie remain distinct; aliases cannot inflate configuration entropy (0.150458ms)\n✔ L9: explicit logarithm policy and configuration ceiling are retained (0.065667ms)\nℹ tests 14\nℹ suites 0\nℹ pass 14\nℹ fail 0\nℹ cancelled 0\nℹ skipped 0\nℹ todo 0\nℹ duration_ms 179.033125\n",
10
11
  "stderr": ""
11
12
  },
12
13
  "exports": {
@@ -16,16 +17,18 @@
16
17
  },
17
18
  "check": {
18
19
  "status": 0,
19
- "stdout": "PASS closed \u00b7 1 places \u00b7 741 ms\n",
20
- "stderr": "RECEIPTS 13 read \u00b7 0 opened \u00b7 reading closures\nRECEIPTS 1 read \u00b7 0 opened \u00b7 741 ms\nCOST act 1 s\n"
20
+ "stdout": "PASS closed · 1 places · 630 ms\n",
21
+ "stderr": "RECEIPTS 16 read · 0 opened · reading closures\nRECEIPTS 1 read · 0 opened · 630 ms\nCOST act 1 s\n",
22
+ "archiveSha256": "sha256:d0b0c996db09d07b6ea192daf05b89a04519c784341b9b478d59b84b35d939c8"
21
23
  }
22
24
  },
23
25
  {
24
26
  "name": "catalog",
25
- "code": "sha256:978a5ef46a25146aea963e22998812e4198628ed97823c71ed83922a2c260840",
27
+ "archiveSha256": "sha256:d0b0c996db09d07b6ea192daf05b89a04519c784341b9b478d59b84b35d939c8",
28
+ "code": "sha256:16593a568f0aef344df7c9f5d3363c86ef3b53f4ecda724f55f08c005f14c401",
26
29
  "tests": {
27
30
  "status": 0,
28
- "stdout": "\u2714 finite exact joint probabilities reproduce the four captured information vectors (125.380708ms)\n\u2714 p=0 is k-invariant; limit statements never overwrite finite or uninformative channels (0.839667ms)\n\u2714 the binary all-wrong channel carries a full bit; plurality is not an information bound (0.168834ms)\n\u2714 finite decision accuracy, decision information and posterior information stay separate (6.465958ms)\n\u2714 work budgets refuse before exponential evaluation and logs are explicitly declared (0.332292ms)\n\u2714 equal pair marginals hide XOR dependence; signed coincidence excess keeps the triple deficit (1.745875ms)\n\u2714 uniform independent wrong values exactly match the declared reference (12.067ms)\n\u2714 independent events with nonuniform labels exceed the uniform reference without proving a cause (0.982083ms)\n\u2714 redelivery and ordering add no event; conflicting values refuse; inputs stay unchanged (0.772042ms)\n\u2714 absence, zero reference and insufficient budget are distinct, never inferred independence (0.300875ms)\n\u2714 estimated marginals condition on truth rather than pooling distinct populations (0.321292ms)\n\u2714 042 installed covering cause preserves declared symmetric channel boundaries (1.383ms)\n\u2714 042 installed covering cause refuses missing accuracy and invalid probabilities (0.206875ms)\n\u2714 042 installed union bound retains justification and refuses unnamed premises (0.750208ms)\n\u2714 042 installed tolerant count keeps heterogeneous subset bounds and paired failure counterexample (0.300792ms)\n\u2714 042 installed three conditional measures preserve every frozen algebra state (0.336958ms)\n\u2714 analytic eigensystem satisfies residual and orthogonality; inputs are unchanged (0.852958ms)\n\u2714 repeated eigenvalues have no unique top loading; their full variance subspace remains readable (7.810292ms)\n\u2714 subset variance is descriptive, not a probability of error (0.105625ms)\n\u2714 invalid matrices refuse, and an insufficient numerical budget never claims a spectrum (0.28125ms)\n\u2714 spectrum and trace participation ratios agree on handed error events (0.320667ms)\n\u2714 T1 handles counterexample, degeneracies, and large counts without underflow misclassification (0.170084ms)\n\u2714 descent counts distinct scopes, keeps absence unknown, and refuses cycles (0.158125ms)\n\u2714 independent balanced errors and perfectly shared errors have different effective ranks (1.451917ms)\n\u2714 redelivery and declaration order add neither observations nor origins (0.2225ms)\n\u2714 missing observations and no variation do not prove independence (0.0735ms)\n\u2714 population covariance is normalized by the observed event population (0.082625ms)\n\u2714 T5 reference stream reproduces model counts without claiming certification (82.277459ms)\n\u2714 interest is an explicit controlled bias within the reference model (10.119042ms)\n\u2714 declared finite-data fit recovers shared log survival, records residuals and reproducible bootstrap, never \u03a6 or D (2.4735ms)\n\u2714 zero joint counts, absent rank and insufficient resources never report fitted probabilities (0.227709ms)\n\u2714 the same finite-data procedure identifies a declared overlapping two-factor system (3.545042ms)\n\u2714 population identification recovers exact shared survival without identifying private versus singleton error (1.660584ms)\n\u2714 rank, zero correctness, incompatible moments and budget retain unidentified or misfit outcomes (0.172125ms)\n\u2714 general declared pair systems recover more than one factor and reject unexplained residuals (2.479708ms)\n\u2714 dissent certificate depends on actual ordered configuration, never on dissent alone (0.60925ms)\n\u2714 M/3 captured covering, partial and impossible-conditioning vectors are exact (2.146125ms)\n\u2714 singleton governance is preserved and collision partitions distinguish zero from absence (0.380084ms)\n\u2714 probe uses the exact posterior and is unmeasured only at zero extension mass (0.128459ms)\n\u2714 validation and budget refuse or remain unmeasured before accumulating a partial result (0.480125ms)\n\u2714 half-even display is independent of binary floating point and uses declared digits (0.071583ms)\n\u2714 controlled T1 and T5 declare their stream and denominators and match handed M/3 populations (47.147625ms)\n\u2714 partition evaluator equals direct wrong-value enumeration for overlapping factors on a three-value cell (0.354083ms)\n\u2714 the actual four algebraic states and their cells survive every descriptive measure unchanged (4.505917ms)\n\u2714 an exact curve retains both binary parameter branches rather than fabricating identification (1.923667ms)\n\u2714 perfect unanimity keeps the whole compatible ambiguity and no causal result (0.186041ms)\n\u2714 paired-group bootstrap retains cross-size sampling dependence and is deterministic (1.529292ms)\n\u2714 counts alone do not invent sampling uncertainty; inconsistent paired outcomes refuse (0.26275ms)\n\u2139 tests 48\n\u2139 suites 0\n\u2139 pass 48\n\u2139 fail 0\n\u2139 cancelled 0\n\u2139 skipped 0\n\u2139 todo 0\n\u2139 duration_ms 315.037167\n",
31
+ "stdout": "✔ L7 exact oracles include sum-p>=1 without triviality and retain stronger 0.4.2 bound (1.975291ms)\n✔ L7 actual dependent witness refutes top-k+1 guarantee (0.154ms)\n✔ L7 sorted coefficient formula bounds all triples of events on nonuniform four-atom space (55.736125ms)\n✔ L7 pairwise zero correlation cannot pay for joint-independence convolution (0.670666ms)\n✔ L7 refuses absent hypotheses, malformed marginals and count domains by name (0.276833ms)\n✔ L8 fixed numerical controls distinguish odd minimum, negative defect and zero-shift maximum (1.439708ms)\n✔ L8 exhaustively checks the handed finite domain, including degeneracies and symmetry (3.24325ms)\n✔ L8 refuses invalid domains and information interpretations by name (0.339875ms)\n✔ L9: one mix tie hides two named forks; uniform mean loss is half a bit (2.196416ms)\n✔ L9: missing prior stays unmeasured, invalid declared priors refuse by name (0.46075ms)\n✔ L9: support and prior affect loss; zero mass does not imply global injectivity (0.24325ms)\n✔ L9: constant winners may lose information and weight rescaling adds none (0.133958ms)\n✔ L9: named value tie and bottom tie remain distinct; aliases cannot inflate configuration entropy (0.169666ms)\n✔ L9: explicit logarithm policy and configuration ceiling are retained (0.076917ms)\nℹ tests 14\nℹ suites 0\nℹ pass 14\nℹ fail 0\nℹ cancelled 0\nℹ skipped 0\nℹ todo 0\nℹ duration_ms 182.334708\n",
29
32
  "stderr": ""
30
33
  },
31
34
  "exports": {
@@ -35,8 +38,9 @@
35
38
  },
36
39
  "check": {
37
40
  "status": 0,
38
- "stdout": "PASS closed \u00b7 1 places \u00b7 743 ms\n",
39
- "stderr": "RECEIPTS 13 read \u00b7 0 opened \u00b7 reading closures\nRECEIPTS 1 read \u00b7 0 opened \u00b7 743 ms\nCOST act 1 s\n"
41
+ "stdout": "PASS closed · 1 places · 642 ms\n",
42
+ "stderr": "RECEIPTS 16 read · 0 opened · reading closures\nRECEIPTS 1 read · 0 opened · 642 ms\nCOST act 1 s\n",
43
+ "archiveSha256": "sha256:d0b0c996db09d07b6ea192daf05b89a04519c784341b9b478d59b84b35d939c8"
40
44
  }
41
45
  }
42
46
  ]