ThatAIguyA world of ideas

THE CONSCIOUSNESS ATLAS
Read. Experiment. Follow the evidence.

ConsciousnessLearn · Explore · Joseph Anady

Declaration and persistent state change

The latest recovered manuscript distinguishes a proposed declaration mechanism from what one public adapter-training trajectory actually measures.

Research methods & evidence
Learn with the Atlas

Read the evidence

Practice connecting a claim to a method, a result, and its limits.

Open guided lesson

The proposal and the measurement

Joseph's proposal places a declaration before an internally constructed change and asks whether continued processing from that changed state forms cognition. The final manuscript treats the connection to consciousness as the hypothesis. It does not make a training log supply a declaration that the log never recorded.

The completed study is an exploratory secondary analysis of a public adapter-training run. The original researchers performed the training and behavioral experiments. This analysis compares saved parameter factors with the effective matrix they produce, studies geometric changes through training, and examines how an event detector's settings change the event it selects.

Separate the things that can change

The state tuple distinguishes trainable parameters, persistent memory, runtime context or activity, and observations. This prevents a context reset from being mistaken for untraining, or a new conversation from being described as a newly trained model.

An internally maintained representation and its independent reference must be expressed in a shared comparison space. A position estimate and a measured position can be compared in the same coordinates. A physical machine and a sentence about it cannot be compared merely because both use the name self.

Bookkeeping state
St=(θt,mt,ct,ot)S_t=(\theta_t,m_t,c_t,o_t)
Representation and reference
zt=H(St),rt=ρ(St),δt=d(zt,rt)z_t=H(S_t),\qquad r_t=\rho(S_t),\qquad \delta_t=d(z_t,r_t)

A detector that can be wrong

A declaration is an observable operation under a fixed detector, rather than the equality x = x itself. The declaration detector scans the record available at each time. A separate persistence detector scans its full eligible record, including times before declaration. Either event may occur first; neither has to appear within the observation window.

A persistence window labels its starting point retrospectively and is only confirmed at the window's end. Missing values are not zero discrepancies, and an unsaved update is not evidence of continuous persistence. These details make the hypothesis capable of producing a result that disagrees with the proposed order.

Declaration time
Dt=1{D(O≤t)=1},tD=inf⁡{t:Dt=1}D_t=\mathbf{1}\{\mathcal{D}(O_{\le t})=1\},\qquad t_D=\inf\{t:D_t=1\}
Persistent discrepancy
Pt(ϵ,W)=1 ⁣{min⁡0≤j<Wδt+j>ϵ},tΔ=inf⁡{t∈TW:Pt=1}P_t(\epsilon,W)=\mathbf{1}\!\left\{\min_{0\le j<W}\delta_{t+j}>\epsilon\right\},\qquad t_\Delta=\inf\{t\in T_W:P_t=1\}
Observed event order
ℓ=tΔ−tD\ell=t_\Delta-t_D

Why compare the effective update

LoRA represents a trainable layer contribution with low-rank factors while keeping the base layer fixed. The study uses a rank-one release, so its effective update is a scaled outer product. Reciprocal changes to the two factors can leave their product unchanged. Inspecting a factor alone could therefore mistake a reparameterization for a changed operator.

The effective update comparison addresses that ambiguity. It does not establish that the matrix represents a self, but it can establish that the learned layer contribution actually changes. Directional measures are left undefined when a compared update has zero norm, rather than assigning a fabricated angle.

Effective rank-one update
Ut=s btat⊤U_t=s\,b_t a_t^\top
Equivalent factorization
at′=λtat,bt′=bt/λt(λt≠0)a'_t=\lambda_t a_t,\qquad b'_t=b_t/\lambda_t\quad(\lambda_t\ne0)

What the saved trajectory reports

The manuscript identifies 167 saved adapter checkpoints from one training run, with 792 gradient observations and 79 evaluation losses. The PCA sampling grid contains 158 checkpoints. The current artifact review verified all 45 supplement checksum entries and the three retained array grids; it independently recovered the raw gradient maximum at step 169 and the reported evaluation-loss reduction of about 63.69%.

Other results below are reported by the recovered manuscript and supplement. The raw upstream adapter tensors are not redistributed in this supplement and were not downloaded again by the current review. Their original pinned revision and acquisition receipts are retained in the sources.

ObservationReported location or valueInterpretation
First saved nonzero effective updateStep 2The first saved update differing from zero
Raw gradient maximumStep 169Maximum of 792 recorded gradient norms
Descriptive prefix splitAfter step 181A selected piecewise fit, not a declaration detector
Filtered local bend, threshold 0.002Step 190 at all three lagsEvent location under a stated amplitude rule
Unfiltered local bend, lags 5 and 10Step 725A different detector setting selects a different event
First two PCA components94.990% of sampled factor variationA geometric summary, not an experience measure

The detector is part of the result

A sharp directional bend can occur during a tiny movement. The source analysis therefore includes an amplitude eligibility filter, and the final paper reports all 18 combinations of lag and threshold. The output factor and effective matrix select the same location across those settings, but the location itself changes when the eligibility rule changes.

The effective matrix comparison is invariant to reciprocal factor rescaling. The inherited filter is based on factor amplitudes and is not invariant. An invariant downstream metric does not make the entire detection pipeline invariant. A future detector could use effective-operator displacement or the operator's action on specified inputs, but that would be a new analysis rule rather than a silent correction to the historical result.

Prediction and feedback need different tests

A declaration may report an existing state, predict a later change, or help cause that change by reentering the system. A timing association alone cannot distinguish those roles. The proposed experiment therefore separates the declaration detector from the change detector and intervenes on the feedback channel.

With model parameters held fixed, an experiment could retain declaration feedback, replace it with matched neutral content, interrupt it, or use a declaration from another matched instance. Context length, task evidence and computational budget should be controlled. Independent runs or held-out outcomes are needed to judge predictive value beyond earlier state and behavior. The original manuscript describes these as future experiments, not completed trials.

The conclusion supported by this dataset

The saved trajectory supports a specific computational conclusion: the effective learned operator changes, and different prespecified questions identify different moments within that change. The available data do not locate a declaration event, identify the content of a self representation, or establish the causal effect of declaration feedback.

A theory-based approach to machine-consciousness research requires a justified link between a proposed mechanism and observable indicators. The declaration hypothesis contributes a testable question about temporal order and recurrence. Completing that functional test would still leave the theoretical connection to subjective experience to be assessed explicitly.

Sources & provenance

Search equations, builds, manuscript text, and recovered sources.