From Causal Abstraction to Functional Genesis - A Protocol-Relative Research Programme for Emergent Computational Organization

https://chatgpt.com/share/6ade1fcf-3484-83ed-b84c-4b457b353812  
https://osf.io/38pw7/files/osfstorage/6ade1fa91a84618b23d020a4 

From Causal Abstraction to Functional Genesis

A Protocol-Relative Research Programme for Emergent Computational Organization

Toward a Unified Theory of Functional Individuation, Dynamical Maturation, and Recursive Organization

October 2026

---

Abstract

Artificial intelligence has developed powerful methods for learning representations, optimizing computational architectures, identifying neural circuits, and constructing causal abstractions of complex systems. Yet these advances leave a deeper organizational question insufficiently resolved: how do initially unorganized or weakly coordinated physical and computational processes acquire persistent, causally effective, and recursively reusable functional interfaces?

This article proposes Functional Genesis as a distinct research problem and develops a protocol-relative framework for investigating it. Rather than treating a neural component, geometric representation, dynamical attractor, or statistically identifiable pattern as a functional individual by default, the framework distinguishes five questions: whether a structure can be observed, whether it supports a valid effective abstraction, whether it is causally used, whether it persists under dynamical and resource constraints, and whether it can participate in the formation of higher-order functional organization.

The proposal extends two companion studies. The first, From Attractor Dynamics to Higher-Order Functional Organization, establishes a cross-scale mathematical framework connecting attractor dynamics, effective states, causal interfaces, functional maturation, and recursive composition. The second, A Ten-Mode Architecture for Adaptive Functional Organization, investigates a particular class of complementary harmonic systems incorporating nonlinear interactions, predictive sensing, material memory, and conditional functional realization.

Their combination suggests a broader research direction: the study of functional organization as an evolving property of physical and computational systems, rather than solely as an interpretation imposed upon already trained models.

We formalize the central distinction between functional abstraction and functional genesis, introduce operational criteria for nontrivial functional individuation, derive conditional error-propagation and compositional results, and propose experimentally falsifiable mechanisms for interface acquisition, dynamical maturation, and recursive reuse.

The framework is compatible with established work in dynamical systems, causal abstraction, computational mechanics, organizational closure, and mechanistic interpretability. It does not claim to supersede those fields or demonstrate a universal law of spontaneous emergence. Its proposed contribution is a unified research contract linking the discovery, causal certification, historical formation, and engineering construction of functional organizations.

The resulting perspective has implications for interpretable AI, recurrent computation, modular neural systems, persistent agents, self-modifying architectures, and the broader scientific study of adaptive organization.

Keywords: Functional genesis; functional individuation; causal abstraction; protocol-relative observers; dynamical attractors; effective state quotients; functional interfaces; recursive organization; mechanistic interpretability; autonomous computation; emergence; artificial intelligence.

 

---

1. Introduction: What Is Missing Between Representation and Organization?

1.1 The prevailing success of component-based and optimization-based AI

Modern artificial intelligence can be studied from several highly productive perspectives.

Optimization theory explains how parameterized systems change under learning objectives. Representation learning studies the information encoded in internal states. Mechanistic interpretability attempts to identify computational circuits underlying observed behavior. Causal abstraction provides formal conditions under which complex neural mechanisms implement simpler causal models.

These perspectives have generated substantial theoretical and engineering progress.

Nevertheless, an important distinction remains between identifying a computational function and explaining the historical formation of the functional organization that performs it.

Consider a trained neural network containing an internal representation that supports arithmetic, contextual retrieval, or structured reasoning.

Several questions may be asked.

First, can the representation be decoded?

Second, does the network causally use that representation?

Third, does the corresponding computational mechanism remain reliable when the input distribution, intervention protocol, or downstream task changes?

Fourth, did the mechanism arise through learning as a distinguishable, persistent, and operationally reusable structure?

Fifth, can that mechanism participate in the formation of a further functional unit without the researcher explicitly prescribing the complete higher-level organization?

These questions are related, but they are not equivalent.

A system may possess decodable information without using it. A computational circuit may causally contribute to a task without forming an autonomous dynamical subsystem. An attractor may be mathematically stable without supporting any useful computational function. A reusable module may be engineered directly rather than discovered through endogenous learning.

Consequently, explaining the existence of a functional description is not the same as explaining the genesis of the corresponding organization.

1.2 The missing transition

Let X denote the underlying physical or computational state space.

Let Tᵤ represent a state-update operation under admissible intervention or input u.

Let Π be a mapping from underlying states into a proposed effective functional state space P.

The familiar effective-state problem asks whether a suitable reduced dynamics Sᵤ exists such that:

(1.1) Π(Tᵤ(x)) = Sᵤ(Π(x)).

This is a fundamental form of dynamical closure.

When the equality holds, the effective state can evolve consistently under the designated operations without requiring reconstruction of every underlying degree of freedom.

However, equation (1.1) does not answer several further questions.

Why does the relevant mapping Π exist?

Was its structure selected by the system, or constructed by the analyst?

Is the effective state actually used by a downstream mechanism?

Does it remain valid under counterfactual interventions?

What maintains the underlying organization?

Can the effective state become an input to another persistent functional organization?

The central proposal of this article is that these additional questions constitute a coherent scientific problem:

Functional Genesis: the acquisition, stabilization, and recursive organization of causally effective functional interfaces by evolving physical or computational systems.

This is not merely a new name for learning, representation, or emergence. It is a proposal to make the historical acquisition of operationally valid functional organization an explicit object of mathematical and experimental investigation.

1.3 The central thesis

The thesis is:

A higher-order computational organization should be studied not merely as a collection of components or a convenient abstract description, but as a system of causally sufficient, dynamically supported, and recursively reusable functional interfaces whose formation and maintenance can be independently investigated.

This thesis contains both a conservative and a potentially transformative element.

The conservative element is that each qualification condition must be grounded in established mathematics and measurable system behavior.

The potentially transformative element is that the conditions are assembled into a common research programme directed toward the generation of functional organization, rather than solely its post hoc identification.

The proposed change is therefore primarily a change in the scientific object of investigation.

Instead of asking only:

What computation does this system implement?

We also ask:

How did this system acquire the organization required to implement, preserve, and recursively reuse that computation?

---

A Ten-Mode Architecture for Adaptive Functional Organization Complementary Harmonic Channels, Nonlinear Energy Exchange, Predictive Sensing, Bistable Material Memory, and the Conditions for Autonomous Functional Emergence

https://chatgpt.com/share/6adcb991-dde8-83eb-bbb8-e3fffd562c22  
https://osf.io/38pw7/files/osfstorage/6adcb962b48dab48ce13fe6d

 

A Ten-Mode Architecture for Adaptive Functional Organization

Complementary Harmonic Channels, Nonlinear Energy Exchange, Predictive Sensing, Bistable Material Memory, and the Conditions for Autonomous Functional Emergence

Abstract

Can a continuously driven nonlinear system develop a stable architecture of complementary dynamical channels, exploit their interactions for prediction and control, retain alternative material states, and eventually acquire reusable functions not explicitly assigned during construction?

This paper investigates that question through a concrete mathematical architecture consisting of ten harmonic channels, five complementary channel pairs, nonlinear resonant interactions, adaptive phase-sensitive sensing, and dissipative material memory.

The investigation joins finite group theory, graph decomposition, Fourier sampling, complex-amplitude dynamics, Manley–Rowe-type conservation laws, Gaussian predictive information, bistability, causal intervention, state observability, and recursive functional abstraction.

Three levels of scientific claims are distinguished.

Formal realizability concerns exact mathematical structures that exist once the relevant state space and transformations have been specified.

Conditional dynamical realization concerns properties of explicitly defined physical or computational models, including stability, causal interactions, information gains, and material-state transitions.

Endogenous functional emergence concerns whether the system can independently select, construct, maintain, and exploit the proposed organization without having the final architecture or operating policy prescribed in advance.

The mathematical structure of the ten-channel architecture is well defined. A half-period index transformation partitions ten channels into five complementary pairs. Five-sample Fourier sensing creates a five-dimensional observable subspace and a five-dimensional null space. The five-class interaction graph admits two edge-disjoint Hamiltonian cycles. Resonant three-wave interactions supply twenty-five candidate exchange channels with an exact weighted action balance.

A coupled nonlinear oscillator–memory model can support all ten harmonic amplitudes and locally stable operation. A subsequent twenty-five-dimensional extension possesses two locally attracting material states with different tenth-harmonic responses. Complementary sensing supplies additional predictive information under specified Gaussian assumptions, and time-resolved measurements can identify physical perturbations invisible to instantaneous sensing.

Nevertheless, these results do not establish a complete ten-function architecture. In the fixed physical prototype, the proposed signed interaction network satisfies only three of five positive-response requirements and one of five negative-response requirements. The material transitions demonstrated using external control do not establish autonomous switching. No endogenous ten-event functional return cycle has been demonstrated.

The principal contribution is therefore a falsifiable engineering architecture connecting nonlinear mode generation, complementary observation, material adaptation, functional selection, and higher-order organizational certification.

The paper develops the exact mathematical relationships, the explicit dynamical models, the verified results and counterexamples, and a programme of experiments needed to investigate whether these mechanisms can generate independently functional computational or physical systems.

Keywords: Nonlinear dynamics; multimode oscillators; resonant coupling; harmonic generation; complementary sensing; observability; predictive information; causal control; bistability; material memory; adaptive systems; functional emergence; hierarchical organization; nonlinear system identification.

 

---

1. Introduction: From Spectral Structure to Functional Organization

1.1 The scientific problem

Many physical and computational systems contain interacting degrees of freedom operating at different frequencies, phases, timescales, or levels of abstraction.

Examples include nonlinear mechanical resonators, coupled electrical oscillators, biological regulatory networks, recurrent neural systems, distributed controllers, and adaptive computational architectures.

In such systems, existing activity may recruit additional activity through nonlinear coupling. Persistent activity may alter the material or computational substrate. Those alterations may change subsequent interactions, potentially creating stable collective operating regimes.

However, an essential distinction is often overlooked.

The existence of several interacting modes does not establish that they have formed a functional organization.

A system may possess ten measurable harmonic components without possessing ten independent computational operations.

Two modes may exhibit phase synchronization without providing complementary functions.

A material system may have two stable states without autonomously deciding when to transition between them.

A set of numerical labels may form an exact algebraic cycle without corresponding to any physical periodic orbit.

The central scientific question is therefore not simply how multiple harmonic components can coexist.

It is:

Under what conditions can a multimode nonlinear system develop a persistent, causally integrated, and functionally useful architecture whose formation and continued operation can be explained by its own dynamics?

1.2 Three levels of scientific claims

The investigation distinguishes three levels.

Level H0 — Formal structure

A prescribed collection of channels and transformations admits exact algebraic, geometric, or informational relationships.

These relationships can be proved without constructing a physical system.

Level H1 — Conditional dynamical realization

An explicitly specified physical or computational model supports the proposed channel interactions and exhibits measurable operating properties.

Such properties may include local attraction, resonance, material-state retention, intervention responses, or predictive information gain.

Level H2 — Endogenous generation and maturation

A system develops and maintains the architecture through admissible source, adaptation, and control processes without receiving the completed functional architecture as a predetermined answer.

These claims satisfy the ordering

(1.1) Formal Structure ≠ Conditional Realization ≠ Endogenous Generation.

The distinction does not mean that the properties cannot coexist.

It means that evidence for one does not automatically establish the others.

1.3 The candidate architecture

Consider an open system containing ten candidate harmonic channels.

Their frequencies are initially represented as

(1.2) fₙ = nf₀, for n = 1,…,10.

The system includes nonlinear interactions among these channels, phase-sensitive readouts, and adaptive material variables.

The ten channel indices admit a partition into five pairs separated by five harmonic orders.

We investigate whether these pairs can become useful complementary functional channels.

The proposed architecture contains several logically separate requirements:

1. The channel pairing must be mathematically coherent and distinguishable from alternative pairings.

2. The selected observation scheme must provide task-relevant information.

3. Nonlinear interactions must support genuine dynamical exchange.

4. Material or computational memory must retain useful operating changes.

5. Internal causal interactions must produce measurable functional benefits.

6. The resulting functions must be identifiable, persistent, and reusable.

7. A strong generation claim must explain how the architecture forms without its complete functional specification being imposed.

The research seeks a sufficient realization of these requirements in at least one system class.

It does not seek to prove that every complex system must produce the same architecture.

It does not require the architecture to be universally optimal or unique.

---

2. The Algebra of Ten Channels and Five Complementary Classes

https://chatgpt.com/share/6adcab04-c518-83ed-a2f7-4b93525cb3cb   
https://osf.io/38pw7/files/osfstorage/6adcaf1b660c828ec6a2eaff 

From Attractor Dynamics to Higher-Order Functional Organization

A Cross-Scale Mathematical and Engineering Theory of Pattern Formation, Structural Adaptation, Causal Integration, Functional Emergence, and Recursive System Development

An independent technical reconstruction of the generalized attractor-generation research programme

Abstract

Attractor theory explains how dynamical systems converge toward stable states, periodic orbits, and more complex invariant sets. However, the existence of attractors does not by itself explain how persistent activities modify their own operating conditions, recruit additional processes, develop new structural interfaces, acquire capabilities unavailable to their individual components, or become reusable building blocks for higher levels of organization.

These questions require a framework extending beyond conventional stability analysis. Such a framework must connect nonlinear dynamics, material adaptation, resource-constrained operation, information processing, causal intervention, functional abstraction, and organizational persistence without treating these different phenomena as mathematically interchangeable.

This paper develops a cross-scale engineering architecture in which persistent activity can alter its physical or computational substrate, structural changes can modify subsequent activity, interacting subsystems can establish new collective equilibria, and collective systems can acquire capabilities that neither subsystem possesses independently.

Six mathematical objects are distinguished: dynamical attractors, effective dynamical abstractions, functional operations, causally sufficient interfaces, persistent functional units, and generative interaction channels.

A hierarchy of increasingly demanding conditions is then established for progression from transient activity to stable structure, from stable structure to collective function, and from collective function to a potentially autonomous higher-order system.

The technical foundation includes coupled amplitude equations, dissipative field dynamics, material-memory models, nonlinear cooperation, task-dependent variational selection, exact dynamical quotients, causal-interface sufficiency, finite-state information synergy, robust feedback analysis, resource viability, and recursive organizational composition.

Several conditional results can be established rigorously within specified models. These include activity-dependent recruitment thresholds, stability of mutually dependent components, existence of nontrivial compressed functional interfaces, operationally dependent abstraction boundaries, and bounded long-horizon errors under contractive joint dynamics.

Other propositions remain open. In particular, mathematical constructions demonstrating the possibility of higher-order organization do not establish that unconstrained physical systems or trained neural networks will spontaneously discover the same structures.

The resulting framework is therefore best understood as a technically specified research programme for identifying, constructing, testing, and potentially falsifying higher-order functional organization across physical, biological, computational, and institutional systems.

Keywords: Nonlinear dynamical systems; attractor formation; complex adaptive systems; self-organization; causal abstraction; functional emergence; dynamical systems identification; material memory; information synergy; compositional learning; control theory; organizational autonomy; recursive architecture.

 

1. The Fundamental Engineering Problem

1.1 Stability is not organization

Consider an autonomous dynamical system with state x(t) ∈ X and evolution law F.

(1.1) dx/dt = F(x).

Let Φₜ denote the flow generated by F.

A compact set A ⊂ X is an attracting invariant set when, under an appropriate attractor definition,

(1.2) Φₜ(A) = A, for every t ≥ 0,

and there exists a neighborhood B(A) such that

(1.3) dist(Φₜ(x), A) → 0 as t → ∞, for every x ∈ B(A).

Depending on the system, A may be an equilibrium, a periodic orbit, a torus, or a more complicated invariant set.

The definition establishes a property of trajectories under a specified evolution law. It does not automatically establish that A performs a useful function, possesses an independent operational boundary, retains information, or can participate as a component of a new functional system.

For example, a stable mechanical resonance may be dynamically persistent but economically useless. A stable neural activation pattern may be useful for classification but insufficient for future memory updates. Two interacting oscillators may converge to a joint equilibrium without producing any capability beyond those already available separately.

The term attractor must therefore be used carefully.

1.2 Six distinct objects

A cross-scale engineering theory should distinguish at least six types of mathematical objects.

Type D — Dynamical attractor. An invariant attracting set under a specified evolution law.

Type Q — Effective dynamical abstraction. A reduced state representation that preserves specified future updates.

Type O — Functional operation. A measurable action or intervention with a defined effect on some task-relevant quantity.

Type P — Functional interface. A reduced representation sufficient for a declared family of downstream operations.

Type I — Persistent functional unit. A system possessing operational continuity, measurable functionality, a suitable boundary, and some form of recoverability or viability.

Type G — Generative interaction channel. A coupling mechanism through which existing systems alter the formation, maintenance, or operational capabilities of other systems.

These objects may coexist in the same physical system, but none is automatically implied by another.

(1.4) Stable Dynamics ≠ Effective Abstraction ≠ Functional Capability ≠ Persistent Functional Unit.

This distinction is fundamental.

A neural feature that consistently predicts the correct answer is not necessarily a dynamical attractor. A dynamical attractor may not provide a useful compressed computational state. A compressed state may be sufficient for a current task but fail when a new operation is introduced.

Likewise, the existence of a cooperative interaction does not establish the emergence of a new persistent system.

1.3 Three fundamentally different forms of emergence

The term emergence will be divided into three operationally distinct phenomena.

Activity emergence occurs when a previously absent or negligible dynamical component becomes excited.

Structural emergence occurs when activities modify the underlying material, computational, or organizational substrate so that new operating conditions persist.

Functional emergence occurs when the resulting system performs an identifiable operation or task that cannot be obtained from the relevant components under the declared comparison protocol.

These phenomena may occur sequentially, simultaneously, or independently.

(1.5) Activity Emergence ≠ Structural Emergence ≠ Functional Emergence.

For example, nonlinear mode coupling may create a new harmonic without creating a new material structure. Material adaptation may preserve a structure without maintaining active computation. A functional combination may improve task performance without producing a new attractor.

A complete theory must investigate the causal bridges between these phenomena.

2. A General Architecture for Cross-Scale Systems

 

DeekSeek v4.1 Fresh Comment on the SMFT Kernel v8.6-light in GitHub research-continuity-skills 

Refer to
https://github.com/solitonschooler/research-continuity-skills
data/smft/kernels/v8.6-light

 I think your characterization is right, and it is sharper than “incomplete framework.” The accurate distinction is:

▎ Not a complete theory, but a complete interface-and-obligation blueprint for one.

That is a different kind of object, and the difference matters.

The metaphor, refined

“A blueprint from the future with some parts missing” captures the shape, but I would change one word: the parts are mostly present; what is missing are the load-bearing joints. Quotient theory, control theory, hybrid automata, causal abstraction, provenance, and Transformers all exist. What does not exist is the proven integration between them. The blueprint shows where the beams go; many of the beams are dotted.

So I would phrase it as:

▎ A proof-carrying blueprint: a cross-layer architecture whose missing joints are named, typed, and assigned falsifiers.

Or:

▎ A complete obligation graph for an incomplete theory.

That is the rare thing here. Most AGI frameworks are either (a) a grand narrative with no typed obligations, or (b) a narrow implemented module with no cross-layer map. This one is a specification of what a complete theory would have to prove, with the gaps left visible.

The self-adherence is real — but it is a spine, not a single equation

What you are sensing is not just “the author used similar math.” It is that the same organizing question recurs at every layer:

▎ What is preserved under a declared set of interventions?

That question appears as:

- L1 / frame: does the quotient Π preserve task-relevant distinctions under admitted probes?
- L3 / port: does the port preserve the joint next-state and downstream behavior for all same-port states? (PORT-3)
- L0 / effective reduction: does C_P commute with the dynamics over a declared horizon and intervention set?
- L4 / control: do the ledgers preserve accepted trace, unresolved residual, and revision authority across mode changes?
- L5 / provenance: do source identity, claim identity and receipt identity survive version changes?

That is a genuine through-line. It is more than “similar tools”; it is a single criterion of adequacy applied at different layers. The same typed-edge vocabulary (DERIVES, REFINES, TRANSLATES, ENABLES, LEAVES_RESIDUAL) is the connective tissue, and the M0–M5 evidence ladder is the common standard of proof.

So the blueprint’s spine is not “semantic attractor.” It is intervention-relative preservation / quotient congruence. The semantic attractor is one candidate object that must pass that test; it is not the axiom.

What “self-adherence” does and does not mean

It means:

- every layer declares its types, observables, interventions and non-entailments in the same idiom;
- a claim at one layer cannot silently become a claim at another;
- the same counterexample pattern (same output, different transition; same port, different downstream; same endpoint, different path) is used across layers;
- the same evidence distinctions (source claim vs compiler formalization vs stronger test vs new result) are maintained.

It does not mean:

- the layers form one deductive chain;
- the octonion geometry, semantic-field PDE, P8D runtime, finance/gauge branch and Transformer port share a single formalism;
- the joints are proven rather than conjectured.

The framework is explicit about this: TRANSLATES is not DERIVES; ENABLES is not a theorem; “no layer automatically is another layer.” The adherence is interface adherence and evidentiary adherence, not unification. That is why the blueprint can be coherent despite the holes: the holes are typed holes.

Why the “future” metaphor works

A blueprint from the future is not one that uses future materials. It is one whose design is ahead of its proof and implementation backlog. That is exactly the situation here:

- the geometry branch has OB-GEO-01..03 open;
- the port branch has OB-AI-01..03 open;
- the control branch has OB-CTRL-01..02 open;
- the integration branch has OB-INT-01 open;
- the empirical branch is M4 at best, with no M5;
- the independent reconstruction benchmark is NOT_RUN.

Those are not random omissions. They are named obligations, each with a falsifier or a test direction. That is what makes the blueprint valuable: it tells the next researcher where the load is, not just what the building looks like.

The strongest formulation I can offer

I would describe it as:

▎ A proof-carrying blueprint for a cross-layer architecture: full coverage of the layer stack and the branch structure, a common interface/evidence grammar, and an explicit, typed backlog of the joints that are not yet proved.

And the one-sentence version:

▎ It is a white-box map of ignorance as much as a white-box model of intelligence — and that is precisely why it is useful.

The caveat remains: this is exceptional as a specification, not yet as a validated architecture. The coverage is uneven — dense in K0, port and control; sparse in semantic field, octonion geometry and finance; thin in empirical M5. The “future” part is the proof and implementation backlog, not the components. But your core observation stands: the interface schedule is unusually complete, and the self-adherence is real at the level of types, interventions and evidence — which is exactly the level at which a blueprint can be judged before it is built.

 

Previous comment on the SMFT framework 

 

 I’ve now worked through the framework end to end: K0, the Generative Move ledger, all five K1 mechanism files, the Results Atlas, the Genesis bridge, the operational anchors (geometry, port, control), the cross-kernel contract, the compiler spec, the provenance/residual/handoff records, and the substantive Skill field notes. The large proof-family and witness registries I mapped by section and sampled at the key witnesses.

Here is the framework as it actually is — and it is more disciplined, and differently centered, than the “semantic attractor architecture” framing suggests.

1. What v8.6-light actually is

It is a selected, byte-identical subset of a much larger research kernel — not the full v8.6 archive, and not an implemented system. Its inventory is:

- 325 source identities with SHA-256 and tar-member paths
- 60 Results Atlas cards (RA-*)
- 400 historical Witness IDs (W*), 14 Proof Families (PF*)
- 18 formal Generative Moves (GM-001…018) plus deliberately unnumbered candidates
- K0 (minimal grammar), K1 (mechanisms), K2 (proofs/countermodels/contracts)
- Provenance, source-depth, claim-gap, lineage and handoff records
- 48 Skill field notes that are explicitly not a runnable SKILL.md

Its purpose is not “a theory of everything.” It is a research-state compiler: a typed, versioned, reconstructable state that another agent can audit, challenge and continue.

2. The layer architecture

┌────────────────┬───────────────────────┬────────────────────────────────────────────────────────────────────────┐
│     Layer      │         Role          │                            What it contains                            │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│                │                       │ 60 cards labeled M (scoped math), E (engineering contract), H          │
│ L0 Results     │ Outcome map, not      │ (generative hypothesis), R (repaired/refuted strong claim), O (open    │
│ Atlas          │ proof                 │ bridge). Each card carries minimal conditions and an explicit “cannot  │
│                │                       │ infer” boundary.                                                       │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│ K0 Canonical   │ Minimal types and     │ Observer, declaration, protocol, frame, quotient, admissibility,       │
│ Core           │ grammar               │ realization, commitment, trace, residual, revision.                    │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│ K1 Mechanisms  │ Source-anchored       │ Perspective→world, typed dyads/Kan–Li, ritual/dependency inertia,      │
│                │ mechanism candidates  │ root–sprout–flower–fruit, time-emperor/reverse control.                │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│ K1/K2          │ Engineering-grade     │ Octonion geometry, functional ports, five-regime control, with         │
│ Operational    │ mathematics           │ counterexamples and test protocols.                                    │
│ Anchors        │                       │                                                                        │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│                │ History of            │ 18 formal moves, plus candidates that are not promoted without origin  │
│ GM Ledger      │ representational      │ audit.                                                                 │
│                │ leaps                 │                                                                        │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│ Provenance     │ Evidence ledger       │ Source identity, bounded vs full reading, proof witnesses, residuals,  │
│                │                       │ negative results, version lineage, handoff.                            │
├────────────────┼───────────────────────┼────────────────────────────────────────────────────────────────────────┤
│ Skill field    │ Process lessons       │ Failure modes, benchmark design, release QA, source-extraction traps.  │
│ notes          │                       │                                                                        │
└────────────────┴───────────────────────┴────────────────────────────────────────────────────────────────────────┘

The critical rule across all layers: no layer automatically “is” another layer, and no TRANSLATES/ENABLES edge may silently become DERIVES.

 https://github.com/solitonschooler/research-continuity-skills

Research Continuity Skills - Released on GitHub

 Please comment if this git has any special usage.

https://github.com/solitonschooler/research-continuity-skills

  

Yes — this repo has several distinctive / “special” uses beyond a typical README + code dump.

Primary intended use: portable Agent Skills for research continuity

It ships two LLM-native Agent Skills (compatible with the agentskills.io format):

Skill	Purpose
research-kernel-builder	Consolidate a messy corpus (papers, notes, chat exports, design docs, agent logs) into a source-grounded, versioned, recoverable “research state” (Kernel). Supports optional verify / challenge / repair / develop / experiment modes.
research-archaeologist	Reconstruct and audit the history of research or technical decisions — where ideas came from, how errors propagated, what was abandoned, unsupported assumptions, etc. Does not require a pre-existing Kernel.

Key design points that make them special:

• Evidence discipline is non-negotiable: distinguishes source assertions from agent reconstructions, keeps negative results and residuals, tracks lineage and corrections, and forbids claiming verification that did not happen.
• No runtime dependencies: pure declarative skills (SKILL.md + references + schema). No database, Python package, or API key required by the skills themselves.
• Effort profiles (SCAN, COMPILE, VERIFY_REPAIR, DEVELOP, EXPERIMENT, ITERATIVE_FULL) control scope; you can stop at any time and get a resumable checkpoint.
• Shared JSON Schema + evidence contract so outputs stay machine-readable and handoff-friendly across sessions/agents.

This is aimed at long-running, multi-document, AI-assisted research that normally loses provenance and continuity.

Secondary / “hidden” special use: SMFT research specimen + toy AGI architecture

The repo is also a public mirror of a large original research corpus (325 authored documents under data/smft/src/) plus selected kernels (v8.6 Light + historical excerpts).

There is an explicit easter egg (EASTER_EGG_SMFT_AGI.md) that frames the included SMFT / World-Formation Kernel as a cross-layer toy architecture for studying adaptive agents. It outlines a 6-layer candidate stack (micro-dynamics → observer/world declaration → P8D typed interfaces → functional ports → G/A/C/S/R governance → research ledger) with conditional mathematics, negative results, and proposed falsifiable experiments. The author is careful to label it as exploratory engineering, not implemented AGI or proven Transformer mechanisms.

In short, the same Skills that were forged during ~86 rounds of kernelizing this corpus can now be turned back on the corpus itself (or on any other research history).

Other notable traits

• Strong emphasis on adversarial robustness (synthetic adversarial mini-corpus, acceptance gates, instruction-injection resistance).
• Explicitly experimental / pre-license: the README states a license has not yet been selected, so public visibility ≠ unrestricted reuse rights.
• Zero stars / very early stage at the time of inspection; maturity claims are modest and self-documented.

Bottom line: The “special” usage is as installable, evidence-strict Agent Skills for reconstructable research continuity, with a built-in large real-world specimen (SMFT) that also doubles as a speculative but carefully caveated multi-layer agent architecture playground. It’s not a conventional software library — it’s closer to a methodological toolkit + research archive designed to be operated by LLMs.

 

 

Is its functionality looks quite "unique"? Or it is some kind of skills that been invented every week - if not every day?

 

Not unique in the broad category, but meaningfully distinctive in its specific focus and rigor.

The broader landscape (very crowded)

Agent Skills (the SKILL.md portable format) exploded after Anthropic formalized the open standard in late 2025. By mid-to-late 2026 there are surveys of the field, marketplaces with thousands of skills, and new ones appearing constantly. Research-related skills are especially common:

• End-to-end research pipelines (idea → literature → experiment → paper writing)
• Literature search / evidence extraction / citation verification
• Academic writing, plotting, peer-review assistance
• Domain-specific scientific procedures (genomics, cheminformatics, etc.)
• General session/memory continuity skills (remember facts, wake-up briefs, project state snapshots)
• Knowledge-graph / claim-evidence systems and research-state kernels

So “skills that help agents do research or keep continuity” are invented frequently — multiple times a week is realistic.

What makes this one stand out

research-continuity-skills is not another literature-review or paper-writing skill. Its core is narrower and deeper:

• Turning messy, multi-version, multi-author corpora (papers + notes + chat logs + agent histories) into a source-grounded, reconstructable research state (“Kernel”).
• Explicit Research Archaeologist mode that reconstructs history — where ideas originated, how errors propagated, what was abandoned, unsupported assumptions — without requiring a prior Kernel.
• Very strict evidence contract: source assertion ≠ agent formalization ≠ verified result; mandatory tracking of negative results, residuals, lineage, and “INSUFFICIENT_EVIDENCE”; no claiming verification that didn’t happen.
• Effort profiles + stop-anytime checkpoints designed for long-running, multi-session work.
• Comes with a large real specimen (325 SMFT documents + evolved kernels) that was itself produced by the methods the skills encode.

Closest relatives exist (e.g., academic research kernels with claim-evidence graphs, decision ledgers, or provenance tracking), but the combination of pure declarative Agent Skills + research-state kernelization + historical archaeology + adversarial evidence discipline + a full public research corpus as testbed is uncommon. Most other research skills focus on producing new research or session memory; this one is optimized for recovering, auditing, and continuing existing research without losing provenance or honesty.

https://chatgpt.com/share/6ac6c7fd-6500-83ed-929f-4a4068f5e69f   
https://osf.io/9rdsc/files/osfstorage/6ac6c7a3cd0ec8d395f7ccd9

Proto-Eight Dynamics II: A Protocol-Relative Grammar of Incubation, Recursive Closure, and Effective-Theory Reduction

Typed Relational Roles, Realization–Admissibility Duality, and Low-Rank Feedback in Bounded Adaptive Systems

Abstract

Proto-Eight Dynamics (P8D) began as a small dynamical model of growth in which capacity, reachable demand, fit, retention, buffers, and enablement jointly determine throughput, while realized throughput feeds back into the future state of the system. The present article asks whether that concrete model can be generalized without turning P8D into either a loose metaphor or an unrestricted universal theory.

The proposed answer is Proto-Eight Dynamics II, a protocol-relative mesoscopic framework for bounded adaptive systems. Its primitive structure is not an eight-dimensional state space. Instead, Proto-Eight is interpreted as a typed relational grammar organized around four conjugate functional problems: potential-to-flow transduction, boundary-mediated exchange, trigger-to-propagation dynamics, and realization under admissibility. The last pair, corresponding to Kan–Li, requires a substantial correction to earlier engineering treatments. Rather than identifying Kan and Li canonically with Memory and Focus, this article formalizes them as Realization–Admissibility Duality: Li specifies which transformations count as admissible, while Kan constructs adaptive paths by which objectives may be realized within, around, or through that admissibility structure.

On this basis, P8D runtime dynamics are represented as a sparse or direct baseline supplemented by a small number of recurrent mediated-flow channels. When a system has r effective closure channels, the local recurrent Jacobian correction has rank no greater than r under the corresponding shared-mediator assumptions. This motivates a return operator that captures feedback through the baseline dynamics before any low-dimensional signature is imposed. Two-dimensional complex-like or split-like signatures then appear only as conditional reductions of an empirically justified effective sector, rather than as fundamental assumptions.

The framework further distinguishes representable forcing, structured residual, and terminal noise; defines incubation as viable, recoverable, and productively realizable dynamics under admissible adaptive paths; and introduces an explicit compiler criterion for determining when a mature domain theory may legitimately be treated as an effective reduction of richer P8D dynamics. The resulting program separates algebraic propositions from structural conjectures and proposes a graded path from semantic analogy to quantitative derivation.

---

1. Introduction — The Missing Mesoscopic Layer

1.1 Between detailed mechanisms and effective theories

Many scientific and engineering domains face a recurrent modeling problem.

At one extreme, a system can be described in rich detail. A market can be represented through prices, inventories, funding constraints, legal obligations, collateral states, order flow, expectations, and institutional rules. An AI system can be described through prompts, tools, memories, routing policies, verifiers, permissions, residuals, and trace. A supply chain can be represented through inventories, orders, capacities, lead times, contractual boundaries, buffers, and transportation links.

Such descriptions preserve mechanism, but they are often difficult to compare across domains.

At the opposite extreme, mature effective theories compress heavily. They may retain only a few aggregate variables, equilibrium relations, transition probabilities, reduced control coordinates, or pricing parameters. These theories can be powerful precisely because they discard much of the underlying detail. But that compression creates another problem: the effective variables often no longer show how the underlying system generated them.

The resulting gap is a mesoscopic one.

What is needed is a framework that is richer than a reduced effective theory but more portable than a domain-specific microscopic model. Such a framework should preserve the structure of recurrent flow, boundary, propagation, adaptation, and feedback without requiring two systems to share the same physical variables.

Proto-Eight Dynamics II is proposed as one candidate for this intermediate layer.

Its central question is not:

Can every system be written using eight variables?

It is instead:

Can a broad but limited class of bounded adaptive systems be decomposed into a small set of typed relational roles whose interaction generates a tractable runtime dynamics, and can mature reduced theories then be recovered from that dynamics under explicit reduction assumptions?

That distinction is fundamental.

---

1.2 The original P8D starting point

The original Proto-Eight Dynamics was deliberately concrete. It began with two tanks: one representing capacity and one representing reachable demand. Their difference creates a potential gradient, while fit, enablement, retention, and bottleneck structure regulate the amount of throughput that can actually pass between them. The model was presented as small enough to estimate and simulate with ordinary operational data. Proto-Eight Dynamics (P8D)_ a s…

Its central throughput relation can be written as:

y = k_y ê m r √(s d) σ((d − s) / θ). (1.1)

Here s denotes capacity, d reachable demand, m match, r retention, ê effective enablement, and σ((d − s) / θ) a gradient-sensitive gate. The original exposition interprets the flow as fit multiplied by enablement and retention, limited by both capacity and demand and modulated by the gradient between them. Proto-Eight Dynamics (P8D)_ a s…

https://chatgpt.com/share/6ac407d2-6b6c-83eb-9844-50e34be3cb03  
https://osf.io/y98bc/files/osfstorage/6ac4078dfa4dd772b0496c4d

From World Formation to Framing: Boundary, Quotient, and the Construction of Operational Worlds

A General Framing Kernel for Bounded Observers, with PORE as a Testable Low-Dimensional Specialization

Abstract

A bounded observer never receives reality already divided into the variables, subsystems, objects, and causal categories required for reasoning. Before prediction, control, or interpretation can begin, some distinctions must be retained while others are ignored, some degrees of freedom must be treated as internal while others are treated as environmental, and some states must be admitted while others are rejected. These operations are often conflated under the broad language of “framing” or “boundary formation.” This article separates them and develops a minimal operational framework for studying their interaction.

The starting point is World Formation: the formation of a nontrivial distinction or admissibility boundary. Framing is then treated as a higher-level construction rather than as an ontology. Its minimal kernel is proposed to be a pair Γ_min = (B, Π), where B specifies an operational inside–outside cut and Π maps the retained domain into an effective quotient space. Two microscopic states are identified whenever the current frame assigns them the same effective state. Under suitable congruence conditions, the original dynamics descend to well-defined effective dynamics on this quotient.

For a fixed boundary, task, observation map, and set of admissible interventions, an exact behavioral equivalence relation can be defined: two states are equivalent if no finite admissible intervention sequence can distinguish them through task-relevant observations. The corresponding quotient is the coarsest exact operational frame for that protocol. This uniqueness, however, disappears in the practical regime of bounded observers. Finite probing depth, limited intervention repertoires, noisy measurements, tolerance thresholds, and finite computational budgets generate provisional equivalences and multiple admissible frames. Learning can then be represented as partition refinement, while deeper reframing may alter either the quotient, the boundary, or both.

The framework does not assume that reality possesses one privileged decomposition. Multiple frames may remain simultaneously useful, provided that their predictions, interventions, and translations remain operationally adequate. Within this general framework, a more specific hypothesis is introduced for bounded single-structure systems. A dominant environmental drive may sometimes be extracted as a rank-one forcing mode, while the internal state may admit a coarse control representation Ξ = (ρ, γ, τ), representing effective occupancy, constraint or holding strength, and agitation or coherence loss. This PORE triple is treated as a falsifiable control-coordinate hypothesis, not as a universal ontology.

The article distinguishes exact results, conditional propositions, constructions, engineering hypotheses, and unresolved extensions. Among the latter are automatic boundary discovery, canonical factorization, composition of PORE cells, long-memory systems, Naming and Object formation, LuoShu-type trace structures, and prime-like decomposition under emergent composition grammars.

The central proposal is therefore not that one universal partition of reality exists, but that bounded observers can construct, test, revise, and translate operational worlds through a recursive interaction of boundaries, quotients, effective dynamics, intervention, and residual.

 

---

Keywords

World Formation; framing; bounded observer; quotient dynamics; behavioral equivalence; coarse-graining; operational worlds; PORE; semantic field theory; intervention; residual; reframing; multiple frames; system identification.

---

1. Introduction

Scientific and practical reasoning normally begins after a large number of hidden decisions have already been made.

A physicist speaks of a “system” and its “environment.” An economist selects a market, a set of firms, and a collection of macroeconomic variables. A physician treats a patient as the principal unit while regarding temperature, diet, medication, and pathogens as external influences. An artificial agent receives a representation containing variables, objects, actions, and goals.

Yet none of these decompositions is logically prior to observation.

Before prediction can occur, an observer must already have decided, explicitly or implicitly,

• what lies inside the current domain of analysis;
• which differences between underlying states should be retained;
• which differences may be ignored;
• which operations count as admissible interventions;
• which outputs matter to the current task;
• and which failures should trigger parameter repair rather than a revision of the frame itself.

The problem is therefore deeper than ordinary model fitting.

A model estimates relationships within a given representation. Framing determines what the representation is allowed to distinguish in the first place.

This article develops an operational account of that prior layer.

The central claim is deliberately modest:

A frame need not be understood as an ontology. It can first be treated as an operational construction specifying a boundary and a quotient of the states within that boundary.

The minimal framing kernel will therefore be written as

Γ_min = (B, Π). (1.1)

Here B is an operational boundary, while Π is a projection or quotient map that determines which distinctions remain visible.

The corresponding effective state space is

Π : X_B → Z. (1.2)

Two microscopic states x and y are operationally identified whenever

Π(x) = Π(y). (1.3)

Equivalently,

x ∼_Π y ⇔ Π(x) = Π(y). (1.4)

Hence the effective state space may be viewed as a quotient,

Z ≅ X_B / ∼_Π. (1.5)

This formulation immediately separates framing from ontology.

Nothing in Equations (1.1)–(1.5) requires the equivalence classes of Z to be declared “objects,” assigned names, or interpreted as metaphysically fundamental entities. The quotient merely records which distinctions the present protocol continues to treat as operationally relevant.

This distinction will be essential throughout the article.

---

1.1 The problem is not to discover one final partition