{ "vercy": "1.0-draft", "publication": { "status": "research-draft", "adjudicationStatus": "unreviewed", "publishableCanonical": false, "generatedAt": "2026-09-12T09:51:09Z", "providers": [ "Codex" ], "breadth": "recalled by Codex without web access - no source was read", "missingProviders": [], "pass": 2, "cost": { "grok": { "seconds": 14.2, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a09506-1aef-7fe0-84cd-3ecf0cb2ee1b\n--------\nuser\nDescribe what is already known about one registered thing. Answer as JSON only, no prose around it.\n\nThing: fortunate number\nSense to describe: (none recorded)\nDomain code: XCT.QTY\nAlso known as: (none)\n\n\nContext for this batch of 1001 things:\n# Batch 043: 100", "usd": 0.0, "recall": true }, "codex": { "seconds": 69.9, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a09506-1adf-7aa0-b16b-6dd4e2eac9cc\n--------\nuser\nYou are drafting a Vercy meta-model for one registered thing. Answer as JSON only, no prose around it.\n\nThing: fortunate number\nRegistry id: vr.tr.fortunate-number\nPlane / domain: XCT / XCT.QTY\nRegistry definition: (none recorded)\nNames folded into this entry:" } }, "enrichment": { "pass": 3, "engine": "claude", "producedAt": "2026-10-06T11:00:00Z", "ingestedAt": "2026-10-06T08:15:58+00:00", "fields": [ "agent_conduct", "ethics", "failure_modes_and_hazards", "owners" ] }, "gate": { "passed": true, "version": "1.0", "at": "2026-10-07T10:10:31+00:00", "evidence": [ "completeness 1.00", "sense: Wikidata description", "2 live sources", "review by codex: pass" ] } }, "metaModel": { "id": "THING-Q5151604", "registryId": "vr.tr.fortunate-number", "name": "fortunate number", "version": "0.1.0-research.1", "entryKind": "thing", "family": "Thing Registry", "domain": [ "XCT.QTY" ], "status": "research-draft" }, "canonicalUrl": "https://ver.cy/models/thing/q5151604/", "model": { "registry_id": "vr.tr.fortunate-number", "name": "fortunate number", "purpose": "Enable an agent to recognize, compute and validate fortunate numbers while separating verified terms from conjectures about their arithmetic properties.", "definition": "For a positive integer n, the nth Fortunate number is the least integer m greater than 1 such that the product of the first n prime numbers plus m is prime.", "scope_statement": "This model owns the fortunate-number concept registered as vr.tr.fortunate-number in XCT / XCT.QTY: for n ≥ 1, F(n) is the least integer m > 1 such that P_n + m is prime, where P_n is the product of the first n primes; it covers indexed occurrences, distinct values and evidence establishing their validity. Definition reference: [OEIS A005235](https://oeis.org/A005235).", "in_scope": [ "The defining relationship between a prime index, its primorial and the least qualifying additive offset", "Indexed fortunate-number occurrences and their distinct integer values", "Exact computation and verification of the resulting prime", "Evidence excluding every smaller admissible offset", "The distinction between established membership and claims about the offset's own primality" ], "out_of_scope": [ "General theories and implementations of primality testing", "Primorials as independently modeled integer products", "Lesser fortunate numbers, which use subtraction from a primorial", "Lucky numbers generated by a sieve", "Primorial primes defined by offsets of plus or minus one", "Physical quantities, measurement units and interpretations of personal good fortune" ], "distinguishing_features": [ "Its reference integer is the product of the first n primes, not n factorial or an arbitrary product of primes.", "Its value is an additive offset m, not the resulting prime P_n + m.", "The offset must exceed one; a prime at P_n + 1 does not qualify.", "The offset must be minimal: primality of P_n + m alone does not establish membership at index n.", "Primality of the offset itself is not a defining requirement and must be evaluated separately." ], "characteristics": [ { "name": "Prime index", "kind": "measurement", "unit_or_values": "Exact dimensionless integer n ≥ 1", "why_it_matters": "Identifies the sequence occurrence and fixes which primes enter the primorial." }, { "name": "Reference primorial", "kind": "relation", "unit_or_values": "P_n = product of the first n primes", "why_it_matters": "Provides the exact reference integer against which candidate offsets are evaluated." }, { "name": "Fortunate offset", "kind": "measurement", "unit_or_values": "Exact dimensionless integer m > 1", "why_it_matters": "Records the proposed or verified fortunate-number value." }, { "name": "Resulting prime", "kind": "relation", "unit_or_values": "q = P_n + m", "why_it_matters": "Separates the offset from the integer whose primality establishes the endpoint condition." }, { "name": "Endpoint evidence", "kind": "state", "unit_or_values": "Untested | probable prime | proven prime | composite", "why_it_matters": "Determines whether the candidate endpoint supports a certified occurrence." }, { "name": "Minimality evidence", "kind": "state", "unit_or_values": "Unchecked | partially excluded | fully excluded | smaller qualifying offset found", "why_it_matters": "Tracks whether every integer k with 1 < k < m has been ruled out." }, { "name": "Representation role", "kind": "category", "unit_or_values": "Indexed occurrence | distinct value | finite sequence segment", "why_it_matters": "Prevents deduplication or sorting from silently changing the meaning of sequence data." }, { "name": "Offset primality assessment", "kind": "state", "unit_or_values": "Unknown | probable prime | proven prime | composite", "why_it_matters": "Supports investigation of Fortune's conjecture without building that conjecture into membership." } ], "affordances": [ "Compute the least qualifying offset for a specified positive prime index using exact arithmetic.", "Validate a proposed occurrence by checking its primorial, endpoint primality and exclusion of smaller offsets.", "Reject a candidate when its endpoint is composite or a smaller qualifying offset exists.", "Aggregate certified occurrences into a sequence segment or a distinct-value collection with explicit ordering.", "Recheck imported terms against reproducible computation and source evidence.", "Assess a proposed composite fortunate number by independently verifying membership and offset compositeness." ], "agent_conduct": { "may": [ "Compute and explain Fortunate numbers, showing the primality checks.", "Report the status of the conjecture that all Fortunate numbers are prime." ], "must_not": [ "Present Fortune's conjecture as proven.", "Confuse primorials with factorials in the definition.", "Report values from unchecked primality tests as certain." ], "requires_human": [ "Publishing new results under someone else's name." ] }, "ethics": { "considerations": [ "Open conjectures must be stated honestly so learners know what is and is not known." ], "affected_parties": [ "Students", "Mathematicians" ] }, "owners": { "steward": "Nobody owns them; they are held in common as mathematics.", "master_systems": [] }, "failure_modes_and_hazards": [ "Errors from probable-prime tests treated as proofs.", "Mixing definitions with factorial-based variants." ], "what_it_is_for": [ "Fortunate numbers are studied in number theory through the relationship between primorials and nearby prime numbers.", "They are used in computational investigations that test primality, verify minimal offsets and explore conjectures about the resulting sequence." ], "facets_not_applicable": { "interfaces": "No specific technical standard, law or official classification applies to Fortunate numbers as mathematical objects.", "recognition": "A Fortunate number is an abstract mathematical object that cannot be distinguished by visual appearance." } }, "sources": [ { "id": "wikidata", "title": "Wikidata item Q5151604: fortunate number", "url": "https://www.wikidata.org/wiki/Q5151604", "url_status": "live", "what_it_supports": "identity and sense of the item", "checked_by": "wikidata-api" }, { "id": "wikipedia-en", "title": "Wikipedia: Fortunate number", "url": "https://en.wikipedia.org/wiki/Fortunate_number", "url_status": "live", "what_it_supports": "general description of the item", "checked_by": "wikidata-api sitelink" } ], "structure": { "bundles": [ { "id": "defining-offset", "name": "Defining offset", "description": "Establishes precisely which integer is being classified and the reference product that gives it meaning.", "rationale": "An off-by-one convention or confusion between the offset and endpoint changes the mathematical object.", "layers": [ { "id": "primorial-reference", "name": "Primorial reference", "description": "Fixes the positive index and the associated product of consecutive primes beginning with two.", "findings": [ { "id": "indexed-prime-product", "name": "Indexed prime product", "description": "A proposed occurrence must identify n and P_n unambiguously; prime-index notation must not be confused with a product over primes bounded by the integer n.", "questions": [ { "text": "Does n count the primes in the product, with n ≥ 1?", "kind": "definition", "id": "indexed-prime-product-q01" }, { "text": "Does the recorded P_n equal the product of exactly the first n primes?", "kind": "measurement", "id": "indexed-prime-product-q02" } ] } ] }, { "id": "admissible-offset", "name": "Admissible offset", "description": "Separates the candidate offset, its endpoint and the strict lower bound on eligibility.", "findings": [ { "id": "strict-offset-boundary", "name": "Strict offset boundary", "description": "Recognition requires m > 1 and q = P_n + m, followed by endpoint and minimality validation.", "questions": [ { "text": "Is the recorded fortunate number m rather than q or P_n?", "kind": "boundary", "id": "strict-offset-boundary-q01" }, { "text": "Does the search exclude m = 1 even when P_n + 1 is prime?", "kind": "definition", "id": "strict-offset-boundary-q02" } ] } ] } ] }, { "id": "membership-certification", "name": "Membership certification", "description": "Organizes the two independent obligations needed to certify a fortunate-number occurrence.", "rationale": "Finding a prime above a primorial supplies a candidate; certification also requires establishing the least admissible offset.", "layers": [ { "id": "endpoint-primality", "name": "Endpoint primality", "description": "Records the arithmetic and evidence supporting primality of P_n + m.", "findings": [ { "id": "verified-prime-endpoint", "name": "Verified prime endpoint", "description": "The model should retain whether endpoint evidence is a proof or a probable-prime result, together with enough information for independent checking.", "questions": [ { "text": "What method or certificate establishes that the exact integer P_n + m is prime?", "kind": "provenance", "id": "verified-prime-endpoint-q01" }, { "text": "Does the evidence justify a certified occurrence or only a provisional candidate?", "kind": "action", "id": "verified-prime-endpoint-q02" } ] } ] }, { "id": "smaller-offset-exclusion", "name": "Smaller-offset exclusion", "description": "Accounts for every admissible offset preceding the proposed value.", "findings": [ { "id": "complete-minimality-coverage", "name": "Complete minimality coverage", "description": "Certification requires showing that P_n + k is composite for every integer k with 1 < k < m, through direct checks or justified collective exclusions.", "questions": [ { "text": "Which witnesses or arguments exclude every smaller admissible offset without gaps?", "kind": "provenance", "id": "complete-minimality-coverage-q01" }, { "text": "If a smaller prime endpoint is found, which candidate and dependent records must be corrected?", "kind": "action", "id": "complete-minimality-coverage-q02" } ] } ] } ] }, { "id": "computation-and-occurrences", "name": "Computation and occurrences", "description": "Supports reproducible searches and preserves the distinction between sequence positions and integer values.", "rationale": "A search can stop before certification, and a value-based collection can lose information about the primorials that generated it.", "layers": [ { "id": "exact-offset-search", "name": "Exact offset search", "description": "Captures the search convention, arithmetic precision and completed range.", "findings": [ { "id": "reproducible-search-state", "name": "Reproducible search state", "description": "A computation should preserve the exact primorial, tested or excluded offsets, stopping point and primality procedure so it can be resumed or checked.", "questions": [ { "text": "What exact-arithmetic procedure searches offsets above one and justifies any skipped candidates?", "kind": "action", "id": "reproducible-search-state-q01" }, { "text": "Through which offset has the computation completed its exclusions, and what remains untested?", "kind": "measurement", "id": "reproducible-search-state-q02" } ] } ] }, { "id": "occurrence-value-mapping", "name": "Occurrence-to-value mapping", "description": "Maintains generating indices when terms are grouped or presented as distinct values.", "findings": [ { "id": "preserved-index-witnesses", "name": "Preserved index witnesses", "description": "A distinct-value record should retain its known generating indices; absence from a searched finite range does not establish absence from the entire sequence.", "questions": [ { "text": "Which verified indices witness that this integer is a fortunate-number value?", "kind": "provenance", "id": "preserved-index-witnesses-q01" }, { "text": "Does the collection preserve index order, sort distinct values or report only a bounded search?", "kind": "boundary", "id": "preserved-index-witnesses-q02" } ] } ] } ] }, { "id": "arithmetic-claims-and-boundaries", "name": "Arithmetic claims and boundaries", "description": "Separates claims about fortunate offsets from their definition and distinguishes nearby constructions.", "rationale": "The suggestive name and conjectured primality can otherwise cause incorrect classification or overstatement.", "layers": [ { "id": "offset-primality-claims", "name": "Offset primality claims", "description": "Handles tests and general assertions about m independently of primality of P_n + m.", "findings": [ { "id": "conjecture-evidence-separation", "name": "Conjecture and evidence separation", "description": "Fortune's conjecture asserts that fortunate numbers are prime; finite checks must remain distinct from a universal proof. Reference: [Guy's discussion hosted by OEIS](https://oeis.org/A002572/a002572_3.pdf).", "questions": [ { "text": "Is a claim about offset primality supported by an individual certificate, a bounded computation or a general proof?", "kind": "provenance", "id": "conjecture-evidence-separation-q01" }, { "text": "For a proposed counterexample, have both fortunate-number membership and compositeness of m been independently established?", "kind": "action", "id": "conjecture-evidence-separation-q02" } ] } ] }, { "id": "neighboring-number-constructions", "name": "Neighboring number constructions", "description": "Prevents similar names or altered endpoint formulas from being treated as equivalent definitions.", "findings": [ { "id": "construction-boundary-check", "name": "Construction boundary check", "description": "Subtraction defines lesser fortunate numbers, a neighboring construction with its own boundary conditions. Reference: [OEIS A055211](https://oeis.org/A055211).", "questions": [ { "text": "Does the source use addition to the primorial, subtraction from it or a different number-generating process?", "kind": "boundary", "id": "construction-boundary-check-q01" }, { "text": "Should a record involving offset one, a sieve or subtraction be linked to a neighboring model instead?", "kind": "action", "id": "construction-boundary-check-q02" } ] } ] } ] }, { "id": "evidence-and-external-alignment", "name": "Evidence and external alignment", "description": "What the world already says about this thing, gathered so the model can be checked against it.", "rationale": "A model that cannot be lined up against existing standards, identifiers and practice cannot be adopted by anyone who already uses them.", "layers": [ { "id": "reported-evidence", "name": "Reported evidence", "description": "Findings from the breadth pass, kept separate from the structural claims.", "findings": [ { "id": "evidence-confidence-notes", "name": "Check these first", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "This is a class of dimensionless integers, not a measurement unit.", "The first four terms, indexed by the number of primes in the product, are 3, 5, 7, and 13.", "The assertion that every Fortunate number is prime is known as Fortunate's conjecture; its current status should be checked before publication." ], "questions": [ { "id": "evidence-confidence-notes-q01", "text": "Which of these check these first hold for the sense of fortunate number this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-real-world-use", "name": "Real-world use", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Studied in number theory in connection with primorials, prime gaps, and Fortunate's conjecture." ], "questions": [ { "id": "evidence-real-world-use-q01", "text": "Which of these real-world use hold for the sense of fortunate number this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-failure-modes-and-hazards", "name": "Failure modes and hazards", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Allowing m = 1 changes the definition.", "Assuming the sequence increases with n is incorrect.", "Treating the conjecture that every Fortunate number is prime as a proved theorem overstates what is established." ], "questions": [ { "id": "evidence-failure-modes-and-hazards-q01", "text": "Which of these failure modes and hazards hold for the sense of fortunate number this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-neighbours", "name": "Neighbouring kinds and how to tell them apart", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ { "name": "primorial", "difference": "A primorial is a product of consecutive primes starting with 2; a Fortunate number is the least qualifying offset from that product." }, { "name": "prime number", "difference": "Primality means having exactly two positive divisors; being Fortunate means satisfying a specific minimal-offset condition." }, { "name": "lucky number", "difference": "Lucky numbers are generated by an iterative sieve on positive integers, whereas Fortunate numbers are defined using primorials and primality." } ], "questions": [ { "id": "evidence-neighbours-q01", "text": "Which of these neighbouring kinds and how to tell them apart hold for the sense of fortunate number this model covers, and on what evidence?", "kind": "provenance" } ] } ] } ] } ] }, "openQuestions": [ "What is the current published status of Fortune's conjecture, and which primary references establish that status?", "What is the largest independently reproducible range of certified fortunate-number occurrences, with both endpoint and minimality evidence available?", "Do intended source datasets consistently distinguish prime indices, prime bounds and any empty-product extension at index zero?", "Which imported tables provide proven primality rather than probable-prime results for their endpoints and offsets?", "Does the existing Vercy catalogue already cover this concept in a world model that vr.tr.fortunate-number should reference?" ], "statistics": { "bundles": 5, "layers": 9, "findings": 12, "questions": 20 } }