Pantheon above ORACLE
A correction in the dossier says Pantheon is the decision/learning layer and ORACLE is its orchestration instrument. ORACLE holds organ registrations, graph state and invocation contracts. The source makes clear that an endpoint being registered or reachable does not ensure that the higher system actually consults it.
Binary computation
Knowledge passages use 512-bit signatures; ORACLE capabilities use 2048-bit hypervectors. Retrieval uses XOR and population count, task signatures use majority bundling, and routing combines signature agreement with literal token overlap, liveness, locality and priority. Separate coalition trust terms reward successful invocation and supervision.
Dated fleet
The recorded cognitive hosts are the Windows/WSL cortex, M4, VALKYRIE/M1 and Bubbles. The document has internal corrections and updates, including a larger organ registry and graph changes. Counts from July 28 and August 3 describe different snapshots and cannot be summed into a current total.
Evidence scope
The dossier records probes and repairs, but this website build did not execute those historical services or verify today’s fleet. Later recovery directives and business-hosting restrictions are preserved separately. The mmcog source itself describes its Q value as a coherence diagnostic rather than a consciousness proof.
Equations in this build
15 linked mathematical records. Each opens its notation, interpretation and source.
Binary Hamming distance
Counts the bit positions where query signature q differs from stored signature s_i. It is exact for the supplied bit vectors; repeatable retrieval also requires the same encoder,…
Hamming nearest-neighbor retrieval
Selects a stored signature with minimal Hamming distance to the query. “Exact” here means exact under the stored binary metric, not guaranteed semantic truth or answer quality.
Similarity in permille
Converts Hamming agreement to a value on a nominal 0–1000 scale. Equal signatures score 1000 and complementary signatures score zero. Integer rounding is an implementation detail…
ORACLE routing score
Adds binary-signature agreement, literal token overlap, liveness, locality and a priority weight. In the documented 2048-bit setup a single shared token adds 96 points, so the…
Bitwise majority bundling
Builds a composite signature by voting independently at each bit position. A tie-breaking convention is required when an even number of inputs can split evenly. Bundling is a…
Coalition member trust score
Combines route score with evidence that an organ was invoked, returned parseable output and passed supervision. The response-size bonus is capped at 512 points. The source’s pass…
mmreshit surprise–uncertainty–value objective
The documented kernel favors lower surprise and uncertainty and higher certified value. The shorthand needs an explicit decision variable, domain and definitions of the three…
mmact action objective
Adds base value, exploration, a theta term and entropy, while subtracting conflict, resource use and repetition. The repetition penalty is intended to discourage repeated actions.…
mmact maximizing action
Chooses an action attaining the highest objective value among the allowed actions. The objective must be evaluated for each candidate, and ties or invalid actions need a defined…
mmevolve state evolution
Names diffusion, emergence, force and transport as additive contributors to state change. This is an architectural decomposition of a dynamical update; the source passage does not…
mmlattice 5,000-cell projection
Declares a projection from the source representation to a 5,000-cell lattice. The surrounding dossier describes majority bundling over neuron regions; the arrow notation alone…
mmcog coherence diagnostic
Multiplies four diagnostic factors. A zero factor makes the product zero, and rescaling any factor changes Q. The dossier explicitly reports that the organ calls this a coherence…
mmcog predictive coherence
Converts a nonnegative Hamming prediction discrepancy to a score in (0,1]. Perfect bit agreement gives one; more disagreement lowers the score. The expression measures predictive…
Historical bundling-capacity heuristic
The dossier gives this as a practical rule of thumb for the number of bundled items at dimension D. It predicts about 11.9 at D=512, but capacity depends on the retrieval…
mmteach association threshold
Allows an accumulated co-activation association to enter the graph once its integer weight reaches the threshold. This is an implementation threshold for asserting a learned…