← Research WP-03 Protocol Implementers · Researchers · Standards Bodies

ASMP/1.0 — A Wire Protocol for Coordinated Surface Mutation

Authoritative protocol specification: all five message types with complete wire formats, ZK authentication proof, Defensive Leap cascade, and ProVerif verification results

Abstract

The Adaptive Surface Mutation Protocol (ASMP/1.0) transforms the Polymorphic Mutation Engine from a node-level library into a networked security system. This document is the authoritative protocol specification defining all five message types with complete wire formats, security properties, and formal verification results.

Patent Notice

ASMP/1.0 is covered by Indian Patent Published · IN202641070690 · 19/06/2026. This specification is a public technical disclosure published post-filing.

1. Design Goals

  • Authenticated mutation coordination: All inter-node synchronisation is authenticated. Unauthenticated messages are rejected at the protocol layer.
  • Zero-knowledge peer authentication: Peers authenticate without revealing internal surface state to eavesdroppers.
  • Cascade mutation: A single threat detection triggers simultaneous surface rotation across all authenticated peers.
  • Hardware-rooted management plane: Management operations require a credential computationally infeasible to forge without TEE access.
  • Implementation independence: The protocol is wire-level specified. A Go, Python, or FPGA implementation is fully interoperable with the Rust reference.

2. Notation

u8/u16/u64: unsigned integers, big-endian. [u8;N]: fixed byte array. SHA3-256(x): SHA3-256 (Keccak) hash. HMAC(key,msg): HMAC-SHA3-256. ||: byte concatenation. TEE_QUOTE(data): platform-specific TEE attestation quote.

3. MSG-001 — Mutation Frame

The fundamental audit unit. Every mutation produces exactly one Mutation Frame. Frames form a SHA3-256 chain constituting the tamper-evident estate-wide mutation history.

ASMP-MSG-001: Mutation Frame
  message_type:  u8      = 0x01
  version:       u8      = 0x01
  profile_id:    u8      // 0x01=MantisNet … 0x0A=LeviathanGrid … 0xFF=KaliCoreTarget
  cycle_seq:     u64     // monotonically increasing, per-profile
  entropy_hash:  [u8;32] // SHA3-256(entropy_bundle) — not the entropy itself
  surface_fp:    [u8;32] // SHA3-256(new observable surface state)
  prev_fp:       [u8;32] // SHA3-256(previous surface) — chain link
  organ_state:   u8      // 0=Sachs 1=Hunter 2=MainOrgan 3=Recovering
  node_id:       [u8;16] // UUID v4 of originating node
  timestamp_ns:  u64
  hmac:          [u8;32] // HMAC-SHA3-256(key, all preceding fields)

Chain property: frame[N].prev_fp == SHA3(frame[N-1].surface_fp) — inserting or removing a frame changes all subsequent HMACs, which are HMAC-key-protected.

4. MSG-002 — Zero-Knowledge Peer Authentication

INITIATORNETWORKADVERSARYRESPONDERSTEP 1: HELLO(peer_id, claimed_epoch N)STEP 2: CHALLENGE(nonce, surface_fp_at_epoch_N)STEP 3: RESPONSE(SHA3-256(nonce ‖ ally_channel_fp))STEP 4: ACCEPT ✓ADVERSARYObserves all 4 msgsCannot compute proof:ally_channel_fpis NEVER transmittedProVerif result:ZK PROPERTY = TRUEZK property: an adversary who observes all four messages learns nothing about ally_channel_fp.
Figure 1: MSG-002 Four-Step ZK Peer Authentication Handshake
Step 1 (Initiator → Responder):
  HELLO { peer_id: [u8;16], claimed_epoch: u64, hmac: [u8;32] }

Step 2 (Responder → Initiator):
  CHALLENGE { nonce: [u8;32], surface_fp_at_epoch: [u8;32], hmac: [u8;32] }

Step 3 (Initiator → Responder):
  RESPONSE { proof: SHA3-256(nonce || ally_channel_fp_at_epoch), hmac: [u8;32] }

Step 4 (Responder → Initiator):
  VERDICT { result: u8 (0x00=REJECT | 0x01=ACCEPT), hmac: [u8;32] }
ZK Property — Formally Verified

An adversary who intercepts all four messages cannot compute ally_channel_fp or produce a valid proof for any subsequent epoch. ProVerif result: ZK PROPERTY = TRUE under the Dolev-Yao adversary model. See WP-07.

5. MSG-003 — Anomaly Signal

ASMP-MSG-003: Anomaly Signal
  source_node_id: [u8;16]
  anomaly_score:  u32     // Fixed-point [0,1] × 1_000_000
  signal_class:   u8      // 0x01=Network 0x02=AuthFail 0x03=Physical 0x04=SIEM
  target_node_id: [u8;16] // All-zeros = estate-wide
  timestamp_ns:   u64
  hmac:           [u8;32]

Only sources with the ASMP HMAC key can inject valid anomaly signals. Prevents adversarial signal injection (flooding with false anomalies to desensitise the estate).

6. MSG-004 — Defensive Leap

ORIGIN NODEThreat detectedMain Organ stateleap_token =SHA3(origin_fp ‖ ts ‖ nonce)BROADCAST MSG-004Peer AVerifies token→ Rotates surfacePeer BVerifies token→ Rotates surfacePeer CVerifies token→ Rotates surfacePeer DVerifies token→ Rotates surfacePeer EVerifies token→ Rotates surfaceALL SURFACESROTATED IN < 200µsEstate-wide simultaneousProVerif cascade authentication result: TRUE — only nodes with valid MSG-001 chain accept a Defensive Leap.
Figure 2: MSG-004 Defensive Leap — cascade simultaneous surface rotation across all authenticated peers
ASMP-MSG-004: Defensive Leap
  leap_token:     [u8;32] // SHA3-256(origin_fp || timestamp_ns || nonce)
  origin_node_id: [u8;16]
  threat_level:   u8      // 0x01=Elevated … 0x04=Critical
  target_scope:   u8      // 0xFF=Estate-wide
  epoch:          u64
  timestamp_ns:   u64
  hmac:           [u8;32]
Cascade Authentication — Formally Verified

ProVerif result: only nodes with a valid MSG-001 chain from the origin can verify a Defensive Leap. Forged leaps are rejected. CASCADE AUTHENTICATION = TRUE.

7. MSG-005 — TEE-Rooted Management Attestation

Phase 1 — ATTEST_REQUEST (PME Node → Management Tool):
  { tee_quote: bytes, pme_version: [u8;8], mutation_epoch: u64,
    nonce: [u8;32], hmac: [u8;32] }

Phase 2 — ATTEST_RESPONSE (Management Tool → PME Node):
  { trusted: u8, trust_token: SHA3-256(tee_quote||nonce||epoch),
    expires_ns: u64,  // = now_ns + 1 mutation cycle duration (10–143µs)
    hmac: [u8;32] }
TEE Binding — Formally Verified

trust_token TTL equals one mutation cycle. Admin credentials valid at epoch N are invalid at N+1. This closes the attack vector used in Stryker-Handala (valid admin credentials used to issue wipe commands). ProVerif: ALL QUERIES CORRECT.

8. ProVerif Verification Summary

ModelComponentQueryResult
Model 1MSG-002 ZK Handshakeattacker(ally_channel_fp).TRUE — ZK property holds
Model 2MSG-004 Defensive Leapattacker(forged_leap_accepted).TRUE — cascade auth holds
Model 3MSG-005 TEE Managementattacker(trust_token_N+1).ALL QUERIES CORRECT

See WP-07 for full model descriptions, queries, and results.

9. Interoperability Requirements

  1. Implement all five message types with the wire formats specified above
  2. Use SHA3-256 (Keccak) for all hash operations and HMAC-SHA3-256 for all MACs
  3. Reject any message whose HMAC fails verification
  4. Maintain a monotonically increasing cycle_seq per profile
  5. Enforce MSG-005 trust_token TTL: reject tokens whose expires_ns < current timestamp
RFC Candidate

ASMP/1.0 is intended as an RFC-candidate document. A Go reference implementation and FPGA reference implementation are planned as the next interoperability milestones.

Read the full formatted version:

Download PDF ← All Papers