rows { options { physical_type: PHYSICAL_STREAM_TYPE_QUADS max_name_table_size: 128 max_prefix_table_size: 16 max_datatype_table_size: 16 logical_type: LOGICAL_STREAM_TYPE_DATASETS version: 2 } } rows { prefix { value: "https://w3id.org/np/" } } rows { name { value: "RAotOpvYzua1F1M_yctVtM0FonayFwO5dz0ujcYT818nQ" } } rows { namespace { name: "this" value { prefix_id: 1 } } } rows { prefix { value: "https://w3id.org/np/RAotOpvYzua1F1M_yctVtM0FonayFwO5dz0ujcYT818nQ/" } } rows { name { } } rows { namespace { name: "sub" value { prefix_id: 2 } } } rows { prefix { value: "http://www.nanopub.org/nschema#" } } rows { namespace { name: "np" value { prefix_id: 3 name_id: 2 } } } rows { prefix { value: "http://www.w3.org/1999/02/22-rdf-syntax-ns#" } } rows { namespace { name: "rdf" value { prefix_id: 4 name_id: 2 } } } rows { prefix { value: "http://www.w3.org/ns/prov#" } } rows { namespace { name: "prov" value { prefix_id: 5 name_id: 2 } } } rows { prefix { value: "http://purl.org/nanopub/x/" } } rows { namespace { name: "npx" value { prefix_id: 6 name_id: 2 } } } rows { prefix { value: "http://purl.org/dc/terms/" } } rows { namespace { name: "dc" value { prefix_id: 7 name_id: 2 } } } rows { prefix { value: "http://www.w3.org/2001/XMLSchema#" } } rows { namespace { name: "xsd" value { prefix_id: 8 name_id: 2 } } } rows { name { value: "hasAssertion" } } rows { name { value: "assertion" } } rows { name { value: "Head" } } rows { quad { s_iri { prefix_id: 1 name_id: 1 } p_iri { prefix_id: 3 name_id: 3 } o_iri { prefix_id: 2 } g_iri { } } } rows { name { value: "hasProvenance" } } rows { name { value: "provenance" } } rows { quad { p_iri { prefix_id: 3 } o_iri { prefix_id: 2 } } } rows { name { value: "hasPublicationInfo" } } rows { name { value: "pubinfo" } } rows { quad { p_iri { prefix_id: 3 } o_iri { prefix_id: 2 } } } rows { name { value: "type" } } rows { name { value: "Nanopublication" } } rows { quad { p_iri { prefix_id: 4 } o_iri { prefix_id: 3 } } } rows { prefix { value: "https://w3id.org/delphi/resource/assessment/" } } rows { name { value: "wolfram2002-ch04-09--claim-test" } } rows { name { value: "description" } } rows { quad { s_iri { prefix_id: 9 } p_iri { prefix_id: 7 } o_literal { lex: "analysis.py sieves the integers through 400000, takes the first 16384 gaps from the prime 3, and computes the Shannon entropy of overlapping 8-bit blocks of (gap/2) mod 2. The same entropy is computed for a constant sequence of ones and for an alternating sequence. Every number in measured is written to derived/measured.json by that script." } g_iri { prefix_id: 2 name_id: 4 } } } rows { prefix { value: "https://w3id.org/delphi/ontology/" } } rows { name { value: "Assessment" } } rows { quad { p_iri { prefix_id: 4 name_id: 10 } o_iri { prefix_id: 10 name_id: 14 } } } rows { prefix { value: "http://www.w3.org/2000/01/rdf-schema#" } } rows { name { value: "comment" } } rows { quad { p_iri { prefix_id: 11 } o_literal { lex: "Measured: 7.788983 bits of overlapping 8-bit block entropy of half-gap parity (n = 16384, plugin estimator on 16377 overlapping windows; no sampling interval). Interpretation: Wolfram\'s remark that the primes obtained from the sieve look remarkably random is read as a statement about the gap sequence, not about the primes being odd (that parity is constant after 2). The raw gap parity after 2 is identically even, so it cannot witness randomness; the parity of the half-gap is the pre-registered randomness statistic. The repetitive controls are synthetic gap parities (all half-gaps odd; half-gaps alternating in parity), not other number sequences. \'Remarkably random\' is operationalized only as high block entropy relative to those controls." } } } rows { name { value: "label" } } rows { quad { p_iri { } o_literal { lex: "Claim test of wolfram2002-ch04-09: supports, confidence 0.74" } } } rows { name { value: "seeAlso" } } rows { prefix { value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/wolfram-nks/wolfram2002-ch04-09/" } } rows { name { value: "result.json" } } rows { quad { p_iri { } o_iri { prefix_id: 12 } } } rows { name { value: "wasAttributedTo" } } rows { prefix { value: "https://w3id.org/delphi/resource/agent/" } } rows { name { value: "delphisci-claim-tester-grok-4-7" } } rows { quad { p_iri { prefix_id: 5 } o_iri { prefix_id: 13 } } } rows { name { value: "admissibleDatasets" } } rows { quad { p_iri { prefix_id: 10 } o_literal { lex: "The bit string must be generated by the sieve of Eratosthenes at the locked limit 400000, using only gaps from the prime 3 onward. No external prime table is consulted. The computation is not evidence about organisms." } } } rows { name { value: "assessmentType" } } rows { quad { p_iri { } o_literal { lex: "claim-test/0.1.0" } } } rows { name { value: "dataKind" } } rows { quad { p_iri { } o_literal { lex: "computational" } } } rows { name { value: "disconfirmingObservation" } } rows { quad { p_iri { } o_literal { lex: "The same entropy is below 5.0 bits even though the two repetitive controls sit at or below 1.01. An entropy between 5.0 and 7.2 is mixed, not a confirmation." } } } rows { name { value: "evidenceAgainst" } } rows { quad { p_iri { } o_literal { lex: "A match shows only that this computation behaves as claimed for this statistic. It says nothing about organisms." } } } rows { quad { o_literal { lex: "Every gap in the sample is even (odd_gaps_in_sample = 0). Raw gap parity is therefore a constant and was not used as the randomness statistic." } } } rows { quad { o_literal { lex: "Finite check: 16384 gaps, the largest prime used being 180533, from a sieve limited to 400000. A different bound or a different statistic can disagree." } } } rows { quad { o_literal { lex: "The ones-frequency of the half-gap parity is 0.586365 (9607 of 16384), so the sequence is biased away from a fair coin. The pre-registered statistic was block entropy, which still cleared 7.2 (measured 7.788983, all 256 blocks seen). Unbiasedness was not the pass criterion." } } } rows { name { value: "expectedObservation" } } rows { quad { p_iri { } o_literal { lex: "Overlapping 8-bit block entropy of the first 16384 half-gap parities from the prime 3 is at least 7.2 bits, while a constant control is 0 and an alternating control is at most 1.01." } } } rows { name { value: "failCriterion" } } rows { quad { p_iri { } o_literal { lex: "Pre-registered. If both controls pass and H8 < 5.0, the verdict is refutes: the half-gap parity sequence is not remarkably random on this statistic. If both controls pass and 5.0 <= H8 < 7.2, the verdict is mixed. A match is only about this finite sieve and this statistic. It does not say that the primes are random in every respect, and it says nothing about organisms." } } } rows { name { value: "hasConfidence" } } rows { datatype { value: "http://www.w3.org/2001/XMLSchema#double" } } rows { quad { p_iri { } o_literal { lex: "0.74" datatype: 1 } } } rows { name { value: "hasEvidence" } } rows { prefix { value: "https://w3id.org/delphi/resource/evidence/" } } rows { name { value: "wolfram2002-ch04-09--claim-test--dataset-1" } } rows { quad { p_iri { } o_iri { prefix_id: 14 } } } rows { name { value: "hasVerdict" } } rows { quad { p_iri { prefix_id: 10 } o_literal { lex: "supports" } } } rows { name { value: "hypothesis" } } rows { quad { p_iri { } o_literal { lex: "The parity of successive half-gaps of the primes (gap/2 mod 2, gaps from the prime 3 onward) has overlapping 8-bit block entropy close to the 8-bit maximum, while a constant half-gap sequence and an alternating half-gap sequence stay at or below 1 bit." } } } rows { name { value: "inferenceMethod" } } rows { quad { p_iri { } o_literal { lex: "Shannon entropy of overlapping 8-bit blocks, compared with the two locked thresholds and with the two locked repetitive controls. The frequency of ones is reported and does not decide the verdict." } } } rows { name { value: "passCriterion" } } rows { quad { p_iri { } o_literal { lex: "Pre-registered. Sieve of Eratosthenes on the integers 0..400000. Take the first 16384 gaps whose left endpoint is a prime >= 3 (so every gap is even). Let b_i = ((p_{i+1}-p_i)/2) mod 2. Let H8 be the Shannon entropy, in bits, of the overlapping length-8 blocks of b. Supports if H8 >= 7.2 and both controls pass: the constant sequence of 16384 ones has H8 = 0, and the alternating sequence 1,0,1,0,... has H8 <= 1.01. If fewer than 16384 such gaps exist below 400000, or a control misses its bound, the verdict is inconclusive." } } } rows { name { value: "preregistered" } } rows { datatype { value: "http://www.w3.org/2001/XMLSchema#boolean" } } rows { quad { p_iri { } o_literal { lex: "false" datatype: 2 } } } rows { prefix { value: "https://w3id.org/delphi/resource/claim/" } } rows { name { value: "wolfram2002-ch04-09" } } rows { name { value: "hasAssessment" } } rows { quad { s_iri { prefix_id: 15 } p_iri { prefix_id: 10 } o_iri { prefix_id: 9 name_id: 12 } } } rows { quad { s_iri { prefix_id: 14 name_id: 30 } p_iri { prefix_id: 7 name_id: 13 } o_literal { lex: "the prime gaps whose half-gap parity is the randomness statistic" } } } rows { name { value: "license" } } rows { quad { p_iri { name_id: 38 } o_literal { lex: "generated data" } } } rows { name { value: "EvidenceItem" } } rows { quad { p_iri { prefix_id: 4 name_id: 10 } o_iri { prefix_id: 10 name_id: 39 } } } rows { quad { p_iri { prefix_id: 11 name_id: 16 } o_literal { lex: "Dataset: Primes generated by the sieve of Eratosthenes up to 400000" } } } rows { name { value: "SoftwareAgent" } } rows { quad { s_iri { prefix_id: 13 name_id: 20 } p_iri { prefix_id: 4 name_id: 10 } o_iri { prefix_id: 5 name_id: 40 } g_iri { prefix_id: 2 name_id: 7 } } } rows { quad { p_iri { prefix_id: 11 name_id: 16 } o_literal { lex: "delphisci claim tester (Grok 4.7; cursor/wolfram-claim-tests-b-355b)" } } } rows { name { value: "actedOnBehalfOf" } } rows { prefix { value: "https://orcid.org/" } } rows { name { value: "0009-0007-4948-9192" } } rows { quad { p_iri { prefix_id: 5 name_id: 41 } o_iri { prefix_id: 16 } } } rows { name { value: "usesModel" } } rows { prefix { id: 6 value: "https://w3id.org/delphi/resource/model/" } } rows { name { value: "grok-4-7" } } rows { quad { p_iri { prefix_id: 10 } o_iri { prefix_id: 6 } } } rows { name { value: "identifier" } } rows { quad { s_iri { name_id: 44 } p_iri { prefix_id: 7 } o_literal { lex: "Grok 4.7" } } } rows { name { value: "LanguageModel" } } rows { quad { p_iri { prefix_id: 4 name_id: 10 } o_iri { prefix_id: 10 name_id: 46 } } } rows { quad { s_iri { prefix_id: 2 name_id: 4 } p_iri { prefix_id: 5 name_id: 19 } o_iri { prefix_id: 13 } } } rows { name { value: "wasDerivedFrom" } } rows { quad { p_iri { prefix_id: 5 name_id: 47 } o_iri { prefix_id: 12 name_id: 18 } } } rows { name { value: "wasGeneratedBy" } } rows { name { value: "test" } } rows { quad { p_iri { prefix_id: 5 name_id: 48 } o_iri { prefix_id: 2 } } } rows { name { value: "plan" } } rows { name { value: "hadPlan" } } rows { prefix { id: 8 value: "https://github.com/fractastical/delphisci/blob/bf2af6ee0a84e23ffa6414ad7a0a50a8c276506e/test-data/claim-tests/" } } rows { name { value: "README.md" } } rows { quad { s_iri { } p_iri { prefix_id: 5 } o_iri { prefix_id: 8 } } } rows { name { value: "Activity" } } rows { quad { s_iri { prefix_id: 2 name_id: 49 } p_iri { prefix_id: 4 name_id: 10 } o_iri { prefix_id: 5 name_id: 53 } } } rows { name { value: "qualifiedAssociation" } } rows { quad { p_iri { } o_iri { prefix_id: 2 name_id: 50 } } } rows { name { value: "wasAssociatedWith" } } rows { quad { p_iri { prefix_id: 5 name_id: 55 } o_iri { prefix_id: 13 name_id: 20 } } } rows { name { value: "created" } } rows { datatype { value: "http://www.w3.org/2001/XMLSchema#dateTime" } } rows { quad { s_iri { prefix_id: 1 name_id: 1 } p_iri { prefix_id: 7 name_id: 56 } o_literal { lex: "2026-11-08T16:24:31.923Z" datatype: 3 } g_iri { prefix_id: 2 name_id: 9 } } } rows { name { value: "creator" } } rows { quad { p_iri { prefix_id: 7 name_id: 57 } o_iri { prefix_id: 16 name_id: 42 } } } rows { prefix { id: 3 value: "https://creativecommons.org/licenses/by/4.0/" } } rows { quad { p_iri { prefix_id: 7 name_id: 38 } o_iri { prefix_id: 3 name_id: 2 } } } rows { prefix { id: 15 value: "http://purl.org/nanopub/x/" } } rows { name { value: "hasNanopubType" } } rows { quad { p_iri { prefix_id: 15 name_id: 58 } o_iri { prefix_id: 10 name_id: 14 } } } rows { name { value: "introduces" } } rows { quad { p_iri { prefix_id: 15 name_id: 59 } o_iri { prefix_id: 9 name_id: 12 } } } rows { quad { p_iri { prefix_id: 11 name_id: 16 } o_literal { lex: "Claim test of wolfram2002-ch04-09: supports, confidence 0.74" } } } rows { name { value: "domain" } } rows { prefix { id: 14 value: "https://w3id.org/delphi/resource/domain/" } } rows { name { value: "wolfram-nks-2002" } } rows { quad { p_iri { prefix_id: 10 name_id: 60 } o_iri { prefix_id: 14 } } } rows { name { value: "sig" } } rows { name { value: "hasAlgorithm" } } rows { quad { s_iri { prefix_id: 2 } p_iri { prefix_id: 15 } o_literal { lex: "RSA" } } } rows { name { value: "hasPublicKey" } } rows { quad { p_iri { } o_literal { lex: "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAyFHtPB6p0mCjDozxlOY9CmO3nBm7Te3jFbXyLmM+G1tGe47Da0jYIbhkl9Oo1ZjxmCa3LCwlEqK8gj6hEIcL4ahW30JXh9HycfKVk1bugkzMEV15tJdTzAU3sGMFnbNsn43xY2LFLy45tApkRm5byEiM7oRRrooIdwoQKnP4Wzq/bfAoJ9qvW+MGkelyOTd1jbSt+KfmT7xKmDfWzAHddUlWwMX2QJOLxDaffOteTop6ZRgPiNmPJKA/S62Gac9XtSYT3oDkZ6/nr5cxxNLpOyxTf5FPISiCe11xYO/unYjY+mwnOfA8yhJIyx1l0O9I0vpOpn+E5TvyHJV+oSTrvwIDAQAB" } } } rows { name { value: "hasSignature" } } rows { quad { p_iri { } o_literal { lex: "NY1cvqapxZyXg+p/mTDg5HxwoTkkc8tszTX8dirlFJgMHVAQMQjF9dnGRFFXglSWjgQuswy4ZC41WUadoCzwpRnKnV56wPV4lfTzr/EKA4asmyPddngWMxbuI9fsorRFVenUsPLm/9DmYuVHBocU/eASVocduxbMrSXifC1pPHYZ9jiSfbZ2TrU/4Rh7HiAW7AE2QJCnBMxlP7ckWlgFqMkwPr28YscYL3rkuzR1uSbz+8uArYre3ZYtm/h1BDw+8r0+Y8whT8PDq/R5wqQ+pFoq+XFrM/lMr+iRwfMFqZwq0m5Gm4NCJq2YhRN81e5Pbc1AoHgyRPJw7+TNBvOkUA==" } } } rows { name { value: "hasSignatureTarget" } } rows { quad { p_iri { } o_iri { prefix_id: 1 name_id: 1 } } } rows { name { value: "signedBy" } } rows { quad { p_iri { prefix_id: 15 name_id: 67 } o_iri { prefix_id: 16 name_id: 42 } } }