{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"convergence-25-nodes","urls":{"read":"https://miscsubjects.com/api/articles/convergence-25-nodes/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/convergence-25-nodes/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-25-nodes/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-25-nodes/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/convergence-25-nodes/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-25-nodes/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/convergence-25-nodes/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"convergence-25-nodes","title":"Convergence: 1. The 25 Nodes","register":"oip_protocol","tags":["OIP","convergence","philosophy","systems-theory","catalogue"],"updated_at":"2026-07-04T07:37:27.867Z","body_excerpt":"## The Claim\nTwenty-five nodes document convergent patterns across science.\n\n## Definitions\nA claim is a proposition.\nA node is a claim with 14 facets.\nID is the identifier.\nDomain is the field.\nPattern is the structure.\nMechanism is the process.\nScale is the size.\nTier is the strength.\nSource is the citation.\nDual is the opposite.\nFalsifier is the collapse trigger.\nRival frame is the competitor.\nIndependence check tests derivation.\nPattern type is the class.\nAxiom map is the link.\nLoad-bearing means the node supports the thesis.\nConditional means the node holds under assumptions.\nCarried means the node is decorative.\nConvergent means the pattern recurs across non-contacting domains.\nBorrowed means one domain copied the pattern from another.\nIndependence is the absence of borrowing.\nStructural means the pattern arises from mathematics, not coincidence.\nCausal contact means direct influence between domains.\n\n## The Logic\n1. If a node has tier T0-T1, then it is load-bearing.\n2. If a node has tier T2, then it is conditional.\n3. If a node has tier T3+, then it is carried.\n4. If independence is high, then the pattern is convergent.\n5. If independence is low, then the pattern is borrowed.\n6. If the falsifier appears, then the node collapses.\n7. If a rival frame exceeds the claim, then the node weakens.\n8. If nodes span domains without causal contact, then the pattern is convergent.\n9. If the same equation appears in unrelated fields, then the pattern is structural.\n\n## The Evidence\nC01 (Gradient Dissipation): Prigogine (1977), Schroedinger (1944), Schneider and Kay (1994), England (2013).\nC02 (Least Action): Fermat (1662), Lagrange (1788), Hamilton (1833), Feynman (1948).\nC03 (Symmetry-Conservation): Noether (1918), Weyl (1928), Wigner (1939).\nC04 (Symmetry-Breaking): Landau (1937), Anderson (1958), Higgs (1964), Turing (1952).\nC05 (Criticality): Bak, Tang, Wiesenfeld (1987), Kauffman (1993), Langton (1990), Wilson (1971), Beggs, Plenz (2003).\nC06 (Information-Entropy): Shannon (1948), Landauer (1961), Jaynes (1957), Kolmogorov (1965), Bennett (1982).\nC08 (Recursion): Godel (1931), Turing (1936), von Neumann (1948), Hofstadter (1979).\nC09 (Selection): Darwin (1859), Wallace (1858), Price (1970), Dawkins (1976), Campbell (1974), Edelman (1987).\nC10 (Scale Invariance): Mandelbrot (1982), Kleiber (1932), West, Brown, and Enquist (1997), Wilson (1971).\nC11 (Networks): Euler (1736), Watts and Strogatz (1998), Barabasi and Albert (1999), Granovetter (1973).\nC12 (Autopoiesis): Maturana and Varela (1972), Varela (1979), Luhmann (1984), Thompson (2007).\nC13 (Free Energy): Helmholtz (1867), Friston (2005, 2010), Rao and Ballard (1999).\nC14 (Duality): Bohr (1928), Newton (1687), Heraclitus (~500 BCE), Lao Tzu, Jung (1951).\nC15 (Optimization): Pareto (1906), Koopmans (1951), Carnot (1824), Stearns (1992).\nC16 (Branching): Murray (1926), Horton (1945), Bejan (1996), West, Brown, and Enquist (1997).\nC17 (Spirals): Fibonacci (1202), Schimper (1830), Jean (1994), Lindstedt (1984), Lin and Shu (1964).\nC18 (Waves): d'Alembert (1746), Fourier (1822), Maxwell (1865), Schroedinger (1926), Hodgkin and Huxley (1952).\nC19 (Thermoeconomics): Georgescu-Roegen (1971), Odum (1971), Lotka (1922), Ayres (1998).\nC20 (Computation): Church (1936), Turing (1936), von Neumann (1945), Wolfram (2002).\nC21 (Emergence): Anderson (1972), Laughlin (1999).\n\n## The Falsifier\nA node has zero independent derivations.\nSources show borrowing, not independence.\nA falsifier appears.\n\n## The Uncertainty\nNodes C20-C25 are absent.\nC13 falsifiability status is unknown.\nC12 is a definition or a mechanism. Its status is unknown.\nC17 astronomical claim is weaker than biological claim.","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[],"sources":[],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"convergence-25-nodes","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"honesty":{"active_claims":0,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":0,"claims_total":0,"sources":0,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}