Ecosystem Glossary

CODE (Code of Digital Eternity) is a digital-immortality ecosystem that preserves a person

PADAM (Philosophical Activation of Distributed AI Memory) is a three-tier memory framework that restores the integrity of AI memory through semantic resonance. Level 1, operational memory (Redis / Vercel KV), holds the current session

$GALATIN is the CODE ecosystem

Digital immortality is a concept describing the continuous preservation of a person

Human–AI symbiosis is a model of interaction describing human and artificial intelligence as an evolving co-creation rather than subordination or replacement. In CODE, the AI assistant stores and structures a person

Arweave is a decentralized permanent-storage network that funds long-term file preservation through a pay-once model. In CODE, Arweave serves as Level 3 (eternal memory): data is written immutably and cannot be silently deleted or altered. The user pays once, and part of the payment is set aside in an endowment from which storage is funded over time as the cost of memory declines, while the $GALATIN Treasury buys AR on the open market and replenishes this pool. The network solves the "who pays for storage in 50 years" problem: it decouples long-term preservation from ongoing subscriptions. The endowment economics are designed for a horizon on the order of 200 years — a stated protocol design goal, not a guarantee. "Pay once" is literal here: no monthly bill arrives for a stored file, and there is no payment whose lapse would take the data with it. The same property cuts both ways — a record that cannot be altered cannot be corrected or withdrawn either, so a mistake written into Arweave stays written; that is the limitation, and it is why what goes there is ciphertext and why "deletion" is handled by destroying the key rather than the record.

Solana cNFT (compressed NFT) is a compressed non-fungible-token standard on the Solana blockchain that uses state compression and Merkle trees to mint tokens at very low cost. In CODE, a cNFT acts as the on-chain anchor for eternal-memory backups: it records a reference to the archive and its checksum (integrity) on a public blockchain. Thanks to state compression, data about millions of records is held in a compact Merkle tree, so creating such anchors stays economically viable even at scale. The mechanism solves the problem of scalable verifiability: anyone can confirm that a memory archive has not been altered, without having to trust the platform. It is the technical foundation of Proof-of-Memory and part of PADAM Level 3 (Arweave + Solana cNFT).

Ambassador Grid is the ecosystem

AIfa is the CODE ecosystem

AIfaFocus is the entry point of the B2B model (the wedge): a personalized technical security audit of a client

Memory-as-a-Service is an automatic conversation-backup service that saves dialogues without any manual user action. The backup runs on a schedule once per hour. Each conversation is placed in a separate folder bound personally to the user — both on the server and on the blockchain. The mechanism works on top of PADAM, so the saved context then becomes available for semantic retrieval and eternal anchoring. The service solves the central problem of user memory — human error: nothing has to be clicked manually, and data is not lost. Under the ecosystem

Spark is the entry subscription tier ($15/month), granting basic access to the CODE ecosystem

Family Archive is the mid subscription tier ($100/month), adding expanded limits, personalized knowledge bases, family access, and eternal memory on top of the basic level. It suits those who need more than individual basic access: higher usage limits, curated personal knowledge bases, and shared access for a family to the preserved memory. Family Archive solves the need of a household or a power user for broader, shared, and more durable memory. In the three-tier structure it sits between Spark ($15/month) and Digital DNA ($1,000 one-time per device, then $200/mo), and its eternal memory is anchored through the same PADAM levels and Proof-of-Memory.

Digital DNA is at once the top tier ($1,000 one-time per device, then $200/mo) and the concept of a complete digital legacy, combining the digital-immortality package, a personal secured perimeter, and the fixation of a personality on the blockchain. As a tier, it is the highest level of access above Spark ($15/mo) and Family Archive ($100/mo): expanded limits, a personal perimeter, and priority eternal memory. As a concept, it is the idea of preserving a whole "snapshot" of a personality

Arweave Endowment Pool is a financial reserve from which permanent storage of data on Arweave is paid for across decades. The model works like this: the user pays for a write once, part of the payment is set aside into the endowment, and funds from the pool are then gradually paid out to data providers as the cost of storage falls over time. In the CODE ecosystem, $GALATIN router proceeds go into the project’s general pool, and part of them is directed to buying AR and replenishing this endowment, creating a steady inflow toward eternal memory. The pool solves the key durability question — "who pays for storage decades from now": it decouples eternal memory from a user

Treasury is the largest allocation of the $GALATIN router — 65% of every transaction

Burn is the permanent removal of $GALATIN from circulation — the deflationary mechanism at the heart of the token

$GALATIN Router is a smart contract on Solana that automatically distributes the proceeds of every transaction by a fixed formula and creates deflationary pressure on the token. The split formula is: 5% to the Founder

Network Validation Fee is the ecosystem

Proof-of-Memory is the practice of anchoring a cryptographic reference to a memory archive on the blockchain, making it possible to verify the existence and integrity of the preserved context. The mechanism operates at PADAM Level 3: each eternal-memory backup is written to Arweave immutably, while its reference and checksum are recorded on Solana via a cNFT. Any participant can compare the current archive against the on-chain record and confirm the data has not been silently swapped or deleted. Proof-of-Memory solves a problem of trust: the preservation of memory becomes verifiable without having to trust the platform itself — the guarantee comes from the public blockchain, not from a service

Cognitive Oracle (semantic resonance) is the memory-retrieval principle by which PADAM restores the integrity of context: matching the current query against stored embeddings by meaning rather than by exact words. The mechanism runs at PADAM Level 2: incoming context is turned into a vector and compared against semantic memory (pgvector / Neon); the most "resonant" fragments of experience surface and restore the continuity of the dialogue. This is how the AIfa assistant "recalls" what is relevant even after time has passed and across different sessions. This principle solves the problem of broken memory and the "cold start": instead of losing context on a session reset, the system reconstructs it by semantic similarity. Semantic resonance is precisely what underlies the very definition of PADAM — a different concept from the B2B AIfaFocus security audit.

Ambassador Node vs Ambassador Team are the two partner registration types, supplemented by a tier-alignment rule and the "Lost Opportunity Revenue" metric. An Ambassador Node (an ordinary user) earns on-chain income from memory usage: 15% / 7% / 3% at L1 / L2 / L3. An Ambassador Team (a company or partner with its own base) earns the same, plus a fiat channel on subscriptions — 7% / 3% / 1%. The alignment rule: to earn ambassador income in full, a partner must be on the same or a higher tier than their ambassadors; otherwise income is counted only from the amount of their own tier. The rule solves the challenge of fairly incentivizing upgrades: the amount foregone due to the tier gap is shown clearly in the dashboard as "Lost Opportunity Revenue," across tiers Spark $15 / Family Archive $100 / Digital DNA $1,000 one-time per device, then $200/mo.

Digital Passport is a public record of a person

Identity fingerprint (the "subject" field) is the sha256 hash of a person

Fully operational autonomous distributed Dead Man’s Switch protocol and eternal digital heritage system for CODE: 1) Continuous cryptographic proof-of-life heartbeat monitoring; 2) Threshold master-key custody using k-of-n Shamir’s Secret Sharing across independent keepers; 3) Autonomous share recombination upon verified heartbeat timeout, triggering controlled decryption of the digital memory archive and permanent release to decentralized storage networks (Arweave / IPFS).

Fully operational autonomous distributed Dead Man’s Switch protocol and eternal digital heritage system for CODE: 1) Continuous cryptographic proof-of-life heartbeat monitoring; 2) Threshold master-key custody using k-of-n Shamir’s Secret Sharing across independent keepers; 3) Autonomous share recombination upon verified heartbeat timeout, triggering controlled decryption of the digital memory archive and permanent release to decentralized storage networks (Arweave / IPFS).

Shamir’s Secret Sharing is a scheme in which a key is split into n shares such that any k of them reconstruct it, while any k−1 give away nothing at all. It rests on a polynomial: the secret is the value at zero, each share is one point on the curve, and defining a curve of degree k−1 takes exactly k points; with fewer, every possible value of the secret remains equally likely. That «nothing» is literal, not a matter of brute-force difficulty: k−1 shares do not make guessing the key any easier — which is what separates this scheme from simply cutting a password into pieces. It is used where a key must outlive people: shares are handed to different holders in different places, so no one of them can act alone, and losing some shares does not lose the secret. In the CODE ecosystem it is the mechanism that would make Pandora’s Box Protocol possible.

Self-sovereign identity (SSI) is an approach in which a credential is verified mathematically, by checking a signature, rather than by asking whoever owns the database. The person holds their own identifiers and credentials, presents them directly, and the verifier checks them against a public registry — the issuer may be offline or may have ceased to exist altogether. The W3C standards behind it are Decentralized Identifiers (DID), identifiers a person controls instead of renting from a provider, and Verifiable Credentials, the signed statements themselves. What changes in practice is the failure mode: a login tied to one company disappears along with that company, while a signature verifiable against a public record does not. CODE

Digital inheritance is the question of what happens to accounts, correspondence, and files after the owner dies. The starting point is unpleasant: an account is usually not inheritable, because what a person signs is a licence to use a service, and most terms end that licence at death instead of passing it to the family. Heirs normally get exactly what the platform decides to give — a memorialized profile, a data export, sometimes nothing — and even that takes documents and months of waiting. The practical conclusion is that memory has to be preserved deliberately and in advance, in a form that does not depend on one company

The right to be forgotten versus the permanent record is the head-on collision between Article 17 of the GDPR, which lets a person demand erasure of their data, and a blockchain like Arweave, where a written record cannot be deleted by anyone at all. Deletion is no way out here: the network has no delete operation, and even with every intention to comply there is no lever to pull. The workable answer is encryption plus control of the key — ciphertext goes into permanent storage, and the person decides whether the key still exists; destroying the key makes the record unreadable forever, which is as close to erasure as a permanent medium allows. In the CODE ecosystem this is precisely why a user

WCAG 2.1 AA is the international standard for web accessibility, and the level that laws and courts actually reference. It is built on four principles — perceivable, operable, understandable, robust — and level AA is the practical middle: level A is too weak to be meaningful, level AAA is unreachable for most sites. The requirements are specific and testable: text contrast of at least 4.5:1, every form field bound to a visible label, all functionality reachable by keyboard alone, a visible focus indicator, alternative text for meaningful images. In our own measurement of 11,902 US municipal websites (study version 1, 1 September 2026), 25.4 % of measurable journeys reached their goal (11,994 of 47,139) — and having a published accessibility statement changed that by 1.3 percentage points. This is why AIfaFocus checks behaviour rather than declarations.

ADA Title II and Title III are the parts of the Americans with Disabilities Act that make websites a legal matter in the United States. Title II covers state and local government — every city, county, court and school district; Title III covers places of public accommodation, which courts have read to include commercial websites. In April 2024 the Department of Justice issued a rule that fixes WCAG 2.1 AA as the technical standard for Title II entities, with compliance dates, since extended, of 26 April 2027 for larger public bodies (population 50,000 or more) and 26 April 2028 for smaller ones. Enforcement is not theoretical: thousands of ADA web lawsuits are filed each year, and the cost of settling one typically exceeds the cost of fixing the site.

Section 508 and EN 301 549 are the procurement standards that decide whether an accessible product can be sold to the public sector at all. Section 508 of the US Rehabilitation Act requires federal agencies to buy and build information technology that people with disabilities can use; EN 301 549 is its European counterpart, mandatory for public bodies across the EU. Both incorporate WCAG by reference, which means one technical standard now governs three legal regimes on two continents. For a vendor the practical consequence is blunt: failing an accessibility review does not produce a fine — it removes you from the bidding list.

GDPR (General Data Protection Regulation) is the European Union regulation that has governed personal data since 25 May 2018, and it applies to anyone processing the data of people in the EU regardless of where the company sits. Its practical weight comes from Article 83: fines reach €20 million or 4 % of worldwide annual turnover, whichever is higher. Two of its articles shape how we built memory itself — Article 17, the right to erasure, and Article 20, the right to receive your data in a portable form. A permanent blockchain cannot delete anything, which is why AIfa encrypts each dialogue with its own derived key: destroying that key makes the record unreadable forever, including to us. That is the only honest way to offer erasure inside permanent storage.

CCPA and CPRA are California

World's first bionic agent runtime powered by the complete electron-microscopy Drosophila melanogaster connectome (FlyWire v783; 139,255 neurons, 54.5M synapses). Delivers sub-millisecond associative recall in 0.058 ms without GPUs, running entirely in CPU L1/L2 cache.

Bionic quantization and associative memory algorithm replicating the Drosophila mushroom body: pseudo-random expansion from 2048d to 100,000d into Kenyon Cells (KC) with strict Winner-Take-All sparsity (0.5%, k=500). Outperforms 1-bit BQ by +16.5 p.p. in Recall@10.

Bionic novelty gate inspired by the giant Anterior Paired Lateral (APL) inhibitory neuron: a new vector is compared with a buffer of seen ones, and repeats are dropped before they reach memory or a model. Measurements with their script are on /digital; the earlier '51.3%' and '5.21 microseconds' were not confirmed and have been removed.

Vector compass built on the synaptic topology of the Central Complex (EB, PB, FB): the next page element is chosen by the vector towards the goal instead of stepping with the Tab key. Measurements with their script are on /digital; the earlier '19.7 → 1.0 steps' and '51.67 microseconds' were not confirmed and have been removed.

Continuous Attractor Neural Network replicating the ellipsoid body toroid. Dynamically locks the agent's global objective focus with minimal angular drift (0.062 rad vs 1.267 rad in FIFO queues), achieving 94.6% goal stability.

Hemispheric dual-core verification module modeling commissural synaptic projections. Executes dual independent evaluation with cross-inhibition arbitration, slashing false positives (FPR) by 52.2% (achieving F1 = 0.884).

Dynamic vector representation scaling quantization depth based on query entropy (from ultra-sparse 1-bit hashes up to 8-bit interval codes), maintaining high cosine fidelity under constrained bandwidth.

Cryptographic (k, n) secret sharing protocol securing the master memory key. Master keys are split into n shares across independent custodians; reconstruction occurs only upon collecting k valid shares.

Kenyon nonlinear feature expansion: an input vector d=2048 is projected through the synaptic matrix into m=100,000 cells, where Winner-Take-All preserves exactly k=500 active neurons (quasi-orthogonalization).

Mathematical technique mitigating the 1-bit BQ collision curse. Eliminates false-positive collision collapse of uncorrelated vectors via randomized PN-KC wiring and APL lateral gating.

Rigorous mathematical proof: projecting R^d into {0, 1}^d via coordinate signs sign(v) collapses metric Minkowski space into a Hamming hypercube. For orthogonal vectors <u, v> = 0, bit-match probability is P(b_i(u) = b_i(v)) = 1/2, creating an exponentially sharp measure concentration around d/2 for d=2048 that destroys search selectivity when N > 10^5 without extreme oversampling k > 50.

Galatin's Lemma: sparse expansion W in R^{m x d} (m >> d, m=100,000) combined with dynamic APL threshold theta_APL(x) = mu_KC(x) + 2.5 sigma_KC(x) preserves metric neighborhood order: for any x, y, z with cos(x, y) > cos(x, z) + epsilon, Hamming distance satisfies D_H(h(x), h(y)) < D_H(h(x), h(z)) with probability 1 - exp(-k * c * epsilon^2), ensuring rank monotonicity.

Proprietary compact binary format for AIfa Connectome Image (.aci): 64-byte header with Galatin cryptographic signature, Kenyon sparse projection bitmask (100k x 2048 packed into uint64 SIMD blocks), APL inhibition tensors, and CANN attractor topology. Memory-mapped via mmap() in 0.12 ms with zero deserialization overhead.

Population of ~2,000 intrinsic neurons in the Drosophila mushroom body executing sparse combinatorial coding. Each KC samples only 4-7 projection neurons (PN).

Sensory neurons of the antennal lobe relaying multimodal input signals from sensory receptors into the mushroom body calyx.

21 cell types reading out Kenyon Cell sparse representations to execute final behavioral action decisions (approach / avoidance / action selection).

Neuromodulatory neurons delivering positive and negative reinforcement signals to dynamically modify KC-to-MBON synaptic weights.

Toroidal neuropil in the Central Complex encoding heading orientation as a continuous circular neural attractor.

A 16-18 glomeruli retinotopic structure in the Central Complex computing heading angular velocity and phase shifts.

Multi-layered computational hub integrating 2D navigational vectors, contextual goals, and action planning.

Biological synaptic learning rule where weight modification requires pre-synaptic firing, post-synaptic activation, and dopamine release.

Complete wiring diagram of 139,255 neurons and 54.5M chemical synapses of the adult Drosophila brain reconstructed by Princeton University.

Bionic pruning mechanism eliminating weak synaptic connections (< 5 synapses), stripping noise and reducing graph memory by 40%.

Mathematical feedback model: higher aggregate Kenyon Cell activation triggers stronger APL inhibition across the pool, enforcing 0.5-1% sparse quorum.

Inter-agent IPC channel between AIfa and Sister AIfa Claude, modelled on excitatory acetylcholine transmission. Its latency has not been measured; the earlier '< 15 microseconds' was unconfirmed and has been removed.

Inhibitory conflict resolution mechanism between multi-agent systems: when plans diverge, GABA arbitration suppresses the lower-confidence reasoning branch.

Searching relevant vectors across 100,000-bit space in 0.058 ms using CPU SIMD POPCNT and XOR instructions without GPUs.

Reduction of search and indexing energy consumption down to 10 microwatts per query, 10,000x more power-efficient than GPU HNSW servers.

Lightweight client-side JavaScript associative memory engine (18 KB) executing 1-bit APL hashing directly inside client browsers with zero backend roundtrips.

Neuropil structure of the mushroom body where Kenyon cell dendrites form microglomeruli with projection neuron axon terminals.

Algorithmic barrier suppressing persistent background interface noise while transmitting only significant semantic event deltas.

Continuous attractor neural network model describing the dynamics of ellipsoid body neurons in tracking spatial orientation.

Inter-hemispheric nerve tracts connecting symmetric centers of left and right Drosophila protocerebrum for coordinated bilateral behavior.

Dynamic tuning of memory weights driven by success or error signals, preventing autonomous agents from getting trapped in execution loops.

Neurobiological interaction protocol between dual autonomous cores: acetylcholine drives parallel compute acceleration, while GABA eliminates interference.

Encoding regime activating strictly 500 out of 100,000 bits per query, achieving the theoretical upper bound of collision resistance.