Asset Vector (AVEC) and Network Immune System

4. Asset Vector (AVEC) and Network Immune System

CNST Consistency Spaces · AVEC and G‑connectors · D/G isomorphism · Issuer hierarchy · Synaptogenesis · Cellular immunity · Hierarchical registry · Asset name format · Transfer mechanics · Ledger evolution · Synaptic consensus · Smart contracts

4. 1. Consistency Spaces (CNST) and Vector Propagation

Every entity capable of issuance (GLAI, GATE, ANOD) defines its own CNST (Consistency) space — a formal N‑dimensional space whose axes are the asset types defined by that issuer. Each axis specifies one asset type with its semantics and validation rules. Nodes belonging to the same CNST share a common space, a common root of trust, and common rules.

Having defined the space, the issuer propagates its vector to the nodes of its functional group. Propagation occurs through D‑components when a node is created (NRGN) or through G‑relations during synaptogenesis (SYGN).

Hierarchy of spaces:

CNST₀ (GLAI). The root space of the network. Its axes define fundamental system assets: NRGN quotas, SYGN quotas, legitimacy markers. A vector in CNST₀ is mandatory for all network nodes — its presence is the root immunity. A node without a vector in CNST₀ is a foreign object (“bacterium”) rejected at early interaction stages. The CNST₀ space can be defined absolutely — in the NDDI source code, at compile time or link time — so that a young network is already ready for neurogenesis.

CNSTₖ (GATE/ANOD). A local space defined by a platform or a functional node. Propagated within a functional group. Examples: GATE platform compute quotas, access rights, specialised security markers.

CNSTₘ (LOAI). An application space defined by any node that assumes the role of a local issuer. Connection is voluntary; its value is determined by market trust in the issuer.

4. 2. Asset Vector (AVEC) and Action Validation

a) AVEC as a vector in CNST space

When a CNST space is propagated to a node, an asset vector (AVEC) is formed in the NDDI — the specific coordinates of the node in that space. AVEC is a property of a G‑relation and comes as its integral part. A G‑relation consists of the space definition (CNST) and the vector coordinate values.

One NDDI can carry several AVECs in different CNST spaces simultaneously. Minimum — AVEC₀ (from GLAI, mandatory). Typical — AVEC₀ + AVECₖ (from the local platform). Optional — any number of AVECₘ (from application‑level LOAIs).

b) Validation through multiplication

When an action is requested (NRGN, SYGN, asset transfer), the requested action is formalised as a vector in the same CNST space. This action vector is multiplied by the AVEC matrix. The result determines permission or denial:

  • If all coordinates of the result are non‑negative — the action is allowed. The AVEC is updated (coordinates are reduced by the cost of the action).

  • If at least one coordinate is negative — the action is denied. The node does not have sufficient asset on that axis.

All validation logic reduces to linear algebra operations on the CNST space. A node with several AVECs operates in several spaces simultaneously, and each action is checked in the space to which it belongs — through the appropriate G‑connector.

c) G‑connectors

Each AVEC in an NDDI is tied to its G‑connector — a component of the node’s G‑section that defines the node’s reactions to events in the corresponding CNST space. The G‑connector receives the action vector, performs multiplication by the AVEC, and returns the result to the OPN.

Biological analogy: a cell carries many membrane receptors, each responding to its own class of signals. MHC‑I is a GLAI‑level G‑connector. Tissue‑specific receptors are GATE/ANOD‑level G‑connectors. Neurotransmitter receptors are application‑level G‑connectors.

4. 3. Isomorphism of D‑level and G‑level

a) D‑level (structure / neuron / genome)

Creating an NDDI node via NRGN is an expensive, irreversible operation, analogous to the birth of a nerve cell. The D‑section contains the object code of the node’s program, fixed at creation time. D‑relations between nodes (physical connectivity set during deployment) are stable: this is the network’s “anatomy”. The D‑level defines what exists — topology, identity, basic structure.

b) G‑level (dynamics / synapse / expression)

After node creation, a second process begins — the formation of dynamic G‑relations (SYGN) and the transformation of AVECs. G‑relations are fundamentally different from D‑relations: they come and go, carry AVECs (space definition + coordinates), and consume quotas. The G‑level defines what happens — dynamics, exchange, behaviour.

c) Isomorphism of D and G

Both levels use the same structural primitives: NDDI nodes, relations, UNON+LOCN addressing. The semantics differ. D is fixed structure, G is adaptive dynamics. The gene and expression use the same chemical substrate, but the gene is a program, expression is a response. This isomorphism is a consequence of the unified NDDI architecture: one primitive first generates structure (D), then behaviour (G).

4. 4. NDDI Structure in the Context of AVEC

a) D‑section

The D‑section of an NDDI contains the node’s object code — compiled logic that defines the behaviour of the OPN. The D‑section does not contain identifiers, signatures, or assets — only executable code.

b) Identification: UNON

Node identification is done via UNON — a unique name consisting of GANN (alias component) and GATN (named component). UNON is a property of the node as a whole, not of any individual section.

c) AVEC as a property of a G‑relation

AVEC comes as an integral part of a G‑relation: CNST space definition + coordinate values. When an NDDI establishes a G‑relation with an issuer (GLAI, GATE, LOAI), it receives the AVEC of that space. The initial values of AVEC₀ may be determined during neurogenesis — by the compiler or linker script — if the CNST₀ space is defined absolutely in the NDDI source code.

4. 5. Issuer Hierarchy (GLAI, LRAI, LOAI)

GLAI (Global Asset Issuer). The root node. Its public key is integrated into the GATE platform kernel. Defines the CNST₀ space. Propagates AVEC₀. Sets global security rules.

LRAI (Local Representative Asset Issuer). A trusted representative of GLAI. Distributes AVEC₀ pools within its local zone, ensuring offline operation. Receives a limited pool of assets per epoch from GLAI.

LOAI (Local Asset Issuer). Any node that has defined its own CNSTₘ space and assumed the function of issuing application‑level AVECₘ. Creates an autonomous local economy.

The signature chain from GLAI → LRAI → end node forms a “genetic lineage” — cryptographic proof of the origin of each AVEC.

4. 6. Synaptogenesis (SYGN) and Resource Economics

Creating G‑relations (SYGN) — the key G‑level operation — consumes quotas from AVEC₀ (from GLAI/LRAI).

  1. 1.

    Initiation. The subject’s OPN identifies the need for a new G‑relation. The GATE platform consumes one quota unit from AVEC₀, allocating a temporary RAM relation (PENDING_SYNC) without interrupting active code.

  2. 2.

    Validation (immune response). The receiving side verifies the request (SREQ) and legitimacy markers through the CNST₀‑level G‑connector (see 1.7). On success — key exchange, establishment of the G‑relation.

  3. 3.

    Structural fixation. During periods of inactivity (default mode network), shadow relinking (Shadow JIT) is launched. RAM relations “grow” into permanent D‑sections.

  4. 4.

    Pruning (SDEL). When negative markers (−) accumulate in the TRL, the OPN initiates the breakup of the G‑relation. The D‑section is relinked, freeing resources.

4. 7. Network Immune System

a) Innate immunity (AVEC₀ as MHC‑I)

During Phase 2 of synaptogenesis, the recipient node scans the incoming SREQ through the CNST₀‑level G‑connector. If the initiator presents a valid AVEC₀ with a correct signature chain from GLAI — the request is passed on to application‑level quota checking. If AVEC₀ is missing, damaged, or belongs to an unknown root — the process is immediately blocked without response. A node without AVEC₀ is a “bacterium”.

b) Cytokine signalling

A node that repels an illegitimate request generates an immune alert — a service datagram containing a dump of the SREQ and metadata of the attacker. The alert is routed to the local security node (Security ANOD).

c) Acquired immunity (CRL)

The Security ANOD accumulates alerts, detects coordinated attacks, and generates an updated certificate revocation list (CRL). The CRL is distributed through LRAI across the entire jurisdiction. Subsequent requests from a compromised key are rejected at early stages.

4. 8. Hierarchical Distributed Registry

a) Issuance and packaging

GLAI issues G‑components — discrete units whose quantity is determined by issuance parameters. Individual G‑components are grouped into packets. Each packet has a G‑connector and through it is bound to the owner.

IP analogy: IANA allocates address blocks → RIR distributes by region → LIR gives to operators → operator assigns to end devices. The Internet works and handles load precisely because of this hierarchy. GNET reproduces the same principle for assets.

b) Registry tree

The asset registry is not a global database nor a flat blockchain, but a registry tree, where each level is responsible for its own scale:

  • GLAI — root registry. Issuance, primary distribution of packets.

  • LRAI — regional registry. Distribution of packets within the jurisdiction.

  • Owner — local registry. Splitting, merging, re‑forming packets.

Notarial certification is required when transferring between different owners or when moving between tree levels. Local operations (splitting a packet into sub‑packets, merging one’s own packets) are performed autonomously by the owner, without appealing to higher levels. This removes the registry load problem: the vast majority of operations occur locally.

c) Recursiveness

An owner who receives a packet becomes the local registry for its sub‑packets. It can recursively split and redistribute, forming an arbitrary depth of the tree. Each recursion level uses the same primitives (NDDI, G‑relations, G‑connectors) — the isomorphism of the architecture.

4. 9. Asset Type Name Format (64‑bit Identifier)

Each digital asset type in GNET has a unique name — a 64‑bit identifier that fits in a single machine word. The type name is itself a digital asset and propagates through the registry tree together with the G‑components.

a) Identifier structure

Bits 0–31:    GATE number (32 bits)
Bits 32–53:   Issuer UNON — suffix (22 bits)
Bits 54–63:   Issuer UNON — prefix (10 bits)

The asset type name and the issuer’s UNON are not two separate entities but one. The issuer node’s UNON is formed as prefix (10 bits) + variable suffix (22 bits). From the UNON of a node with a certain prefix, you can immediately see that it is an issuer and what type of assets it defines.

GATE number (bits 0–31, 32 bits, up to ~4 billion platforms). Identifies the platform on which the issuer is registered. GLAI is not given a separate bit — it is assigned a reserved address from the GATE pool (e.g., 0xFFFFFFFF). When the GATE field contains that address — the asset is a system asset of GLAI. Unified addressing, no exceptions.

Issuer UNON suffix (bits 32–53, 22 bits, up to ~4 million issuers per GATE). Unique identifier of the issuer on that platform. Each card (MAP) may act as an issuer — one issuer per card is sufficient. Nodes within the card do not need their own issuance authority. GATE assigns suffixes when creating nodes, with an eye to future self‑issuance.

Issuer UNON prefix (bits 54–63, 10 bits, up to 1024 types). Defines the asset type of that issuer. One card does not generate thousands of different types — biologically justified (a neuron uses dozens of neurotransmitters, not thousands). 1024 types is generous.

b) Format properties

From the identifier one instantly extracts: which GATE (bitmask 0–31), which issuer (mask 32–53), which type (mask 54–63). One operation — one machine word. No indirections, mapping tables, name resolution.

Asset type names assigned by GLAI (reserved GATE address) are globally valid across the entire network. Names assigned by any other issuer are valid within its consistency space (CNST). For isolated subsystems this is sufficient.

c) Extensibility

If 64 bits prove insufficient in the future, the architecture allows a transition to 128‑bit identifiers — by analogy with the IPv4 → IPv6 transition.

4. 10. Asset Transfer Mechanics

a) Principle: transfer = re‑registration of a relation

The asset exists in the registry. Ownership is determined by the G‑relation between the registry and the owner. Transferring an asset is re‑registering the G‑relation, not moving data.

b) Four transfer options

(1) Transfer of an asset component (re‑registration of the relation in the registry). The asset stays in the registry. The G‑relation changes — the counterparty name is redefined to the new owner. A notary (escrow agent) intermediates: until it confirms that the counterparty name has been changed — the transaction is not complete. This is the main option for everyday transactions.

(2) Transfer of an NDDI with a component (node reconfiguration). The ownership of the node itself that contains the G‑component changes. The node stays on the same GATE, the G‑component does not change. The node is reconfigured for different BLOM/KLOM/WLOM, but does not physically move. Moving a node between GATEs is not allowed.

(3) Mobile IP (transfer of an NDDI as a document). Mobile IP technology from IPv6 allows an NDDI to “move” — analogous to transferring a paper document. UNON remains the same, G‑components remain the same. The notary confirms the transfer of ownership. A step towards offline and traditional values.

(4) Aggregation into a wallet. Several NDDIs with G‑components are aggregated by a single container. The container is transferred. A special case of option (3), solved via Mobile IP.

4. 11. Ledger Evolution: from TRL0 to TRLB

a) Ledger as an evolutionary primitive

The ledger is not an invention of blockchain. It is an evolutionary primitive that emerged at the TRL0 level: the simplest recording of the Subject–Action–Object triad. At TRL0 all three participants of the triad are simple: subject — the NDDI that initiated the transaction; action — one of several basic transactions; object — an asset (AVEC). But the triad is already complete. The isomorphism of the Gativus transformation is preserved at all levels — the complexity of participants changes, but the structure does not.

b) Evolutionary ladder of ledgers

TRL0 — basic ledger. Subject — NDDI. Action — transaction (several basic types). Object — asset. Sufficient for immunity and basic accounting. Organisms existed even before object recognition.

TRL3 — ledger of physical activity. CNN1 enriches objects with recognition. Subject — NDDI with R‑components. Action — operation (OPER, b‑splice). Object — recognised object. In Leontiev’s terms — the level of operations.

TRL8 — ledger of business activity. CNN2 enriches subjects with narrativity. Subject — organism (MAP8). Action — action (KLEN). Object — narrative (KLOM). In Leontiev’s terms — the level of actions. Contracts, obligations, conscious transactions.

TRLB — ledger of personal activity. CNN3 enriches activity with axiology. Subject — personality (MAPB). Action — activity (MOTV). Object — axiological object (W‑vector). In Leontiev’s terms — the level of activity. The Aufheben trajectory that constitutes the personality.

c) Two levels of issuance management

DOM0 — unitary issuance. The issuer unilaterally determines the parameters. Rules are fixed in the NDDI source code. Sufficient for system security assets, intra‑platform quotas, local economies.

MAP8/MAP9 — civic issuance. Issuance parameters are protected by MAP9 narratives (laws) and individual voting acts of MAP8. Trust moves from an anonymous network of miners to an identified GLAI, but GLAI is controlled by participants through civic procedures. Changing issuance parameters requires social consensus — not computational (PoW), but civic (voting, legislation).

d) AVEC at all TRL levels

The AVEC mechanism (multiplication of the action vector by the matrix) is applied at all levels — isomorphically. At TRL0 the coordinates are the allow/deny thresholds for basic transactions. At TRL3 — balances of recognised assets. At TRL8 — binding to narratives and contracts. At TRLB — axiological weights.

Table 1.1. Evolutionary ladder of ledgers

Subject

Action

Object

In Leontiev’s terms

Activity type

TRL0

NDDI

Transaction

Asset (AVEC)

Basic

TRL3

NDDI + R

OPER (b‑splice)

Recognised object

Operation

Physical

TRL8

Organism (MAP8)

KLEN

Narrative (KLOM)

Action

Business

TRLB

Personality (MAPB)

MOTV

W‑vector

Activity

Personal

4. 12. Synaptic Consensus

a) Why global consensus is redundant

In classic blockchain systems, global consensus (PoW, PoS) solves the double‑spend problem in the absence of participant identification. GNET does not need this: each AVEC is tied to a specific UNON, and the immune system (CRL) ensures rejection of compromised nodes.

b) Protocol

A transaction (re‑registration of a G‑relation in the registry) is valid when: (1) both end nodes confirm the state transition; (2) a notary (LRAI or escrow agent) certifies the re‑registration; (3) the signature chain is cryptographically intact. Consensus is reached locally — at the point of the G‑relation, under the supervision of the notary.

c) Transaction phases (option 1 — re‑registration in the registry)

Phase 1 — Initiation. NDDI subject A forms a transaction envelope (TX): recipient B’s UNON, asset identifier, transfer conditions. The envelope is signed with A’s key.

Phase 2 — Notarial certification. The TX is routed to the notary (LRAI or escrow agent). The notary checks: (a) a G‑relation between the registry and A exists; (b) UNON matches the signer; (c) A’s key is not on the CRL. On success — countersignature, the G‑relation is marked PENDING with a timeout.

Phase 3 — Reception. Node B checks the sender’s AVEC₀ (innate immunity), the notary’s countersignature, and the conditions in ATTR. On success it signs TX‑ACK.

Phase 4 — Finalisation. The notary receives TX‑ACK. The counterparty name of the G‑relation in the registry is redefined from A to B. The triad Subject(A)–Action(TX)–Object(asset) is recorded in the TRL of both participants.

4. 13. Smart Contracts: MAP9 Narrative and G‑Asset

a) Contract as a narrative

A contract is a narrative at the MAP9 level (public transaction). Like any narrative, it has an identifier and a KLOM structure. At the MAP8 level, the contract is present in the organism as a conscious obligation — an action (KLEN) within business activity.

b) Definition of a smart contract

A contract becomes a smart contract when the MAP9 narrative is bound to a G‑asset (AVEC). Binding means that the conditions of the narrative directly affect transaction validation: the AVEC matrix will not allow an action that contradicts the contract conditions. A narrative without binding to an AVEC is just text (“paper”). An AVEC without binding to a narrative is just numbers. The connection turns both into an executable obligation.

c) The phenomenon of cross‑level influence

Here a remarkable phenomenon manifests: the low‑level organisation of the network (G‑relations, AVEC, validation through multiplication) turns out to be directly connected to the high level of MAP8/MAP9 (narratives, contracts, public transactions). The smart contract is the point where the physical infrastructure of the network and the social semantics of the narrative meet. The type of relationship between the narrative (MAP9) and an NDDI with a G‑component requires further formalisation.

4. 14. Privacy: GATN vs. GANN

GNET uses an identification model (binding to UNON). This ensures the operability of immunity, the meaningfulness of TRL, and the absence of global consensus.

  • GATN (named component of UNON): full transparency. Corporations, registries, regulated markets.

  • GANN (alias component of UNON): the node is identified in the network (CRL works), but the real identity is not disclosed to counterparties. Personal transactions.

Limitation: LRAI knows who stands behind a GANN (otherwise CRL would not work). This information is not disclosed to counterparties.

4. 15. Summary

The AVEC architecture grows out of GNET’s fundamental primitives. The consistency space (CNST) is defined by the issuer, its axes are asset types, the AVEC vector is the node’s specific coordinates. Action validation reduces to multiplying the action vector by the AVEC matrix.

The asset registry is a hierarchical tree (GLAI → LRAI → owner), isomorphic to the network topology and analogous to the IP address delegation hierarchy. The asset type name is a 64‑bit identifier, identical to the issuer’s UNON (prefix = type, suffix = issuer, GATE = platform).

The ledger is an evolutionary primitive that emerged at TRL0. The Subject–Action–Object triad exists at all levels, from TRL0 to TRLB. The isomorphism of the Gativus transformation is preserved: the complexity of participants changes, but the structure does not. Issuance management evolves from unitary (DOM0) to civic (MAP8/MAP9).

The D/G dual‑layer architecture: the D‑level creates nodes and embeds object code (neurogenesis, genome); the G‑level forms G‑relations with AVEC and transforms assets (synaptogenesis, expression). Both levels are isomorphic in structure and different in dynamics.

A smart contract is the meeting point of low‑level network infrastructure and high‑level social semantics: a MAP9 narrative, operationalised through a G‑relation with an AVEC.

Trust in GNET is provided by identification (UNON + immunity), not by computational complexity or capital collateral.

Contents

4. Asset Vector (AVEC) and Network Immune System