CCF6 guide

Connectionist Cognitive Framework · version 6

Run the instrument. Inspect every claim.

This guide explains the NCL-only system that is implemented today, how to execute experiments from Docker or the command line, how to read the Laravel workbench, and how to extend the research without contaminating held-out evidence.

Open the workbench GitHub issues Start locally
20paired deterministic seeds
3matched arms per seed
13files in the complete artifact
Failedaccepted milestone verdict

Orientation

What CCF6 is

CCF6 is a minimal, inspectable scientific instrument for testing computational consequences of Neurocognitive Linguistics. It is not a product, a natural-language system, or a claim of biological equivalence. The implementation sequence through GitHub issue #12 is complete; there are currently no open roadmap tickets.

Experiment definition

JSON declares seeds, Populations, sparse topology, dynamics, learning, controls, and analysis.

Python runtime

Runs ordinary Columns, local Eligibility, frozen observers, matched controls, and replication.

Artifact + workbench

Writes durable evidence to disk; Laravel validates and renders it without recomputation.
The workbench is read-only. Experiments are launched through the Python CLI or the runtime HTTP endpoint. The UI discovers run directories under artifacts/ and renders what the runtime already wrote.

The big picture

How the whole system fits together

CCF6 has two different architectures that should not be confused: the software architecture that runs and displays experiments, and the scientific Network architecture inside each experimental arm. The diagrams below move from the outside inward, then back out from one seed to the final verdict.

1. Software architecture: declaration → runtime → evidence → UI

Nothing is authored in the workbench and no scientific number is calculated there. A JSON definition enters the Python runtime, the runtime constructs and runs the experiment, and a durable artifact becomes the only input to Laravel.

CCF6 software architecture An experiment definition reaches the Python runtime through the command line or HTTP. Runtime modules create an artifact directory. The validator and Laravel workbench read that artifact without rerunning. Experiment JSON question · seeds · topology dynamics · controls · analysis Human caller Python CLI or HTTP POST Python runtime · ccf6-runtime Dispatcher kind → runner Domain generate + validate Network tick · settle · learn stimulate · lesion Observers basins · webs · cardinals replication + verdict Artifact directory definition + manifest dataset + topology Presentations + learning activity + basins webs + cardinals metrics + aggregate summary 13 files Validator inventory checksums Laravel read-only workbench run directory name + summary returned to caller
Deep seam: callers invoke an experiment; they do not orchestrate individual Columns. The runtime owns numerical work, while the workbench owns only validation and presentation.
A

In plain English: the JSON file is the recipe, Python is the laboratory instrument, the artifact directory is the lab notebook, and Laravel is the glass display case. Changing the display cannot change the experiment's result.

2. Scientific topology: one connected Network of 55 ordinary Columns

The milestone Network contains seven Populations. Population names say where evidence comes from or the broad wiring role; they do not assign learned category content. Every Population uses the same Column mechanics.

Scientific Network topology Three visual property populations connect to visual association, then cross-domain association, phonological association, and auditory features. Every inter-population endpoint is reciprocal with independent directional weights. SENSORY EVIDENCE LATENT ASSOCIATION POPULATIONS SENSORY EVIDENCE visual-contour 4 Columns visual-surface 4 Columns visual-marking 4 Columns visual-association 12 latent visual conjunctions local inhibition radius 2 cross-domain association 16 visual ↔ phonological convergence possibilities phonological- association 12 latent ordered conjunctions auditory-feature 3 Columns fan-in 3 6 6 2 324 reciprocal endpoint pairs · 648 directional weights ascending and descending values + Eligibility are independent
reciprocal sparse projectioncross-domain routefixed local inhibition exists inside every Population
The arrows show possible routes, not stored meanings. Learning changes strengths on existing routes; it never creates a category node, redirects an endpoint, or writes Functional Web membership into the Network.

3. Inside one Column: signal propagation during one synchronous tick

Each tick is computed from an immutable copy of the previous tick. This prevents Population iteration order from changing the result. The three compartments are functional simplifications, not claims that one simulated object equals a literal anatomical minicolumn.

One Column with Input, Integration, and Output Sensory and ascending drive feed Input. Input, recurrent state, descending context, and inhibition feed Integration. A thresholded logistic response feeds Output, which broadcasts above cutoff. sensory drive only sensory Populations ascending Output weighted lower route COMPARTMENT 1 Input sensory + ascending drive clamp → leaky update COMPARTMENT 2 Integration Input + recurrent state + descending − inhibition COMPARTMENT 3 Output logistic response around θ then leaky update context + competition descending · recurrence · inhibition transmission cutoff below cutoff: no broadcast next Columns previous Output can return through connected routes Every t+1 value uses only state from t · rest is exactly 0 · all activity remains in [0,1]
Important timing detail: Input does not jump straight to Output in one calculation. It moves through leaky compartment updates over repeated synchronous ticks, while reciprocal context and local inhibition reshape the trajectory.

4. How Columns are linked

A projection is a sparse list of endpoint pairs, not a dense matrix. For each target Column, the declared fan_in selects source Columns without replacement. The same endpoints support two independent directions.

Sparse reciprocal Column links A target samples sparse source Columns. Every selected endpoint has independent ascending and descending weights and eligibility. Nearby Columns in one Population inhibit one another. Source Population one selected endpoint pair Target Population source Columns target Columns ascending: weight↑ + Eligibility↑ descending: weight↓ + Eligibility↓ After a confirmed update weights stay in [0,1] and normalize per destination, per projection unrelated source Populations never share one normalization pool local inhibition
Reciprocity means “both routes exist,” not “both routes have the same number.” Ascending recognition and descending reactivation can therefore learn differently while retaining the same endpoint topology.

5. What one acquisition Presentation does

A Presentation is the learning boundary. It resets once, contains several ordered Samples, and applies at most one outcome after the final Sample settles.

ResetInput, Integration, Output, and Eligibility become exactly zero. Durable state survives.
Visual SampleThree distributed properties drive contour, surface, and marking Populations until stable.
Segment 1Distributed auditory features enter. Existing visual state is not reset.
Segment 2Network settles again; activity and Eligibility continue from Sample 1.
Segment 3The final ordered auditory Sample settles. Failure blocks learning.
OutcomeCorrect pair: Success Signal 1.0. Mismatch: 0.0. No per-connection label is sent.
Adapt onceEligible weights and entrenchment may change; homeostatic thresholds update locally.

Temporary during the Presentation

Input, Integration, Output, and directional Eligibility persist between Samples. They reset before the next independent Presentation.

Durable across Presentations

Directional weights, thresholds, activity averages, entrenchment, contributor Presentation IDs, Recruitment evidence, and fixed topology survive reset.

Success-gated branch

With signal 1.0, local eligible weights can strengthen and successful participation contributes to entrenchment. With signal 0.0, co-activity causes no evidence-dependent weight change.

Independent homeostasis

Activity averages and thresholds adapt once per acquisition Presentation whether the pairing succeeds or not. This prevents the Success Signal from becoming a hidden threshold label.

6. Where the experimental data goes—and where it may not go

Each category has one prototype and 16 generated instances divided before the run. Development decisions use acquisition and basin-estimation evidence. Final held-out evidence is isolated until frozen evaluation.

Acquisition · 8 per category

Three epochs select acquisition instances. Correct and mismatched Presentations are balanced. Durable adaptation is enabled only here.

Basin estimation · 4 per category

Adaptation is frozen. These full paired Presentations fit centroids, pooled scales, reliable masks, distributions, and margins.

Final held-out · 4 per category

Never used to fit basins, choose masks, tune parameters, detect webs, or define margins. It tests the already-frozen apparatus.

7. Seeds: where reproducible variation enters

A seed is not a signal sent to a brain area or Population. It is an integer used by software randomizers before or around execution so the same declared run can be reproduced exactly.

How one seed controls reproducible variation A master seed determines generated domain streams, Network topology and initial state, and observer controls. The same initial Network is used for three matched arms. A separate bootstrap seed resamples the resulting seed-level effects. one seed 20260910 Domain generator SHA-derived category streams development + isolated held-out pairing order Network constructor thresholds · sparse endpoints independent ↑ and ↓ weights local topology is reproducible Observer controls shuffled labels · perturbations degree-matched coalitions reproducible control draws trained arm Success Signals enabled untrained arm adaptation frozen from start shuffled arm only category pairing rotates one seed row paired arm effects criteria + failures seed is one replicate × 20 bootstrap seed 10,000 resamples of 20 paired seed effects All three arms share data, splits, topology, initial directional weights, parameters, and seed wherever the control permits.
Replication replaces both the domain seed and Network seed for each seed row. The shuffled and mismatch conditions use declared rotations, while the bootstrap has its own declared seed. Worker count changes scheduling, not random identity.

8. What a complete experiment does

Experiment 011 is an orchestrator. It runs the full single-seed protocol independently for every declared seed, extracts one metrics row per seed, and only then performs inference.

GenerateValidate four categories, pseudowords, controls, and immutable splits.
ConstructBuild one matched initial Network and three arm conditions.
Acquire24 Presentations per arm: 3 epochs × 4 categories × correct/mismatch.
Freeze + fit16 basin-estimation and 16 held-out Presentations per arm.
Challenge20 cue Presentations + 24 ordered trajectory controls per arm.
ObserveDetect webs, classify cardinals, preserve non-executable interventions.
Aggregate20 seed rows → paired bootstrap → criteria → verdict → artifact.
100recorded Presentations per arm
300recorded Presentations per seed
6,000Presentation records across 20 seeds
1final conjunction of all criteria
Why the arms must stay paired If each arm had unrelated data or initial wiring, a difference could be caused by luck rather than learning. Within one seed, the trained, untrained, and shuffled arms differ only where the control requires; the metric is calculated from their within-seed difference.

9. Observer ladder: measurements never become hidden Network state

Observer analysis ladder Frozen activity is fitted into Target Basins, completion and trajectory evaluations, Functional Web evidence, Cardinal classification, seed metrics, and an aggregate verdict. No classification feeds back into learning. Frozen activity basin + held-out no durable updates Target Basins centroid · scale · mask margin + distances Completion partial cue movement ordered reactivation Functional Web 3 causal evidence gates controls + FDR Cardinal routes · stimulation Lesion · redundancy Seed metrics paired effects + failures Verdict pass only if all criteria pass blocked feedback: observer labels are never written into Network mechanics or learning
A high-activation Column is not automatically a Functional Web member; a Recruited Column is not automatically a Cardinal Candidate. Each observer adds stricter evidence while preserving failures and raw control distributions.

10. Where the implementation lives

domain.py
Deterministic synthetic categories, instances, pseudowords, controls, pairings, and scientific constraint validation.
functional_network.py
The deep Network module: construction, synchronous ticks, settling, local learning, Recruitment evidence, stimulation, Lesion, and snapshots.
functional_presentation.py
Stateless sensory mappings and the visual-first ordered Sample protocol.
functional_acquisition.py
Focused success-gated learning experiment and learning artifact evidence.
target_basins.py
Frozen basin fitting, primary standardized distance, cosine diagnostics, margins, and correct-basin evaluation.
completion_evaluation.py
Order-preserving trajectory sampling and comparison against lexical controls.
functional_webs.py
Offline reliability, causal completion, reciprocal connectivity controls, FDR correction, membership, and overlap.
cardinals.py
Matched control selection and observer-only Cardinal Candidate/Cardinal Node gates.
controlled_basins.py
Single-seed orchestration across trained, untrained, and shuffled arms through frozen causal observations.
replication.py
Parallel seed execution, seed-level metrics, deterministic paired bootstrap, criteria, failures, and verdict.
experiment.py
Experiment-kind dispatch, artifact identity, writing, checksums, and final run directory.
artifacts.py
Independent validation of every normative file without rerunning the experiment.
serve.py
Synchronous HTTP adapter exposing /health and /run.
WorkbenchController.php
Artifact validation and selection of the read-only Laravel evidence view.

Accepted baseline Column deep dive

The original simplified unit, without hand-waving

The accepted milestone remains the reproducible baseline: its Column is deliberately smaller than a concept, word, or Functional Web and reduces local circuitry to three activity values. CCF6 now also carries the explicit laminar implementation described in the next section. Keeping both lets later abstractions be compared against evidence instead of silently replacing the baseline.

“Internal nodes” means three compartments, not three miniature Columns. Input, Integration, and Output are three state values for each Column. They represent stages of a simplified local circuit. They do not have their own identities, semantic labels, connection tables, or independently scheduled execution.

1. Exactly what one Column owns

StateMeaningReset between Presentations?
Input u ∈ [0,1]Leaky integration of sensory drive and ascending broadcasts.Yes → exactly 0
Integration v ∈ [0,1]Leaky combination of prior Input, its own recurrent state, descending context, and local inhibition.Yes → exactly 0
Output o ∈ [0,1]Leaky graded response around the Column's threshold; the only compartment broadcast externally.Yes → exactly 0
threshold θLocal response threshold, initialized from a declared range and adjusted by homeostasis during acquisition.No
activity_averageMoving average used only by the local homeostatic threshold rule.No
entrenchmentAccumulated confirmed participation used with contributor count to classify Recruitment.No
contributing_presentationsDistinct successful Presentation IDs that contributed to entrenchment.No

Connections own

Endpoint indices, one ascending weight, one descending weight, one ascending Eligibility trace, one descending Eligibility trace, fan-in, normalization norm, and initialization provenance.

The Column does not own

A category, pseudoword, semantic feature, Functional Web membership, Cardinal Candidate status, Cardinal Node status, symbolic rule, target answer, or construction-specific program.

2. Every route into and out of one focal Column

Complete signal routes around one focal Column Sensory and ascending signals enter Input. Previous Input, recurrent Integration, descending signals, and local inhibition enter Integration. Integration drives Output through a threshold. Output broadcasts upward and downward on different external routes. ONE FOCAL COLUMN i INTERNAL STATE Input uᵢ sensory + ascending INTERNAL STATE Integration vᵢ Input + recurrence + context − local inhibitory drive INTERNAL STATE Output oᵢ graded response + broadcast sensory adapter only when this Population is driven lower/source Columns broadcast Output through w↑ higher/target Columns broadcast Output through w↓ nearby Columns old Output × fixed inhibitory weight is subtracted connected Columns receive focal Output next tick 1 2 3 4 5 6 7 8 sensory drive ascending excitation prior Input descending context recurrent vᵢ(t) thresholded response broadcast if oᵢ ≥ cutoff Numbers identify simultaneous drive contributions—not a serial instruction program.
Routes 1–2 contribute to Input; routes 3–5 and inhibitory route 8 contribute to Integration; route 6 produces Output; route 7 broadcasts it. Inhibition is an external connection from neighboring Columns even though its effect is integrated locally.

3. The exact tick algorithm

A tick is one synchronous numerical update. “Synchronous” is the essential protection: no Column can see another Column's newly calculated value until the next tick.

1Snapshot tick tCopy every Population's Input, Integration, and Output. These immutable copies are the only activity read during the tick.
2Build external drivesStart Input drives with sensory vectors. Add weighted ascending broadcasts. Separately add weighted descending broadcasts.
3Update edge tracesDirectional Eligibility uses old endpoint Output and old destination Integration. It does not use newly computed activity.
4Calculate all next statesFor every Column, calculate next Input, Integration, and Output from old state and prepared drives. Do not mutate yet.
5Clamp and commitApply active Lesion or stimulation clamps to next Output, then replace all Populations' state together.
A. Input drive and updatedriveᵤ = sensory + Σ(w↑ × broadcast_source)u(t+1) = leaky(u(t), clamp01(driveᵤ), τ_input)

Sensory activity and lower-level broadcasts target Input. Leaky updating means Input approaches its target over time instead of jumping there.

B. Integration drive and updatedriveᵥ = u(t) + gain×v(t) + Σ(w↓×broadcast_target) − inhibitionv(t+1) = leaky(v(t), clamp01(driveᵥ), τ_integration)

Integration sees prior Input, its own prior recurrent state, top-down context, and nearby competitors. It does not read u(t+1).

C. Output response and updateresponse = sigmoid((v(t) − θ) / temperature)o(t+1) = leaky(o(t), response, τ_output)

Output is graded, not Boolean. A lower temperature makes the threshold transition sharper; a higher threshold requires more Integration.

D. Broadcastbroadcast = o if o ≥ transmission_cutoff else 0

The cutoff controls what leaves the Column. It does not erase or quantize the stored Output value, which remains observable and graded.

E. Ascending Eligibilitye↑(t+1) = clamp01(decay×e↑(t) + o_source(t)×v_target(t))

The lower/source endpoint's raw Output is paired with the higher/target endpoint's Integration.

F. Descending Eligibilitye↓(t+1) = clamp01(decay×e↓(t) + o_target(t)×v_source(t))

The reverse direction has its own local trace. Eligibility uses raw Output, not transmission-cutoff broadcast.

Numerical values in the current replicated milestone

MechanismDeclared valuePractical effect
Tick intervaldt = 0.1Used in every leaky update as α = 1 − exp(−dt/τ).
Input leakτ_input = 0.3, α ≈ 0.283Input moves about 28.3% of the remaining distance toward its drive each tick.
Integration leakτ_integration = 0.4, α ≈ 0.221Integration moves about 22.1% toward its combined drive each tick.
Output leakτ_output = 0.5, α ≈ 0.181Output is the slowest compartment, moving about 18.1% toward its sigmoid response.
Internal recurrencerecurrent_gain = 0.6Prior Integration contributes 60% of its value to the next Integration target before clamping.
Threshold responsetemperature = 0.1Controls the steepness of the graded sigmoid around each local threshold.
Initial thresholdsuniform [0.35, 0.55]Columns begin heterogeneous; homeostasis clamps later thresholds to [0.2, 0.8].
Transmissioncutoff = 0.05Output below 0.05 contributes zero to ascending and descending drives.
Settlingε = 0.0001, 3 stable ticks, maximum 300Every Output must change by less than ε for three consecutive ticks; otherwise settling explicitly fails.
Eligibilitydecay multiplier = 0.1Only 10% of the previous trace remains before current co-activity is added; the result is clamped to [0,1].
Weight learninglearning_rate = 0.05At signal 1.0 and Eligibility 1.0, an edge closes 5% of its remaining distance toward 1 before normalization; weaker traces produce smaller changes.
Initial projection weightsuniform [0.1, 0.3], incoming norm 0.4Each direction is sampled independently, then incoming values are normalized per destination and projection.
Inhibitionstrength 0.1; radius 1 sensory, radius 2 associationThe fixed total strength is distributed across each Column's available indexed neighbors.
Homeostasisaverage rate 0.2, threshold rate 0.01, target 0.4Highly active Columns slowly raise their thresholds; underactive Columns slowly lower them.
Recruitmententrenchment ≥ 2.0 and ≥ 3 distinct PresentationsBoth accumulated confirmed participation and recurrence across Presentation identities are required.
t

In plain English: every Column first remembers the old photograph of the whole Network. All Columns then work out their next state from that same photograph. Only when every calculation is finished does the Network replace the photograph.

4. Why propagation takes several ticks

The equations create causal delay. A new sensory contribution first changes Input; a later tick lets that changed Input affect Integration; another later tick lets changed Integration affect Output; only then can that Output drive connected Columns.

Tick-by-tick causal propagation latency A sensory change affects Input at tick one, Integration at tick two, Output at tick three, and another Column's Input at tick four. causal contribution t = 0 t = 1 t = 2 t = 3 t = 4 reset state u = 0v = 0o = 0 sensory arrives Input responds u carries sensoryv used old uo used old v Integration responds v now sees u(t=1)recurrence/contextalso combine here Output responds o now sees v(t=2)threshold + leakybroadcast may open Next Column receives broadcastinto its Input orIntegration route Settling repeats ticks until the maximum Output change stays below ε for the required consecutive stable ticks. This diagram tracks the new sensory-caused contribution; the logistic response can still produce small subthreshold Output from other prior state.
During one Sample, the same sensory vector remains presented on every settling tick. When the next Sample begins, the sensory vector changes but Column activity and Eligibility continue from the previous settled state.

5. Bidirectional flow is two independent mechanisms

Independent ascending and descending connection state A source Column's Output drives a target Column's Input through an ascending weight. The target Output drives source Integration through a separate descending weight. Both directions have independent Eligibility and normalization. DECLARED SOURCE / LOWER POPULATION Integration A.v Output A.o DECLARED TARGET / HIGHER POPULATION Input B.u Output B.o ascending recognition route A.o broadcast × w↑ → B Input descending reactivation/context route B.o broadcast × w↓ → A Integration ascending edge state w↑ · e↑ descending edge state w↓ · e↓ same endpoint pair ≠ tied values each direction learns and normalizes from its own destination
The asymmetry is intentional. Bottom-up recognition enters a target's Input; top-down reactivation enters a source's Integration as context. Tying the two weights would force recognition and reactivation to remain numerically symmetric.

6. Inhibitory competition inside one Population

Competition is fixed, local, subtractive, and synchronous. It is not a winner-take-all instruction and it is not learned during this milestone.

Local inhibitory neighborhood With radius two, a focal Column receives inhibition from up to two neighbors on each side. Their previous Outputs are weighted, summed, and subtracted from focal Integration. Example Population with inhibition radius = 2 0 1 2 3 4 5 6 outside radius outside radius inhibition₃ = Σ(local weight × neighbor old Output) Integration drive₃ subtracts this sum before clamp and leaky update
For each target Column, total declared inhibitory strength is divided among its available neighbors. Edge Columns have fewer neighbors; indices describe local one-dimensional neighborhoods within each Population. Raw old Output—not newly calculated Output—is used.

7. Learning happens after settling, not inside the tick's activity equations

Eligibility, Success Signal, weight learning, entrenchment, homeostasis, and freezing Ticks build local Eligibility. A Presentation must settle. A diffuse success signal can confirm weight and entrenchment updates. Homeostasis runs independently. Frozen evaluation blocks every durable update. settling ticks co-active endpoints build temporary e↑ and e↓ settled? stable_ticks reached before max_ticks failure no learning allowed Success Signal correct = 1.0 mismatch = 0.0 evidence-dependent weights Δw = rate × signal × Eligibility × (1 − w) then normalize incoming weights per projection signal 0.0 → no evidence-dependent change entrenchment + Recruitment evidence confirmed = signal × max incoming Eligibility count each Presentation ID at most once threshold + minimum distinct Presentations independent homeostasis average ← moving average of settled Output θ ← clamp(θ + rate × (average − target)) runs for both signal 1.0 and 0.0 frozen adaptation basin estimation + final evaluation weights · thresholds · averages entrenchment + contributors unchanged no yes signal-independent freeze blocks all durable branches Eligibility itself remains temporary and resets at the next Presentation boundary.
Eligibility is local credit evidence, not a weight update. The diffuse Success Signal says only whether the settled Presentation succeeded. It does not say which category or connection should change.

8. State lifecycle across ticks, Samples, and Presentations

EventActivity u/v/oEligibilityWeightsThresholds/averagesEntrenchment/contributors
Next tickLeaky synchronous updateDecay + local co-activityUnchangedUnchangedUnchanged
Next Sample, same PresentationPreserved; new sensory drivePreservedUnchangedUnchangedUnchanged
Successful settled outcomePreserved for measurementRead as local evidenceMay update if signal > 0Update once in acquisitionMay update if signal > 0
Next Presentation resetExactly zeroExactly zeroPreservedPreservedPreserved
Frozen evaluationRuns and settles normallyMay evolve temporarilyFrozenFrozenFrozen
Lesion contextSelected Output clamped 0; Input and Integration remain observableTemporary onlyFrozen during observer testFrozenFrozen
Stimulation contextSelected Output clamped to declared graded valueTemporary onlyFrozen during observer testFrozenFrozen

9. What this mechanism was expected to do—and what it actually did

Expected mechanism

Selective reverberation

Repeated correct co-activation was expected to strengthen a selective set of reciprocal paths. Partial visual or pseudoword evidence would then enter through different routes, settle toward the same category basin, and reactivate missing ordered activity.

Observed milestone

Diffuse saturation

Activity became near-global, most Eligibility saturated, and all 55 Columns became Recruited in trained arms. Weight changes were not selective enough to preserve ordered conjunctions or outperform matched controls.

The Column equations still conformed

The negative result did not come from skipping the declared mechanics. Reset, synchronous ticks, reciprocal independence, local learning, freezing, controls, observers, and failure accounting all behaved as specified.

The learning hypothesis failed

The implemented local mechanism was insufficient for the target behavior under the declared apparatus. The next scientific step is to alter a preregistered local temporal mechanism—not to encode categories or expected answers inside Columns.

Detailed experimental architecture · runtime 0.3.0

Explicit laminar Columns and cortical pathways

Experiment 012 adds a second implementation alongside the accepted 55-Column baseline. It is still a normalized population-rate simulation—not an individual-neuron or conductance model—but cortical layers, pyramidal populations, apical compartments, interneuron classes, hierarchy, and pathway families are now addressable structures whose activity and flux can be recorded separately.

10composite cortical Columns
126named neural and external populations
418explicit directed pathways
20independent process simulations

The simulated cortical hierarchy

Five lower, three middle, and two higher laminar cortical Columns Five lower Columns ascend to three middle Columns, which ascend to two higher Columns. Higher columns return contextual projections to apical tufts and layer six. Thalamic input enters the lower level. HIGHER LEVEL H112 named populations H212 named populations MIDDLE LEVEL M1laminar Column M2laminar Column M3laminar Column LOWER LEVEL Asource aliases A4… Bsource aliases B4… Claminar Column Dlaminar Column Elaminar Column Thalamus Motor sink ascending L2/3 + L5 residual routes · fan-out 2 descending L2/3/L5 context → tufts and L6
Every hierarchy level uses the same 12-population laminar template. Adjacent Columns also recruit one another's PV and SOM populations for lateral competition. The diagram simplifies the 418 stored pathway records; topology.json contains every endpoint and initialized strength.

One composite Column

Explicit populations and pathways inside one laminar Column Layer four pyramidal and PV populations receive input. Pyramidal flow reaches layers two-three, five, and six. PV inhibits somata, SOM inhibits apical tufts, and VIP inhibits SOM to disinhibit top-down context. L1 · APICAL INTEGRATION L2/3 · CORTICOCORTICAL INTEGRATION L4 · PRINCIPAL INPUT L5 · DEEP OUTPUT L6 · CORTICOTHALAMIC FEEDBACK L23Tuft L5Tuft L23Pyrintegration + horizontal PV23 SOM23dendrite gate VIPdisinhibit L4Pyrfeedforward input PV4 L5Pyr PV5 SOM5 L6Pyr Thalamussensory + readiness Higher cortexcontext/prediction State driversattention/reward Motor sinksubcortical output Input Topdown VIP ⊣ SOM
Each box or circle is a separately updated population with its own recorded activity. Arrowheads are excitatory or modulatory; bars are inhibitory. The complete implementation also includes PV→SOM/VIP, SOM→PV/VIP, recurrent L5→L2/3, lateral neighbor recruitment, and inter-level pathways.

One synchronous tick in the laminar model

1Photograph all 126 activitiesEvery calculation reads the same immutable tick-t state. Iteration order cannot create instantaneous propagation.
2Measure 418 pathway fluxesSource broadcast × effective pathway strength. Excitatory, inhibitory, and modulatory contributions remain separately recorded.
3Accumulate local Hebbian tracesPlastic excitatory and modulatory pathways combine decayed Eligibility with pre- and postsynaptic co-activity.
4Compute population targetsExternal + excitatory + scaled modulation − inhibition, bounded to [0,1], then passed through the population threshold.
5Leaky update and commit togetherPV, SOM, VIP, tuft, pyramidal, relay, and state populations use declared class-specific time constants.
Explicit pathway fluxfluxₑ(t) = broadcast(source,t) × effective_strengthₑ

The artifact records every edge's signed flux at every tick. Inhibitory flux is negative; the visualizer does not infer it from activity.

Population targetnet = clamp01(external + Σexc + scale×Σmod − Σinh)target = max(0, (net − threshold)/(1 − threshold))

Discrete circuitry determines which terms reach a population. Arithmetic only updates the named population once those physical routes are known.

Seeded individualityinitial_strength = declared_strength × U(0.95, 1.05)

The seed creates small reproducible pathway heterogeneity. The same seed reconstructs identical topology, initialized strengths, activity, controls, and artifacts.

Zero restreset: every population activity = 0; every Eligibility = 0

No spontaneous floor is imported from the illustrative HTML. Durable pathway factors and structural contacts survive activity reset.

Hebbian strengthening is decomposed into Lamb's three physical mechanisms

A

Presynaptic release facilitation

release_facilitation increases the effective contribution of a confirmed co-active source, bounded by a declared maximum. It represents easier or greater neurotransmitter release.

B

Postsynaptic receptiveness

postsynaptic_receptiveness independently increases how strongly the target responds to the same route, also bounded by a declared maximum.

C

Structural growth

Confirmed structural credit can add discrete terminal_boutons, axonal_branches, and dendritic_spines. Effective structural strength is limited by the least-developed side of the contact.

∑

Effective pathway strength

Declared base strength × release facilitation × postsynaptic receptiveness × structural factor. Every term, bound, Eligibility value, and contributor remains inspectable.

STDP is deliberately postponed. Experiment 012 uses rate-coded Hebbian co-activity plus a diffuse Success Signal. It does not infer millisecond spike order, LTP/LTD windows, or conduction delays that the source documents describe only qualitatively.

Experiment 012 process inventory

The definition runs every process independently from zero rest. Eighteen processes include a route-disabled causal control; the artifact retains full 126-population activity trajectories and 418-pathway signed-flux trajectories rather than generating decorative animation.

Pathway families

All circuits, thalamocortical Input, intracolumnar Flow, Ascend, Topdown, Lateral, PV, SOM, and VIP.

Integrated processes

Sensory integration, predictive-coding loop, winner-takes-most, perisomatic gain, and behavioral-state ensemble.

State processes

Attention, arousal, novelty, reward, and sustained pyramidal activity with a finite input pulse.

Learning process

Hebbian strengthening confirms local co-activity and records changes in release, receptiveness, boutons, branches, spines, and effective strength. STDP remains false.

docker compose up -d --build --force-recreate runtime
curl http://localhost:8933/health

python -m ccf6 experiments/012-detailed-cortical-circuit.json artifacts

Artifact contract: ncl-cortical-circuit-v1. Principal evidence is in topology.json, topology.npz, activity.json, and activity.npz.

Implementation record

What has been built

Issues #2–#12 form one progressive implementation. Each later experiment reuses the same declared domain and Network mechanics while adding an observer or stronger experimental control.

02

Synthetic lexical grounding

Four overlapping visual categories, reusable distributed auditory features, ordered three-segment pseudowords, balanced mismatches, deterministic generation, and isolated acquisition/basin/held-out splits.

03

Ordinary zero-rest Columns

Synchronous Input, Integration, and Output dynamics; exact zero rest; graded thresholds; sparse reciprocal endpoints; independent directional weights and Eligibility; explicit settling failures.

04

Coordinated Presentations

Visual activity first, then ordered auditory Samples. Activity persists within a Presentation and resets between Presentations. Reversed, permuted, repeated, and competing controls remain distinct.

05

Success-gated local learning

Eligibility accumulates from endpoint co-activity. Durable directional weights change only after a diffuse positive Success Signal, with local incoming normalization.

06

Recruitment and homeostasis

Entrenchment requires distinct successful Presentations. Threshold averages adapt locally and independently of success. Durable adaptation freezes for evaluation.

07

Matched Target Basins

Trained, identical untrained, and shuffled-pairing arms share initial conditions. Basin centroids, reliable masks, scales, distributions, and margins are fit without final held-out leakage.

08

Completion and reactivation

Full, visual-only, pseudoword-only, partial visual, and atypical cues are scored against frozen basins. Ordered trajectories are compared with every required sequence control.

09

Causal Functional Web observer

Membership requires reliability, completion perturbation, and reciprocal connectivity above matched controls with false-discovery-rate correction. Runtime activity never stores membership.

10

Cardinal causal classification

Observer-only Candidate and Cardinal Node gates, median-Output stimulation, Output Lesions preserving incoming observability, redundancy measures, and matched controls.

11

Replicated milestone

Twenty paired seeds, three arms per seed, 10,000 deterministic paired bootstrap resamples, seed-level effects, explicit failures, non-inferiority analysis, and one criterion-by-criterion verdict.

12

Complete artifact contract

The accepted ncl-functional-web-v1 contract is the default. Every required file is checksum-protected and independently validatable; superseded prototype code and compatibility paths are retired.

012

Explicit laminar cortical circuit

A separate ncl-cortical-circuit-v1 apparatus expands ten composite Columns into named pyramidal, tuft, PV, SOM, and VIP populations linked by 418 inspectable pathways. Twenty focused simulations retain activity, flux, controls, and decomposed Hebbian strengthening.

Scientific status

The implementation is complete; the hypothesis failed

Milestone failed scientifically; the software completed correctly. The accepted experiment completed and preserved a negative scientific verdict. That is a valid result of the instrument.
CriterionAccepted resultInterpretation
Completion improvementFailedMedian paired effect 0.0; 95% interval [0.0, 0.0].
Cross-route reactivationFailedMedian paired effect 0.0; no positive interval.
Correct pairing localizationFailedTrained behavior did not reliably exceed shuffled pairings.
Functional Web overlapFailedNo causally qualified Functional Web was detected across the milestone.
Cardinal interventionsNot executableNo causal Functional Web meant no valid Cardinal Candidate could be promoted.
Settling6 failuresFailures occurred across three seeds and were counted, never discarded.
Held-out separation non-inferiorityPassedThe 95% lower bound remained above the declared −5% margin.

The mechanism-level diagnosis is diffuse near-global activation: Eligibility saturates broadly, Recruitment becomes indiscriminate, and the current local rule does not preserve ordered conjunctions. The artifacts preserve that failure as the baseline for the next mechanism.

Local operation

Quick start with Docker Compose

The default ports are read from .env: workbench 8002, runtime API 8933, and Redis 6380. Internally, Laravel reaches the runtime at runtime:8931.

Prepare the application

From the repository root, create the environment, install PHP dependencies, initialize SQLite, and generate the Laravel key.

cp .env.example .env
composer install
touch database/database.sqlite
docker compose run --rm --no-deps php php artisan key:generate
docker compose run --rm --no-deps php php artisan migrate

Build and start the services

docker compose up -d --build
docker compose ps

The stack includes Caddy, PHP-FPM, the Python runtime, queue and schedule workers, and Redis.

Verify both interfaces

curl http://localhost:8933/health
open http://localhost:8002

On Linux, replace open with xdg-open, or enter the URL manually.

Run a fast experiment first

curl -X POST http://localhost:8933/run \
  -H 'Content-Type: application/json' \
  --data-binary @experiments/002-synthetic-lexical-grounding.json

Reload the workbench. A new run appears automatically because the runtime and Laravel share artifacts/.

Execution paths

Three ways to run an experiment

1. Runtime HTTP API

Best when the Docker stack is already running. POST /run is synchronous: the response arrives only after the artifact is complete.

curl -X POST http://localhost:8933/run \
  -H 'Content-Type: application/json' \
  --data-binary @experiments/008-completion-reactivation.json

The JSON response includes run, artifact, and summary. Use GET /health to see the runtime version and supported experiment kinds.

2. Python CLI on the host

Best for development and logs. The command prints the run directory and human-scale summary.

PYTHONPATH=ccf6-runtime/src python3 -m ccf6 \
  experiments/008-completion-reactivation.json artifacts

The host Python environment needs the runtime dependencies from ccf6-runtime/pyproject.toml, principally NumPy.

3. CLI inside the runtime container

Useful when the host has no suitable Python environment.

docker compose exec runtime python -m ccf6 \
  experiments/008-completion-reactivation.json artifacts

Validate without rerunning

The complete replicated artifact can be audited independently. Replace the directory with the run printed by the CLI or shown in the workbench.

PYTHONPATH=ccf6-runtime/src python3 -m ccf6 --validate \
  artifacts/011-<timestamp>-<digest>
The replicated milestone is intentionally substantial. Experiment 011 runs 20 seeds × 3 matched arms and stages thousands of Presentation records. Use experiments 002–010 for focused development before launching the complete run.

Experiment catalogue

Choose the smallest experiment that answers your question

DefinitionKindUse it to inspect
002-synthetic-lexical-grounding.jsonsynthetic_lexical_groundingGenerated categories, splits, pseudowords, pairings, and constraint checks.
003-zero-rest-network.jsonzero_rest_networkColumn equations, topology, reciprocal weights, activity, and settling.
004-coordinated-presentation.jsoncoordinated_presentationVisual-first Sample order, persistence, reset, and sequence controls.
005-success-gated-learning.jsonsuccess_gated_learningEligibility and successful versus unsuccessful directional weight changes.
006-recruitment-homeostasis.jsonrecruitment_homeostasisDistinct-Presentation Recruitment, thresholds, entrenchment, and freezing.
007-matched-target-basins.jsonmatched_target_basinsMatched arms, frozen scales, masks, centroids, margins, and held-out scoring.
008-completion-reactivation.jsoncompletion_reactivationPartial cues, Entry Routes, basin movement, and ordered phonological trajectories.
009-functional-web-detection.jsonfunctional_web_detectionReliability, causal perturbation, connectivity controls, FDR, and overlap.
010-cardinal-classification.jsoncardinal_classificationCandidate gates, stimulation, Lesion, redundancy, matching, and failures.
011-replicated-milestone.jsonreplicated_milestoneThe canonical 20-seed experiment, bootstrap inference, and final verdict.
012-detailed-cortical-circuit.jsoncortical_process_suiteTen laminar Columns, 126 named populations, 418 pathways, 20 process trajectories, causal controls, and decomposed Hebbian strengthening.

User interface

How to use the Laravel workbench

Runs index · /

Lists every artifact directory newest first, including experiment number, kind, status, duration, seed count, and digest. Select the experiment name to open its evidence.

Run view · /runs/{run}

Chooses the correct evidence view from the artifact manifest. The replicated view shows the complete contract, criterion verdicts, effect intervals, every seed, and failures.

Integrity behavior

For milestone artifacts, the workbench verifies the exact file inventory and SHA-256 checksums. Missing, malformed, unsupported, or modified artifacts are reported instead of interpreted through the current architecture.

What each focused view emphasizes

Experiment rangeWorkbench evidence
002Domain constraints, category instances, pseudowords, and balanced pairings.
003Actual connectivity, Input/Integration/Output activity, and settling status.
004Presentation order, trajectories, durations, continuity, and failures.
005–006Success Signals, Eligibility, weights, Recruitment, threshold history, and frozen evaluation.
007–010Matched arms, Target Basins, completion, reactivation, Functional Web and cardinal evidence.
011Complete artifact inventory, checksums, seed audit, bootstrap effects, criteria, failures, and verdict.
012Interactive tick slider over actual neural-population activity and signed pathway flux, route filtering, process controls, all explicit edges, and separate release/receptiveness/structural learning evidence.

Durable evidence

The complete artifact contract

A canonical replicated run is one directory under artifacts/. JSON is for definitions and observer evidence, JSON Lines for Presentation records, and compressed NumPy archives for lossless numerical arrays.

FilePurpose
definition.jsonExact experiment definition supplied to the runtime.
manifest.jsonContract, software version, identity digest, timing, status, seed/arm inventory, ordered files, and checksums.
dataset.jsonGenerated domain, immutable split membership, constraints, and pairings for every seed.
topology.npzPopulation labels, thresholds, directed endpoints, directional initial weights, and inhibition topology.
presentations.jsonlOne auditable Presentation per line with seed, arm, condition, Samples, success, durations, and settling status.
learning.npzEligibility, pre/post directional weights, thresholds, entrenchment, contributors, and Recruitment.
activity.npzInitial/settled activity and required ordered phonological trajectories.
basins.jsonFrozen centroids, pooled scales, reliable masks, margins, and distance distributions.
webs.jsonRaw web detector scores, matched controls, corrected values, membership, and overlap.
cardinals.jsonCandidate gates, matching, stimulation, Lesion, redundancy, classifications, and failures.
metrics.jsonEvery ordered seed row and paired effect value; Presentations remain nested observations.
aggregate.jsonBootstrap intervals, direction counts, failure counts, acceptance criteria, and verdict.
summary.jsonCompact human-scale replication status and verdict used by the workbench.

Artifact identity

The digest changes when the definition, software version, generated dataset, or topology changes. Checksums detect any later file modification.

Database boundary

Numerical results never belong in SQLite. Artifacts are the source of truth; Laravel only reads them. The database is reserved for a catalogue if needed.

Safe experimentation

How to create a new declared run

Copy the nearest experiment

Start from the smallest definition with the behavior you need. Give it a new number, name, question, and—only if runtime dispatch changes—a supported kind.

Declare every result-affecting value

Seeds, topology, fan-in, initialization, dynamics, settling, learning, controls, observer thresholds, replication workers, bootstrap count, and non-inferiority margin belong in the definition. Unknown or malformed declarations should fail rather than silently default.

Protect the evidence boundary

Use acquisition and basin-estimation data to develop mechanisms and freeze observer definitions. Never select parameters by looking at final held-out performance. Preserve trained, identical untrained, and shuffled-pairing arms.

Run focused, then replicated

First verify mechanics and artifacts with one seed. Once the mechanism and analysis are fixed, execute at least 20 paired seeds and aggregate seed-level effects—not Presentations.

Keep negative results

Do not discard settling failures, seeds without Candidates, or hypotheses that fail. Record them in artifacts and let the workbench state the result plainly.

Development checks

Tests and verification

Python runtime

PYTHONPATH=ccf6-runtime/src python3 -m pytest ccf6-runtime/tests -q
python3 -m compileall -q ccf6-runtime/src ccf6-runtime/tests

Laravel workbench

php artisan test --compact
vendor/bin/pint --dirty --format agent

Prefer tests at the public scientific seams: declared experiment → artifact, normative Network behavior, frozen observer output, and artifact → rendered workbench. A test should catch a broken premise, not merely pin incidental implementation.

Operations

Troubleshooting

The workbench shows no runs
Run an experiment first and verify both services use the same artifact directory. Docker uses /www/artifacts in both containers. On the host, the default is the repository's artifacts/. Reload http://localhost:8002 after the run completes.
A run is “unsupported or malformed”
Read the message on the page. The manifest may use a retired contract, omit a required file, contain malformed JSON, or have a checksum mismatch. Do not edit a completed artifact to make it render; rerun its recorded definition with the current software when comparison is scientifically valid.
The runtime reports an unknown current experiment kind
If /health reports version 0.1.0 or lists only the retired colour_selectivity_baseline, the runtime container predates the NCL Functional Web implementation. Rebuild and recreate it with docker compose up -d --build --force-recreate runtime, then verify curl http://localhost:8933/health reports version 0.3.0 and the current experiment kinds.
The runtime health endpoint does not respond
Run docker compose ps and docker compose logs runtime. Confirm FORWARD_RUNTIME_PORT=8933 is free. Rebuild with docker compose up -d --build runtime after changing the image or package metadata.
The UI does not respond
Inspect docker compose logs caddy php. Confirm FORWARD_PHP_PORT=8002 and that Composer dependencies exist in vendor/. The public URL is controlled by APP_URL.
The runtime returns HTTP 500
The response contains a traceback because a failed run must be diagnosable. Common causes are invalid experiment declarations, settling failures in phases that require success, artifact permissions, or insufficient resources. Keep the definition and failure evidence.
Artifacts are owned by root or cannot be written
Set WWWUSER and WWWGROUP in .env to your host user and group IDs, then rebuild the services. The runtime container deliberately runs as those IDs.
The complete run is slow
Experiment 011 executes substantial numerical work. Its replication.workers value is declared in the experiment. Change it only as part of a new definition; the changed definition must produce a new identity. Use focused experiments while iterating.
Frontend changes are not visible
The current workbench views mostly use inline styles and do not require Vite. If bundled assets are changed later, run npm install and npm run build, or keep npm run dev active.

Forward path

Recommended next steps

Scientific

Decide the next local temporal mechanism

The first milestone localized a failure: broad co-activity saturates Eligibility and loses ordered conjunctions. The next proposal should introduce an NCL-compatible temporal distinction—such as sequence-local Eligibility, a declared WAIT-like recurrent configuration, or another local mechanism—without installing symbolic order or semantic labels.

Method

Predeclare development and evaluation

Write a new issue/specification before changing mechanics. Choose parameters using mechanics and development evidence only, freeze the decision, then rerun the same held-out cues, matched arms, web controls, cardinal interventions, and 20-seed inference.

Comparison

Treat the failed artifact as the baseline

Compare a new mechanism against the accepted run on saturation, Recruitment selectivity, completion, ordered reactivation, pairing localization, web overlap, cardinal causality, separation, and failures. Do not overwrite or reinterpret the baseline.

Usability

Add run submission only if needed

The current workbench intentionally reads artifacts and does not launch experiments. A future UI could submit an existing declared definition to the synchronous runtime endpoint while keeping experiment authoring and numerical computation out of Laravel.

Project boundary CCF6 remains a permanent minimal reference instrument developed independently. Do not consult or import CCF7 designs when choosing the next mechanism.

Domain and experimental language

Extensive glossary

These definitions combine the canonical NCL vocabulary in CONTEXT.md with the measurement, control, inference, and artifact terms used by the implemented experiments. Capitalized domain terms retain their project-specific meanings.

116 terms

NCL network organization

The entities and observer classifications used to describe the connected cognitive system.

Network
The complete connected cognitive system in which local functions arise from connectivity and activity; not a symbolic processor.
Column
The smallest addressable processing population. It stores no symbol or concept; its function comes from connectivity and activation history.
Population
A group of ordinary Columns receiving a related class of evidence and participating in one or more distributed functions.
Modality
The sensory or motor channel through which activity enters or leaves a Population, such as visual or auditory; not a cognitive function.
Functional Web
A distributed, overlapping coalition demonstrated by reliable co-activation, effective connectivity, completion from independent Entry Routes, and causal evidence. It is an observer result, not a runtime container.
Subweb
A functionally distinguishable part of a Functional Web that may also participate in other webs rather than being owned by one.
Entry Route
A functionally independent sensory, linguistic, conceptual, or motor path capable of contributing to a Functional Web's Ignition.
Available Column
A Column whose plasticity has not yet been committed to a recurring function.
Recruited Column
A Column measurably entrenched by repeated successful participation across distinct Presentations.
Cardinal Candidate
A Recruited Column or redundant population that passes independent-route, stability, stimulation, and matched-control gates. Recruitment alone is insufficient.
Cardinal Node
A Cardinal Candidate that demonstrates stable access, partial-cue Ignition, supporting-Subweb reactivation, Lesion sensitivity, redundancy behavior, and cross-seed evidence.
Reciprocal topology
Connected Population endpoints support both ascending and descending routes while each direction keeps independent weights and Eligibility.
Fixed latent topology
Abundant sparse connections are created before learning. Learning may alter their strengths but cannot add, remove, or redirect them in milestone one.
Input, Integration, Output
The three private functional compartments of every Column: incoming drive, recurrent/contextual competition, and graded broadcast response.

Detailed laminar circuitry

Terms used by the separate population-rate cortical apparatus introduced in experiment 012.

Detailed laminar apparatus
The experimental ncl-cortical-circuit-v1 implementation that exposes named layers, neural populations, and directed pathways while preserving the simplified Functional Web runtime as a baseline.
Composite cortical Column
One A–E, M1–M3, or H1–H2 circuit containing the same twelve named population-rate elements. It is more detailed than the accepted baseline Column but still not a literal anatomical column.
Neural population
One separately updated rate-coded element inside a composite cortical Column, such as A.L4Pyr or M1.SOM23; it summarizes a cell class rather than simulating individual neurons.
Layer 1 (L1)
The superficial layer represented here by L2/3 and L5 apical-tuft targets that receive descending contextual pathways.
Layers 2/3 (L2/3)
Supragranular integration and corticocortical populations involved in vertical flow, horizontal interaction, ascending output, recurrence, and top-down context.
Layer 4 (L4)
The principal thalamocortical input layer, represented by an excitatory pyramidal population and a fast PV population.
Layer 5 (L5)
A deep pyramidal-output layer with its own apical target, PV somatic inhibition, SOM dendritic inhibition, recurrent return, and subcortical output.
Layer 6 (L6)
The deep corticothalamic-feedback population that also receives descending contextual modulation.
Pyramidal population
A rate-coded excitatory population named for its cortical layer. It carries vertical, recurrent, lateral, ascending, descending, or motor-related output according to explicit pathways.
Apical tuft
An explicit distal dendritic target for top-down context. SOM inhibits it, while tuft-to-pyramidal modulation conveys surviving context toward somatic activity.
PV population
A fast parvalbumin-like inhibitory population targeting pyramidal somatic activity and controlling feedforward or feedback gain and timing.
SOM population
A slower somatostatin-like inhibitory population recruited by pyramidal or lateral activity and targeting apical dendritic integration, PV, or VIP routes.
VIP population
A vasoactive-intestinal-peptide-like inhibitory population driven by context and behavioral state. By inhibiting SOM, it disinhibits selected apical pathways.
Thalamus
The external sensory relay that drives lower L4 and PV4 populations, supplies weaker L2/3 and L6 context, and receives L6 corticothalamic return.
Excitatory pathway
A directed edge whose non-negative signed flux is added to the target population's drive.
Inhibitory pathway
A directed edge whose flux is subtracted from the target's drive. Inhibitory strengths remain fixed in this iteration.
Modulatory pathway
A directed contextual or state edge whose flux is scaled separately before being added, distinguishing modulation from principal excitation.
Release facilitation
The presynaptic Hebbian factor representing facilitated neurotransmitter release after confirmed recurring co-activity.
Postsynaptic receptiveness
The independent Hebbian factor representing increased receptiveness of the target membrane to an existing route.
Terminal bouton
A discrete structural contact count on a pathway, increased only after enough confirmed local structural credit.
Axonal branch
A discrete structural count representing expansion of the source side of a pathway.
Dendritic spine
A discrete structural count representing expansion of the receptive target side of a pathway.

Activity, learning, and causal behavior

Terms for what the Network does during a Presentation and what may change durably afterward.

Activation
The graded current response of a Column or Population to excitation, inhibition, recurrence, threshold, and context; not a truth value.
Broadcast
Output activity sent to connected Columns when it meets the declared transmission cutoff. The cutoff does not alter stored Output.
Competition
Bounded local inhibition among alternatives that sharpens participation without imposing a global symbolic winner.
Persistence
Temporary maintenance of activity through recurrent connectivity; not permanent memory.
Eligibility
A temporary local trace on one directional connection, bounded to [0,1]. Each tick combines the decayed previous trace with presynaptic Output × postsynaptic Integration. Eligibility persists between Samples in the same Presentation, resets between independent Presentations, and remains separate for ascending and descending directions. It marks which co-active connections may be strengthened if a later Success Signal confirms the outcome; Eligibility alone is neither learning, success, nor a durable weight change.
Success Signal
A diffuse modulatory value indicating an observable successful outcome without identifying a category, Column, Population, or connection.
Recruitment
Experience-dependent commitment through eligible connections confirmed across distinct successful Presentations; never one tick or one Sample.
Entrenchment
Accumulated evidence of repeated successful use that increases a pathway's stability and accessibility.
Homeostasis
Local adaptation of each Column's activity average and threshold toward a declared target, independently of the Success Signal.
Ignition
Coordinated activation of a Functional Web from a sufficiently informative partial Entry Route.
Pattern Completion
Reactivation of absent parts of a learned Functional Web from partial evidence; not record retrieval.
Stimulation
A causal intervention that clamps selected Output to a declared amplitude, here derived from median full-Presentation activity, with sensory input absent.
Lesion
A causal intervention that clamps selected Output to zero while preserving observation of activity arriving at Input and Integration.
Redundancy
Preservation or recovery of function through alternative Columns or routes when one Candidate or Candidate group is lesioned.

Experimental domain and protocol

Terms that identify what is presented, when adaptation is allowed, and which evidence may be used.

World
The external arrangement presented to the Network during an experiment; not an internal model.
Object
A presentation target defined by externally observable parts or properties; not a stored concept.
Presentation
One ordered exposure of an Object or cue to the Network. Activity and Eligibility reset between independent Presentations.
Sample
One sensory observation within a Presentation. Activity and Eligibility persist from one Sample to the next.
Sensory adapter
A stateless mapping from distributed physical features to sensory Population activity. It carries no category identity, history, or outcome.
Acquisition
The phase in which balanced correct and mismatched visual–pseudoword Presentations may adapt weights, thresholds, entrenchment, and Recruitment.
Correct pairing
A category's declared visual evidence paired with its pseudoword; after successful settling it receives Success Signal 1.0.
Mismatch
A balanced visual–pseudoword control Presentation that receives Success Signal 0.0, showing that co-activity alone is insufficient.
Ordered pseudoword
A three-segment lexical form assembled from shared distributed auditory features and distinguishable by temporal conjunction rather than a unique feature.
Sequence control
A reversed, permuted, repeated-segment, or competing pseudoword trajectory used to test whether order—not only the feature bag—was learned.
Basin-estimation split
Four disjoint instances per category used to fit frozen basin centroids, scales, reliable masks, distributions, and margins.
Final held-out split
Four disjoint instances per category reserved for final evaluation and forbidden from influencing generation decisions, fitting, or parameter selection.
Partial cue
An incomplete Entry Route, such as a subset of visual properties, used to test movement toward the correct Target Basin and Pattern Completion.
Atypical held-out cue
A final held-out instance selected by the declared prototype-distance rule to test graded recognition away from the prototype.
Settling
Recurrent execution until the maximum Output change remains below the declared epsilon for the declared consecutive stable ticks.
Settling failure
Reaching max_ticks without stability. Recognition cannot be inferred, and the failure must be counted rather than discarded.
Durable adaptive state
Weights, thresholds, activity averages, entrenchment, contributor identities, and Recruitment evidence that survive activity reset. Fixed topology is durable but not adaptive.
Frozen evaluation
Basin estimation and final testing with every durable adaptive process disabled. Observation may not become additional training.

Plain-language experiment vocabulary

Short definitions for recurring words that appear throughout run definitions, evidence tables, and result discussions.

Basin
A region of Network activity toward which recurrent settling tends to converge. In these experiments, a category's measured and frozen region is its Target Basin.
Trace
A value or sequence that preserves how something changed over time. An Eligibility trace is temporary local connection state; an activity trace records Column activity across ticks. A trace is evidence, not a symbolic memory record.
Pseudoword
An invented, pronounceable experimental form with no pre-existing meaning. Here it is an ordered sequence of three reusable segments represented by distributed auditory features.
Centroids
The category-level mean activity vectors calculated from basin-estimation instances. Each centroid summarizes the center of one fitted Target Basin without storing any one Presentation as the target.
Scales
Per-Column variability values used to put activity differences on comparable units. The frozen pooled scales divide centroid differences in standardized Euclidean distance and cannot fall below minimum_scale.
Reliable masks
Frozen Boolean selections identifying which Columns are stable enough across basin-estimation instances to contribute to a category's primary basin distance.
Distributions
Recorded collections of observed or control values rather than one summary number—for example within-category distances, between-category distances, or random-coalition scores.
Margins
Frozen separation allowances derived from basin-estimation distributions. A correct basin distance must beat every competing distance by more than the category's margin.
Path
A concrete sequence of connected directional routes through which activity can propagate. A path is not itself an Entry Route: an Entry Route is a functionally independent source of access and may use several paths.
Arm
One matched experimental condition run from controlled initial conditions. The milestone uses trained, untrained, and shuffled-pairing arms for every seed.

Target Basins, controls, and observer evidence

Terms used to turn frozen Network activity into comparable recognition and causal measurements.

Target Basin
The stable distributed activity region approached during a full learned Presentation and estimated from several instances, never one stored vector.
Centroid
The mean settled activity vector of one category's basin-estimation instances.
Reliable-Column mask
The frozen subset of Columns whose basin-estimation variability remains within the declared stability limit.
Pooled scale
A per-Column variability estimate fitted from basin-estimation evidence and bounded below by minimum_scale.
Standardized Euclidean distance
The primary basin metric: root-mean-square centroid difference after division by frozen pooled scales over reliable Columns.
Cosine distance
A secondary directional-similarity diagnostic retained for inspection but never substituted for the primary standardized metric.
Basin margin
A frozen threshold derived from within-category basin-estimation distances. Correct distance plus margin must beat every competitor.
Trained arm
The matched arm that receives declared Success Signals and performs durable acquisition before evaluation is frozen.
Untrained arm
An otherwise matched Network that performs no durable learning, establishing what initial wiring alone can do.
Shuffled-pairing arm
A trained matched arm that changes only category–pseudoword pairings, testing whether effects localize to the correct arbitrary signs.
Matched control
A comparison selected to share all relevant initial conditions or nuisance properties except the intervention or hypothesis-bearing factor.
Pairing localization
The degree to which trained completion and reactivation exceed the shuffled-pairing arm rather than reflecting generic adaptation.
Reliability evidence
Category-conditioned activation consistency compared with shuffled-label control distributions.
Causal completion contribution
The change in completion caused by perturbing a Column, compared with matched random-Column perturbations.
Reciprocal effective connectivity
Measured two-direction connectivity within a proposed coalition, compared with degree-matched random coalitions.
False-discovery-rate correction
Benjamini–Hochberg correction across tested Columns that limits the expected proportion of false selections among discoveries.
Observer
Offline analysis that classifies basins, Functional Webs, or cardinals from recorded evidence without changing Network activity or learning.

Replication, inference, and results

Terms used by experiment 011 and the workbench to state what the evidence supports.

Seed
An integer that deterministically controls generated data, topology, initial weights, and random controls for one paired replicate.
Replicate unit
The independent unit used for inference. In the milestone it is the seed, never an individual Presentation.
Nested observation
A Presentation measured within a seed. It contributes to that seed's value but is not counted as an independent replicate.
Paired effect
A within-seed difference between matched arms or conditions, preserving shared data, topology, parameters, and initial state.
Deterministic bootstrap
Seeded resampling of paired seed effects—10,000 times in the milestone—to estimate the sampling interval of the median.
95% bootstrap interval
The 2.5th-to-97.5th percentile range of bootstrapped seed-level median effects. It is not computed over Presentations.
Expected-direction proportion
The fraction of seed effects above the declared target: zero for improvement effects or the negative margin for non-inferiority.
Failure count
The explicit number of unusable effects, settling failures, failed seeds, or non-executable required interventions associated with a result.
Non-inferiority margin
The largest acceptable degradation. Held-out category separation must have a lower interval bound above the declared −5% relative margin.
Criterion
One preregistered pass/fail condition in the milestone acceptance set, reported independently with its evidence.
Milestone verdict
The conjunction of all required criteria. One failed criterion makes the overall verdict fail even when another criterion passes.
Negative result
A completed, auditable experiment whose evidence does not support the tested hypothesis. It is not equivalent to a runtime error.
Conformance
Evidence that the apparatus implements the accepted specification. Conformance does not imply a positive scientific verdict.

Artifacts and workbench

Terms for reproducibility, identity, integrity, and display.

Experiment definition
The exact JSON declaration of the question, mechanism, parameters, controls, seeds, and analysis used by a run.
Run
One execution of an experiment definition, identified by experiment number, timestamp, and content-derived digest.
Artifact
An on-disk, rerun-free record of definitions, numerical arrays, Presentations, observer evidence, failures, and results.
Artifact contract
A required file inventory and its field semantics. The accepted milestone uses ncl-functional-web-v1; the detailed laminar process suite uses the separate ncl-cortical-circuit-v1 contract.
Manifest
The artifact index recording contract, software version, identity, timing, status, stimuli, parameters, ordered files, and checksums.
Digest
A compact content-derived identity that changes with result-affecting definitions, software, generated datasets, or topology.
Checksum
A SHA-256 integrity value for one artifact file, used to detect modification or corruption after the run.
Workbench
The read-only Laravel UI that validates and renders runtime-produced artifacts without rerunning experiments or recomputing scientific values.

Sources of truth

Read next

Normative specificationEquations, experimental protocol, controls, artifacts, acceptance criteria, and current conformance.
ArchitectureThe deep Network seam, scientific boundaries, topology, learning, observers, and accepted negative result.
NCL summaryThe theoretical source, evidential distinctions, and scientific cautions.
Implementation issues #1–#12The build sequence, acceptance criteria, verification, diagnoses, and recorded outcomes.