https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/Head https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/assertion https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/provenance https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/pubinfo https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/assertion https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test http://purl.org/dc/terms/description analysis.py builds 3^n for n = 64..255 with integer powers, reads the locked bit columns, and computes the Shannon entropy of non-overlapping 4-bit blocks. The same function is applied to a checkerboard of length 12288 and to 12288 bits from random.Random(20261102). Thresholds in the script are the pre-registered ones. The run writes derived/measured.json. A second run matched that file byte for byte. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/Assessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test http://www.w3.org/2000/01/rdf-schema#comment Measured: 0.9983424040186749 normalized 4-bit block entropy h4 of bits j=32..95 of 3^n for n=64..255 (n = 3072, plugin Shannon entropy on this finite window; no sampling of the powers). Interpretation: Wolfram's pattern is the base-2 digits of 3^n stacked by n. 'Small-scale structure' is read as the lowest 4 bits, which repeat because the multiplicative order of 3 modulo 16 is 4; that fact fixes the column window and is not a measurement of the bulk. 'Appears random for all practical purposes' on a larger scale is read as normalized 4-bit block entropy of interior bits j = 32..95, compared with a random bit string of equal length rather than with a proof of normality. The repetitive control is a checkerboard, not another arithmetic sequence. The computation shows only how these finite digit strings behave. It says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-03: supports, confidence 0.78 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test http://www.w3.org/2000/01/rdf-schema#seeAlso https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-03/result.json https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/admissibleDatasets The dataset is the deterministic sequence 3^n written in base 2, generated by the checksummed script, for the locked range n = 64..255 and the locked columns. A same-length checkerboard and a same-length seeded pseudorandom string are the controls. No organism data are admissible for this computational claim. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/assessmentType claim-test/0.1.0 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/dataKind computational https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/disconfirmingObservation With the checkerboard still at block entropy at most 0.25, the interior digits have block entropy at least 0.20 below the random reference. If the checkerboard itself exceeds 0.25, the statistic is not discriminating and the test is inconclusive. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst Small-scale structure is demonstrated only for the lowest 4 bits. Columns between bit 4 and bit 31 were not part of the pass rule. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The check is finite: n stops at 255 and the blocks are 4 bits. A longer run, or blocks long enough to see multiplication by 3, could show structure that this statistic treats as random. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The random reference is a seeded Python generator of the same length, not a cryptographic source, and h4 near 1 is a local frequency statement, not a proof that the digits are normal. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/evidenceAgainst The result is a computational observation about these powers. It says nothing about organisms. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/expectedObservation Interior base-2 digits of 3^n for n = 64..255 have 4-bit block entropy within 0.05 of a seeded random string of the same length, the lowest 4 bits have block entropy at least 0.15 lower than that interior, and a checkerboard control has block entropy at most 0.25. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/failCriterion Pre-registered. Refutes if h4(checkerboard) <= 0.25 and h4(bulk) <= h4(random) - 0.20 (the control is repetitive and the bulk is clearly less random than the reference). Inconclusive if h4(checkerboard) > 0.25 (the repetitive control was not repetitive under this statistic). Mixed in every other case. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/hasConfidence 0.78 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-1 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-2 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/hasEvidence https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-3 https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/hasVerdict supports https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/hypothesis The base-2 digits of successive powers of 3, away from the least significant bits, have 4-bit block entropy close to a same-length random reference, while the lowest 4 bits are substantially less random, and a checkerboard of the same length is far less random than either. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/inferenceMethod Normalized Shannon entropy of non-overlapping 4-bit blocks. Supports only when the bulk is within 0.05 of the random reference, the small-scale window is at least 0.15 below the bulk, and the checkerboard is at most 0.25. Refutes when the control works and the bulk is at least 0.20 below the reference. Otherwise mixed, or inconclusive if the control fails. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/passCriterion Pre-registered, all three required. Rows n = 64 through 255 (192 powers). Bit 0 is the least significant bit. Small-scale stream: bits j = 0,1,2,3 of each power, concatenated in that order (192 blocks of 4 bits). Bulk stream: bits j = 32 through 95 of each power, concatenated (12288 bits, 3072 blocks). Statistic h4 is the Shannon entropy, in bits, of non-overlapping 4-bit blocks, divided by 4. Repetitive control: the checkerboard bit k = k mod 2 of length 12288. Random reference: 12288 bits from random.Random(20261102).randrange(2), in order. Supports if and only if h4(checkerboard) <= 0.25 and h4(bulk) >= h4(random) - 0.05 and h4(small) <= h4(bulk) - 0.15. https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/ontology/preregistered false https://w3id.org/delphi/resource/claim/wolfram2002-ch04-03 https://w3id.org/delphi/ontology/hasAssessment https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-1 http://purl.org/dc/terms/description the digit pattern whose block entropy is the test https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-1 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-1 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-1 http://www.w3.org/2000/01/rdf-schema#label Dataset: Base-2 digits of 3^n for n = 64..255, generated by analysis.py https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-1 https://w3id.org/delphi/ontology/hasChecksum sha256:d2f4532ce035eb067b595d01d1fc885d73ae950e82e906077cc15157cc6b4396 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-2 http://purl.org/dc/terms/description repetitive control https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-2 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-2 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-2 http://www.w3.org/2000/01/rdf-schema#label Dataset: Checkerboard bit string of length 12288 https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-3 http://purl.org/dc/terms/description randomness reference for the same statistic and the same length https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-3 http://purl.org/dc/terms/license https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-3 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/EvidenceItem https://w3id.org/delphi/resource/evidence/wolfram2002-ch04-03--claim-test--dataset-3 http://www.w3.org/2000/01/rdf-schema#label Dataset: Seeded pseudorandom bit string of length 12288 https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/provenance https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#SoftwareAgent https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/2000/01/rdf-schema#label delphisci claim tester (Grok 4.7; cursor/claim-tests-wolfram-programs-b8d9) https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 http://www.w3.org/ns/prov#actedOnBehalfOf https://orcid.org/0009-0007-4948-9192 https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/delphi/ontology/usesModel https://w3id.org/delphi/resource/model/grok-4-7 https://w3id.org/delphi/resource/model/grok-4-7 http://purl.org/dc/terms/identifier Grok 4.7 https://w3id.org/delphi/resource/model/grok-4-7 http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/delphi/ontology/LanguageModel https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/assertion http://www.w3.org/ns/prov#wasAttributedTo https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/assertion http://www.w3.org/ns/prov#wasDerivedFrom https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-03/result.json https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/assertion http://www.w3.org/ns/prov#wasGeneratedBy https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/test https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/plan http://www.w3.org/ns/prov#hadPlan https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/README.md https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/test http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.w3.org/ns/prov#Activity https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/test http://www.w3.org/ns/prov#qualifiedAssociation https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/plan https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/test http://www.w3.org/ns/prov#wasAssociatedWith https://w3id.org/delphi/resource/agent/delphisci-claim-tester-grok-4-7 https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/pubinfo https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://purl.org/dc/terms/created 2026-11-08T16:24:31.921Z https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://purl.org/dc/terms/creator https://orcid.org/0009-0007-4948-9192 https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://purl.org/nanopub/x/hasNanopubType https://w3id.org/delphi/ontology/Assessment https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://purl.org/nanopub/x/introduces https://w3id.org/delphi/resource/assessment/wolfram2002-ch04-03--claim-test https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM http://www.w3.org/2000/01/rdf-schema#label Claim test of wolfram2002-ch04-03: supports, confidence 0.78 https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM https://w3id.org/delphi/ontology/domain https://w3id.org/delphi/resource/domain/wolfram-nks-2002 https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/sig http://purl.org/nanopub/x/hasPublicKey MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/sig http://purl.org/nanopub/x/hasSignature GXpWta4fW/ldXX0lhJhWoADdlZbilbrsJv2Ub7sJjPmvzitzCHCCAIrvKJ9+nTgstXS5qYrYnfQXk2DUP2OXy4WDtkZ8MT969CADjS2971yRRFBGkRsH4JT0Of9bVxHWksbMBwrqRSIC3JAXuiXWfTPkg9Apqhv2vOWBvSxB3ncfvNaksKL3qxn2vqjuPvSsoPrbFPraaH+90xZGgoZm/AysGRArO8g6rcPjP5rj3EmcQSKAsmyxCJgTIMClVKBpjBHX+s7ix5VmZ5upJTlKi12oHdwjSTeNMXfniB7rkB5iyCDJF/Q/2cTSrOO4epdeQf/cxM/KxI0coEKsWn6bWA== https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM https://w3id.org/np/RAYr60EOMEZbtaFQIG1K2xVyrvJ6J4HbVQjUaHa6dnUuM/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0009-0007-4948-9192