https://w3id.org/np/RAcJTP1AFP4aqp6GSqj-lgUhCGgLTnf-CqQYzH1D3lSKw
.trig | .trig.txt | .jelly | .jelly.txt | .jsonld | .jsonld.txt | .nq | .nq.txt | .xml | .xml.txt
@prefix this: <https://w3id.org/np/RAcJTP1AFP4aqp6GSqj-lgUhCGgLTnf-CqQYzH1D3lSKw> .
@prefix sub: <https://w3id.org/np/RAcJTP1AFP4aqp6GSqj-lgUhCGgLTnf-CqQYzH1D3lSKw/> .
@prefix np: <http://www.nanopub.org/nschema#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix prov: <http://www.w3.org/ns/prov#> .
@prefix npx: <http://purl.org/nanopub/x/> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
sub:Head {
this: a np:Nanopublication;
np:hasAssertion sub:assertion;
np:hasProvenance sub:provenance;
np:hasPublicationInfo sub:pubinfo .
}
sub:assertion {
<https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-04--claim-test> a <https://w3id.org/delphi/ontology/Assessment>;
dc:description "analysis.py computes 3^n exactly, takes the leading bit of (3^n mod 2^n)/2^n for n = 1..4096, and the leading 4096 bits of 3^4096, and computes overlapping 8-bit block entropies. The control is the 4096-bit binary representation of 2^4095. Numbers are copied from derived/measured.json.";
<http://www.w3.org/2000/01/rdf-schema#comment> "Measured: 7.957383 bits of overlapping 8-bit block entropy of the leading fractional-part bits (n = 4096, plugin estimator on 4089 overlapping windows). Interpretation: The fractional part is the base-independent size Wolfram contrasts with digits. It is computed exactly as (3^n mod 2^n)/2^n, and its complexity is the block entropy of its leading binary digit, the same statistic applied to the leading bits of 3^4096. The power-of-two control is a digit sequence that is simple on purpose, so the statistic has to be able to say 'not complex'.";
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch04-04: supports, confidence 0.8";
<http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-04/result.json>;
prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7>;
<https://w3id.org/delphi/ontology/admissibleDatasets> "Exact integer powers only, n through 4096, no floating point. The power-of-two string is the negative control. This is not a statement about organisms.";
<https://w3id.org/delphi/ontology/assessmentType> "claim-test/0.1.0";
<https://w3id.org/delphi/ontology/dataKind> "computational";
<https://w3id.org/delphi/ontology/disconfirmingObservation> "H8 of the fractional-part bits is below 5.0 while H8 of the digits of 3^4096 is at least 7.0. A gap larger than 0.6, or either sequence between 5.0 and 7.0, is mixed.";
<https://w3id.org/delphi/ontology/evidenceAgainst> "A match shows only that this computation behaves as claimed. It says nothing about organisms.",
"Block entropy near 8 bits is incompressibility of 8-bit blocks, not a proof that {(3/2)^n} is equidistributed.",
"Finite check: 4096 powers, and only the leading binary digit of each fractional part. The full fractional part could be structured in the lower bits without moving this statistic.",
"The digit comparison is the leading 4096 bits of the single integer 3^4096 (bit length 6493), not a concatenation of every power's digits.";
<https://w3id.org/delphi/ontology/expectedObservation> "H8 of the 4096 leading fractional-part bits and H8 of the leading 4096 bits of 3^4096 are both at least 7.0 and differ by at most 0.6, while H8 of the bits of 2^4095 is at most 1.5.";
<https://w3id.org/delphi/ontology/failCriterion> "Pre-registered. If the control passes and H8(b) < 5.0 while H8(d) >= 7.0, the verdict is refutes: the fractional-part bits are not as complex as the digit sequence on this statistic. Every other case in which the control passes is mixed. The check is finite (4096 terms, one bit per term) and says nothing about organisms.";
<https://w3id.org/delphi/ontology/hasConfidence> "0.8"^^xsd:double;
<https://w3id.org/delphi/ontology/hasEvidence> <https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-04--claim-test--dataset-1>;
<https://w3id.org/delphi/ontology/hasVerdict> "supports";
<https://w3id.org/delphi/ontology/hypothesis> "The leading binary digits of the fractional parts {(3/2)^n} for n = 1..4096 have overlapping 8-bit block entropy within 0.6 bits of the leading 4096 binary digits of 3^4096, and both entropies are at least 7.0, while the 4096-bit encoding of a power of two stays at or below 1.5.";
<https://w3id.org/delphi/ontology/inferenceMethod> "Shannon entropy of overlapping 8-bit blocks, with the three locked thresholds. The ones-frequency is reported and does not decide the verdict.";
<https://w3id.org/delphi/ontology/passCriterion> "Pre-registered. Let b_n = 1 if 3^n mod 2^n >= 2^(n-1), else 0, for n = 1..4096. This is the leading binary digit of the exact fractional part {(3/2)^n} = (3^n mod 2^n)/2^n. Let d be the leading 4096 bits of 3^4096. Let c be the 4096-bit binary representation of 2^4095. Let H8 be the Shannon entropy of overlapping length-8 blocks. Supports if H8(b) >= 7.0, H8(d) >= 7.0, |H8(b)-H8(d)| <= 0.6, and H8(c) <= 1.5. If H8(c) > 1.5 or 3^4096 has fewer than 4096 bits, the verdict is inconclusive.";
<https://w3id.org/delphi/ontology/preregistered> "false"^^xsd:boolean .
<https://w3id.org/delphi/resource/claim/wolfram2002-ch04-04> <https://w3id.org/delphi/ontology/hasAssessment>
<https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-04--claim-test> .
<https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-04--claim-test--dataset-1>
a <https://w3id.org/delphi/ontology/EvidenceItem>;
dc:description "the fractional-part bits and the digit string they are compared with";
dc:license "generated data";
<http://www.w3.org/2000/01/rdf-schema#label> "Dataset: Exact fractional parts of (3/2)^n and the binary digits of 3^4096" .
}
sub:provenance {
<https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7> a prov:SoftwareAgent;
<http://www.w3.org/2000/01/rdf-schema#label> "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-b-355b)";
prov:actedOnBehalfOf <https://orcid.org/0009-0007-4948-9192>;
<https://w3id.org/delphi/ontology/usesModel> <https://w3id.org/delphi/resource/model/grok-4-7> .
<https://w3id.org/delphi/resource/model/grok-4-7> a <https://w3id.org/delphi/ontology/LanguageModel>;
dc:identifier "Grok 4.7" .
sub:assertion prov:wasAttributedTo <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7>;
prov:wasDerivedFrom <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-04/result.json>;
prov:wasGeneratedBy sub:test .
sub:plan prov:hadPlan <https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md> .
sub:test a prov:Activity;
prov:qualifiedAssociation sub:plan;
prov:wasAssociatedWith <https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7> .
}
sub:pubinfo {
this: dc:created "2026-11-08T16:24:31.921Z"^^xsd:dateTime;
dc:creator <https://orcid.org/0009-0007-4948-9192>;
dc:license <https://creativecommons.org/licenses/by/4.0/>;
npx:hasNanopubType <https://w3id.org/delphi/ontology/Assessment>;
npx:introduces <https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-04--claim-test>;
<http://www.w3.org/2000/01/rdf-schema#label> "Claim test of wolfram2002-ch04-04: supports, confidence 0.8";
<https://w3id.org/delphi/ontology/domain> <https://w3id.org/delphi/resource/domain/wolfram-nks-2002> .
sub:sig npx:hasAlgorithm "RSA";
npx:hasPublicKey "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB";
npx:hasSignature "T3DQESojMKzx2jTBOdRqeowt/1iwY+qTSGnhRNSawWu+ERU5WnU19/Ezj0rnEogta67sRwdGosp8HdjokhJMsIbri8rpMZ6CejffVtFuxcJyure6UyigvXG321Z8HokB2yY/TiEJFKsV7BG5/xXmJgrhWzNn2tCym5bRI+KvuFQwvMiCbddRxt+HnPE7rXyBo8HIXLhYuaobvm5l9aDfWhi9PiBxJz6Tax3LQNzQnGNYWicyjb7MQYF0zRfwqog9MauT1o7JwEzzVjaYQPT5Fnp1XRf1AnJ2O79rxbW53LezTOULjnvGLLQ41+vShrgdzss458euQTp4G76CSbVrvw==";
npx:hasSignatureTarget this:;
npx:signedBy <https://orcid.org/0009-0007-4948-9192> .
}