tightbeam

Status

Warning: This project is under active development. Public APIs and file formats MAY change WITHOUT notice. It is NOT yet production-ready.

Copyright Notice

Copyright (C) Tanveer Wahid, WahidGroup, LLC (2025). All Rights Reserved.

Abstract

tightbeam is a Layer-5 framework implementing high-fidelity information theory through ASN.1 DER encoding with versioned metadata structures.

Table of Contents

1. Introduction
2. Terminology
3. Architecture
4. Protocol Specification
5. ASN.1 Formal Specification
6. Implementation
7. Security Considerations
8. Network Theory
9. Testing Framework
10. Examples
11. References
12. License
13. Implementation Notes

1. Introduction

tightbeam defines a structured, versioned messaging protocol with an information fidelity constraint: I(t) ∈ (0,1) for all t ∈ T. Sections follow a [concept → specification → implementation → testing] pattern.

1.1 Information Fidelity Constraint

Question: How well does information maintain fidelity[^fidelity] across time?

The foundational mathematical principle underlying tightbeam is the information fidelity constraint:

I(t) ∈ (0,1) ∀t ∈ T

Where:

• I(t): Information state of a Frame at time t
• (0,1): Strictly bounded information fidelity interval
  • Strictly less than 1 (never perfect): acknowledges fundamental limits of transmission
  • Strictly greater than 0 (never absent): guarantees non-zero information content in valid frames
• ∀t ∈ T: For every moment in time within the protocol's operational timeframe

This constraint reflects information-theoretic limits:

1. Theoretical Foundation: Information transmission systems exhibit bounded fidelity due to physical limitations, encoding constraints, stochastic noise & shock, and temporal factors
2. Practical Implications: tightbeam’s design ensures frames always carry bounded information content while acknowledging that no communication system achieves perfect fidelity
3. Protocol Guarantee: The constraint provides a mathematical basis for frame validation and quality assurance

The I(t) constraint informs all protocol design decisions.

[^fidelity]: The degree of exactness with which something is copied or reproduced.

1.2 Requirements Language

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC2119.

2. Terminology

The following project terms MUST be used consistently:

• tightbeam: The project name. Lowercase as tightbeam.
• Frame: A versioned snapshot (state) at time t.
• Message: A typed application payload serialized within a Frame.
• Metadata: Per-message metadata as defined by the protocol.
• Version: The protocol version identifier.
• TIP: tightbeam Improvement Proposal.
• Information Theory Properties

Additional terms introduced by proposals MUST be defined in their respective TIPs.

3. Architecture

3.1 Information Theory Properties

tightbeam implements high-fidelity information transmission through the following properties:

• STRUCTURE: Perfect encoding via ASN.1 DER
• FRAME: Incremental versioning system
• IDEMPOTENCE: Unique message identification
• ORDER: Temporal sequencing via 64-bit integers
• COMPACTNESS: Enforceable compression
• INTEGRITY: Message digest validation
• CONFIDENTIALITY: Cipher-based encryption
• PRIORITY: 7-level priority system
• LIFETIME: 64-bit TTL values
• STATE: Previous message chaining
• MATRIX: N×N matrix-encoded control flags (N ∈ [1,255], row-major)
• NONREPUDIATION: Cryptographic signatures

4. Protocol Specification

4.1 Version Evolution

• VERSION 0

  • REQUIRED: Message identification (idempotence)
  • REQUIRED: Temporal ordering (64-bit integer)
  • OPTIONAL: Compression (enforceable compactness)

• VERSION 1

  • Inherits: All V0 features
  • OPTIONAL: Message integrity (digest)
  • OPTIONAL: Confidentiality (cipher)

• VERSION 2

  • Inherits: All V1 features
  • OPTIONAL: Priority levels (7-level enumeration)
  • OPTIONAL: Message lifetime (64-bit TTL)
  • OPTIONAL: State chaining (previous message integrity)
  • OPTIONAL: Matrix control (NxN matrix flags)

4.1.1 Security Profiles

tightbeam defines standardized security profiles that reference established cryptographic standards:

• Profile 0 (Testing): No mandatory security features

  • Use case: Development, testing, non-sensitive data
  • Security: Optional per version capabilities

• Profile 1 (Standard Security): TLS 1.3 equivalent security

  • Reference: RFC 8446 cipher suites
  • Mandatory: AES-GCM encryption, SHA-256/384 integrity
  • Key Exchange: Compatible with TLS 1.3 key schedule

• Profile 2 (High Security): NSA Suite B equivalent

  • Reference: RFC 6460, NIST SP 800-56A
  • Mandatory: AES-256-GCM, SHA-384, ECDSA P-384
  • Compliance: FIPS 140-2 Level 3 compatible

• Profile 3 (Future-Ready): Post-quantum resistant

  • Reference: NIST post-quantum standardization
  • Mandatory: Hybrid classical/post-quantum algorithms
  • Migration: Smooth transition path from Profile 2

4.1.2 Message-Level Security Requirements

tightbeam supports run-time security profile enforcement at the message type level through the Message trait and compile-time security enforcement at the message composition level:

pub trait Message: /* trait bounds */ {
	const MIN_VERSION: Version = Version::V0;
	const MUST_BE_NON_REPUDIABLE: bool = false;
	const MUST_BE_CONFIDENTIAL: bool = false;
	const MUST_BE_COMPRESSED: bool = false;
	const MUST_BE_PRIORITIZED: bool = false;
	const MUST_HAVE_MESSAGE_INTEGRITY: bool = false;
	const MUST_HAVE_FRAME_INTEGRITY: bool = false;
}

Security Requirement Semantics

• When a message type specifies MUST_BE_NON_REPUDIABLE = true, the Frame MUST include a nonrepudiation field
• When a message type specifies MUST_BE_CONFIDENTIAL = true, the Frame's metadata MUST include a confidentiality field
• When a message type specifies MUST_BE_COMPRESSED = true, the Frame's metadata compactness field MUST NOT be none
• When a message type specifies MUST_BE_PRIORITIZED = true, the Frame's metadata MUST include a priority field (V2+ only)
• The Frame's version field MUST be >= the message type's MIN_VERSION requirement

Profile-Message Type Mapping

• Security profiles MAY specify approved message types
• Message types with security requirements SHOULD be used with compatible security profiles
• Profile 0 (Testing) MAY use message types with security requirements for development purposes only

Implementation Enforcement

These requirements are enforced at:

• Compile Time: Type system prevents composition of messages that don't meet requirements
• Runtime Validation: Frame validation ensures expected frame shape to meet requirements
• Profile Compliance: Security profiles can reference message types with specific requirements

Derive Macro Usage

The #[derive(Beamable)] macro automatically implements the Message trait:

// This derive macro...
#[derive(Beamable, Sequence, Clone, Debug, PartialEq)]
#[beam(min_version = "V1", nonrepudiable, confidential)]
struct PaymentInstruction { /* fields */ }

// ...expands to:
impl Message for PaymentInstruction {
	const MIN_VERSION: Version = Version::V1;
	const MUST_BE_NON_REPUDIABLE: bool = true;
	const MUST_BE_CONFIDENTIAL: bool = true;

	const MUST_BE_COMPRESSED: bool = false;
	const MUST_BE_PRIORITIZED: bool = false;
	const MUST_HAVE_MESSAGE_INTEGRITY: bool = false;
	const MUST_HAVE_FRAME_INTEGRITY: bool = false;
}

Supported attributes:

• #[beam(message_integrity)] - Sets MUST_HAVE_MESSAGE_INTEGRITY = true
• #[beam(frame_integrity)] - Sets MUST_HAVE_FRAME_INTEGRITY = true
• #[beam(nonrepudiable)] - Sets MUST_BE_NON_REPUDIABLE = true
• #[beam(confidential)] - Sets MUST_BE_CONFIDENTIAL = true
• #[beam(compressed)] - Sets MUST_BE_COMPRESSED = true
• #[beam(prioritized)] - Sets MUST_BE_PRIORITIZED = true
• #[beam(min_version = "V1")] - Sets minimum protocol version
• WIP (UNSTABLE)
  • #[beam(profile = 1)] - Added but unsafe
  • #[beam(profile = 2)] - Added but unsafe
  • #[beam(profile = 3)]

Example Message Types

use tightbeam::Beamable;
use der::Sequence;

// High-security financial transaction
#[derive(Beamable, Sequence, Clone, Debug, PartialEq)]
#[beam(nonrepudiable, confidential, min_version = "V1")]
struct PaymentInstruction {
	account_from: String,
	account_to: String,
	amount: u64,
	currency: String,
}

// Bulk data transfer
#[derive(Beamable, Sequence, Clone, Debug, PartialEq)]
#[beam(compressed, prioritized, min_version = "V2")]
struct DataTransfer {
	dataset_id: String,
	data: Vec<u8>,
	checksum: [u8; 32],
}

// Development/testing message (no security requirements)
#[derive(Beamable, Sequence, Clone, Debug, PartialEq)]
struct TestMessage {
	test_id: u32,
	content: String,
}

// Critical system alert (requires all security features)
#[derive(Beamable, Sequence, Clone, Debug, PartialEq)]
#[beam(nonrepudiable, confidential, compressed, prioritized, min_version = "V2")]
struct SecurityAlert {
	severity: u8,
	source: String,
	description: String,
	timestamp: u64,
}

4.2 Frame Structure

All versions MUST include:

• Identifier
• Frame Version
• Order
• Message payload (bytecode)

All versions MAY include:

• Frame integrity (digest of complete structure)
• Non-repudiation (cryptographic signature)

4.3 Metadata Specification

#[derive(Sequence, Debug, Clone, PartialEq, Eq)]
#[cfg_attr(feature = "zeroize", derive(zeroize::ZeroizeOnDrop))]
pub struct Metadata {
	// Core fields (V0+)
	pub id: Vec<u8>,
	pub order: u64,
	#[asn1(optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub compactness: Option<CompressedData>,

	// V1+ fields
	#[asn1(context_specific = "0", optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub integrity: Option<DigestInfo>,
	#[asn1(context_specific = "1", optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub confidentiality: Option<EncryptedContentInfo>,

	// V2+ fields
	#[asn1(context_specific = "2", optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub priority: Option<MessagePriority>,
	#[asn1(context_specific = "3", optional = "true")]
	pub lifetime: Option<u64>,
	#[asn1(context_specific = "4", optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub previous_frame: Option<DigestInfo>,
	#[asn1(context_specific = "5", optional = "true")]
	pub matrix: Option<Asn1Matrix>,
}

4.4 Frame Encapsulation

#[derive(Sequence, Debug, Clone, PartialEq, Eq)]
#[cfg_attr(feature = "zeroize", derive(zeroize::ZeroizeOnDrop))]
pub struct Frame {
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub version: Version,
	pub metadata: Metadata,
	pub message: Vec<u8>,
	#[asn1(context_specific = "0", optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub integrity: Option<DigestInfo>,
	#[asn1(context_specific = "1", optional = "true")]
	#[cfg_attr(feature = "zeroize", zeroize(skip))]
	pub nonrepudiation: Option<SignerInfo>,
}

5. ASN.1 Formal Specification

This section provides the complete ASN.1 definitions for all tightbeam protocol structures, encoded using Distinguished Encoding Rules (DER).

5.1 Core Types

Version Enumeration

Version ::= ENUMERATED {
	v0(0),
	v1(1),
	v2(2)
}

Message Priority Levels

MessagePriority ::= ENUMERATED {
	critical(0),  -- System/security alerts, emergency notifications
	top(1),       -- High-priority interactive traffic, real-time responses
	high(2),      -- Important business messages, time-sensitive data
	normal(3),    -- Standard message traffic (default)
	low(4),       -- Non-urgent notifications, background updates
	bulk(5),      -- Batch processing, large data transfers, logs
	heartbeat(6)  -- Keep-alive signals, periodic status updates
}

5.2 Cryptographic Structures

tightbeam uses standard CMS (Cryptographic Message Syntax) structures from RFC 5652 and PKCS standards for cryptographic operations.

Digest Information (RFC 3447 - PKCS #1)

From RFC 3447 Section 9.2:

DigestInfo ::= SEQUENCE {
	digestAlgorithm  AlgorithmIdentifier,
	digest           OCTET STRING
}

Used in Metadata.integrity, Metadata.previous_frame``, and Frame.integrity fields.

Encrypted Content Information (RFC 5652 - CMS)

From RFC 5652 Section 6.1:

EncryptedContentInfo ::= SEQUENCE {
	contentType                 ContentType,
	contentEncryptionAlgorithm  ContentEncryptionAlgorithmIdentifier,
	encryptedContent            [0] IMPLICIT OCTET STRING OPTIONAL
}

Used in Metadata.confidentiality field for message-level encryption.

Signer Information (RFC 5652 - CMS)

From RFC 5652 Section 5.3:

SignerInfo ::= SEQUENCE {
	version                    CMSVersion,
	sid                        SignerIdentifier,
	digestAlgorithm            DigestAlgorithmIdentifier,
	signedAttrs                [0] IMPLICIT SignedAttributes OPTIONAL,
	signatureAlgorithm         SignatureAlgorithmIdentifier,
	signature                  SignatureValue,
	unsignedAttrs              [1] IMPLICIT UnsignedAttributes OPTIONAL
}

Used in Frame.nonrepudiation field for digital signatures.

Compressed Data (RFC 3274 - CMS)

From RFC 3274 Section 2:

CompressedData ::= SEQUENCE {
	version                    CMSVersion,
	compressionAlgorithm       CompressionAlgorithmIdentifier,
	encapContentInfo           EncapsulatedContentInfo
}

Used in Metadata.compactness field for message compression.

Matrix (TightBeam-specific)

Matrix ::= SEQUENCE {
	n     INTEGER (1..255),
	data  OCTET STRING (SIZE(1..(255*255)))  -- MUST be exactly n*n octets; row-major
}

5.4 Message Structure

Metadata Structure

Metadata ::= SEQUENCE {
	-- Core fields (V0+)
	id               OCTET STRING,
	order            INTEGER,
	compactness      CompressedData OPTIONAL,

	-- V1+ fields (context-specific tags)
	integrity        [0] DigestInfo OPTIONAL,
	confidentiality  [1] EncryptedContentInfo OPTIONAL,

	-- V2+ fields (context-specific tags)
	priority         [2] MessagePriority OPTIONAL,
	lifetime         [3] INTEGER OPTIONAL,
	`previous_frame`    [4] DigestInfo OPTIONAL,
	matrix           [5] Matrix OPTIONAL
}

Complete Frame Structure

Frame ::= SEQUENCE {
	version         Version,
	metadata        Metadata,
	message         OCTET STRING,
	integrity       [0] DigestInfo OPTIONAL,
	nonrepudiation  [1] SignerInfo OPTIONAL
}

5.5 External Dependencies

The protocol relies on standard ASN.1 structures from established RFCs.

Algorithm Identifier (RFC 5652)

From RFC 5652 Section 10.1.2:

AlgorithmIdentifier ::= SEQUENCE {
	algorithm   OBJECT IDENTIFIER,
	parameters  ANY DEFINED BY algorithm OPTIONAL
}

Implemented via the spki crate.

Compression Algorithm Identifiers (RFC 3274)

From RFC 3274 Section 2:

CompressionAlgorithmIdentifier ::= AlgorithmIdentifier

-- Standard compression algorithm OID
id-alg-zlibCompress OBJECT IDENTIFIER ::= { iso(1) member-body(2)
	us(840) rsadsi(113549) pkcs(1) pkcs-9(9) smime(16) alg(3) 8 }

-- TightBeam also supports zstd compression
id-alg-zstdCompress OBJECT IDENTIFIER ::= { 1 3 6 1 4 1 50274 1 1 }

Implemented via the cms crate.

Hash and Signature Algorithms (RFC 5246)

From RFC 5246 Section 7.4.1.4.1 (informative):

enum {
	none(0), md5(1), sha1(2), sha224(3), sha256(4), sha384(5),
	sha512(6), (255)
} HashAlgorithm;

enum { anonymous(0), rsa(1), dsa(2), ecdsa(3), (255) }
	SignatureAlgorithm;

Note: TightBeam implementations SHOULD use SHA-256 or stronger hash algorithms and SHOULD NOT use MD5 or SHA-1 for new deployments.

5.6 Encoding Rules

• Encoding: Distinguished Encoding Rules (DER) as specified in ITU-T X.690
• Byte Order: Network byte order (big-endian) for multi-byte integers
• String Encoding: UTF-8 for textual content, raw bytes for binary data
• Optional Fields: Absent optional fields MUST NOT be encoded (DER requirement)

5.7 Version-Specific Constraints

Version 0 (V0)

• REQUIRED: id, order, message
• OPTIONAL: compactness, integrity, nonrepudiation
• FORBIDDEN: All V1+ and V2+ specific fields

Version 1 (V1)

• INHERITS: All V0 requirements
• OPTIONAL: integrity (metadata level), confidentiality
• FORBIDDEN: All V2+ specific fields

Version 2 (V2)

• INHERITS: All V1 requirements
• OPTIONAL: priority, lifetime, previous_frame, matrix

5.8 Semantic Constraints

5.8.1 Message Ordering

• order field MUST be monotonically increasing within a message sequence
• order values SHOULD be based on reliable timestamp sources
• Duplicate order values within the same id namespace MUST be rejected

5.8.2 Compression Requirements

• When compactness is present (not None), the message field MUST contain compressed data encoded as CompressedData per RFC 3274
• The encapContentInfo within CompressedData MUST use the id-data content type OID if the compressed data does not conform to any other recognized content type
• Compression algorithm identifiers MUST be valid OIDs (e.g., id-alg-zlibCompress for zlib, custom OIDs for zstd -- tightbeam uses 1.2.840.113549.1.9.16.3 pending formal assignment)
• Compression level parameters, when specified in compressionAlgorithm.parameters, MUST be within algorithm-specific valid ranges

5.8.3 Previous Frame Chaining

• The previous_frame field creates a cryptographic hash chain linking frames
• Each frame's hash commits to all previous history through transitive hashing
• This enables:
  • Causal Ordering: Frames carry proof of their position in the sequence
  • Tamper Detection: Any modification to a previous frame breaks all subsequent hashes
  • Replay Protection: Receivers can detect out-of-sequence or duplicate frames
  • Fork Detection: Multiple frames with the same previous_frame indicate reality branching
  • Stateless Verification: Frame ancestry can be verified without storing the entire chain
• Implementations MAY store any frames to enable full chain reconstruction to their desired root

5.9 What is the Matrix?

The Matrix is a compact, flexible structure for transmitting state information. It uses a grid of cells, encoded with ASN.1 DER, to represent application-defined states with perfect structure, aligning with tightbeam's core constraint: $ I(t) \in (0,1) $.

5.9.1 Why Use the Matrix?

The matrix enables applications to:

• Pack Dense State: Store up to 255×255 values (0-255) in ~63.5 KB.
• Support Evolution: Extensible design ensures backward compatibility.
• Ensure Fidelity: Deterministic encoding and validation constrain I(t) ∈ (0,1).
• Enable Advanced Modeling: Combine with previous_frame for causal state tracking.

5.9.2 The Simple View

The matrix is a 2D grid where each cell holds a number from 0 to 255, with meanings defined by the application (e.g., flags, counters, states, functions). Mathematically, it is a 2D array ( M ) of size ( n \times n ) (( n \leq 255 )), with elements ( M[r,c] \in {0, \dots, 255} ). Maximum entropy for a full matrix is ( H = n^{2 \log_2 256 = 8n}2 ) bits, assuming uniform distribution. Sparse matrices, using fewer cells, have lower entropy (e.g., 8k bits for k used cells).

Key Dimensions:

1. Row (r): 0 to ( n-1 ), vertical position.
2. Column (c): 0 to ( n-1 ), horizontal position.
3. Value (( M[r,c] )): 0 to 255, application-defined dimension.

Example: A 2x2 matrix for a game state:

• ( M[0,0] = 1 ) (Player 1 at (0,0))
• ( M[1,1] = 2 ) (Player 2 at (1,1))
• ( M[0,1] = 0, M[1,0] = 0 ) (empty)
• Matrix coordinates can encode structured data like public keys.

5.9.3 Wire Format (Technical Details)

The matrix uses ASN.1 DER for deterministic serialization.

ASN.1 Schema (full matrix):

Matrix ::= SEQUENCE {
    n INTEGER (1..255),                 -- Grid size (n x n)
    data OCTET STRING (SIZE(1..65025))  -- Row-major cell values
}

Encoding & Performance:

• Layout: Row-major order, cell (r,c) at index ( r \cdot n + c ).
• Size: ( n \in [1, 255] ), data length ( n^2 ), max 65,025 bytes (~63.5 KB).
• State Space: ( 256^{n2} ) possible matrices.
• Entropy: ( H = 8n^2 ) bits (uniform distribution).
• Complexity: Encoding/decoding: O(n²). Length validation: O(1).

5.9.4 Usage Rules

To constrain ( I(t) \in (0,1) ):

• Encoding: Encoders MUST set data.len = n², filling cells with values 0-255.
• Decoding: Decoders MUST reject matrices where data.len != n² or values exceed 255.
• Semantics: Applications define value meanings (e.g., 1 = "active", public key bytes).
• Unspecified Cells: Receivers SHOULD ignore non-zero values in undefined cells to support evolvability.
• Absent Matrix: If the matrix field is omitted, applications MAY assume a default state.

5.9.5 Example: Flag System

Set diagonal flags in a 3x3 matrix:

use tightbeam::Matrix;

// Full 3x3 matrix
let mut matrix = Matrix::<3>::default();
matrix.set(0, 0, 1)?; // Feature A: enabled
matrix.set(1, 1, 1)?; // Feature B: enabled
matrix.set(2, 2, 0)?; // Feature C: disabled

// Embed in a frame
let frame = compose! {
    V1: id: "config-001",
        order: 1000,
        message: my_message,
        matrix: Some(matrix)
}?;

Visualization (full):

[1, 0, 0]
[0, 1, 0]
[0, 0, 0]

This supports up to 255 flags, extensible by adding new diagonal entries. For structured data, use non-diagonal cells (e.g., ( M[0,1] = 10 ) for a count, or map public keys to coordinate regions).

5.9.6 Advanced: Reality Modeling with Matrix and Previous Frame

The matrix, combined with the previous_frame field, enables sophisticated state tracking, modeled as a directed acyclic graph (DAG) of state transitions. Mathematically, frames form a Markov chain where each matrix ( M_t ) at time t depends on ( M_{t-1} ), linked via cryptographic hashes in previous_frame.

State Evolution:

• Snapshots: Each matrix ( M_t ) is a state snapshot, with entropy up to ( 8n^2 ) bits.
• Causal Links: previous_frame hashes ensure a DAG, where ( M_t \to M_{t-1} ) via hash verification.
• Transitions: Changes in ( M_t[r,c] ) across frames model state updates.
• Branching: Multiple frames sharing a previous_frame but differing in ( M_t ) represent alternative states.

Mathematical Model: Applications define a transition probability ( P(M_t | M_{t-1}) ), where changes reflect logic or noise. For example, ( I(t) = I(M_t; M_{t-1}) / H(M_t) \in (0,1) ) may measure fidelity based on shared state, but I(t) is application-defined, constrained by hash consistency and partial state recovery.

Applications:

• Consensus: Nodes propose ( M_t ), converging on a canonical DAG path.
• Event Sourcing: Frames as immutable events, with ( M_t ) capturing state.
• Speculative Execution: Fork ( M_t ) for "what-if" states, merge via consensus.
• Replication: Causal links enable conflict-free merging, as nodes reconstruct the DAG.
• Tamper Detection: Hash mismatches break the chain, ensuring I(t) > 0 only for valid states.

5.9.7 Summary

The matrix supports flexible state representation, from simple flags to structured data encoding allowing for dynamic computation.

5.10 Complete ASN.1 Module

tightbeam-Protocol-V2 DEFINITIONS EXPLICIT TAGS ::= BEGIN

-- Import standard structures from CMS and PKCS
IMPORTS
	AlgorithmIdentifier FROM PKCS-1
		{ iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) pkcs-1(1) },
	DigestInfo FROM PKCS-1
		{ iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) pkcs-1(1) },
	CompressedData FROM CMS-2004
		{ iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) pkcs-9(9) smime(16) modules(0) cms-2004(24) },
	EncryptedContentInfo, SignerInfo FROM CMS-2004
		{ iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) pkcs-9(9) smime(16) modules(0) cms-2004(24) };

-- Core protocol version
Version ::= ENUMERATED {
	v0(0),
	v1(1),
	v2(2)
}

-- Message priority enumeration
MessagePriority ::= ENUMERATED {
	critical(0),
	top(1),
	high(2),
	normal(3),
	low(4),
	bulk(5),
	heartbeat(6)
}

-- TightBeam-specific matrix structure
Matrix ::= SEQUENCE {
	n     INTEGER (1..255),
	data  OCTET STRING (SIZE(1..(255*255)))  -- MUST be exactly n*n octets; row-major
}

-- Core message structures
Metadata ::= SEQUENCE {
	id               OCTET STRING,
	order            INTEGER,
	compactness      CompressedData OPTIONAL,
	integrity        [0] DigestInfo OPTIONAL,
	confidentiality  [1] EncryptedContentInfo OPTIONAL,
	priority         [2] MessagePriority OPTIONAL,
	lifetime         [3] INTEGER OPTIONAL,
	previous_frame   [4] DigestInfo OPTIONAL,
	matrix           [5] Matrix OPTIONAL
}

Frame ::= SEQUENCE {
	version         Version,
	metadata        Metadata,
	message         OCTET STRING,
	integrity       [0] DigestInfo OPTIONAL,
	nonrepudiation  [1] SignerInfo OPTIONAL
}

END

6. Implementation

6.1 Requirements

Implementations MUST provide:

• Memory safety AND ownership guarantees (Rust)
• ASN.1 DER encoding/decoding
• Frame and Metadata as specified as ASN.1
• Message-level security requirement enforcement

Implementations MUST OPTIONALLY provide:

• Abstract Layer-4 transport with async/sync
• Cryptographic abstraction for confidentiality, integrity and non-repudiation

6.1.1 Message Security Enforcement

Implementations MUST enforce message-level security requirements through:

Compile-Time Validation

• Type system integration to prevent unsafe message composition
• Trait-based constraints that enforce security requirements at build time
• Version compatibility checking during message type definition

Runtime Validation

• Frame validation against message type requirements during encoding/decoding
• Security profile compliance verification
• Graceful error handling for requirement violations

Example Implementation Pattern

impl<T: Message> FrameBuilder<T> {
	fn validate(&self) -> Result<()> {
		// Check minimum version requirement
		if self.version < T::MIN_VERSION {
			return Err(TightBeamError::UnsupportedVersion(ExpectError::from((
				self.version,
				T::MIN_VERSION,
			))));
		}

		// Check if encryption is set when required
		let has_encryption = self.encryptor.is_some();
		if T::MUST_BE_CONFIDENTIAL && !has_encryption {
			return Err(TightBeamError::MissingEncryptionInfo);
		}

		// Check if signature is set when required
		let has_signer = self.signer.is_some();
		if T::MUST_BE_NON_REPUDIABLE && !has_signer {
			return Err(TightBeamError::MissingSignatureInfo);
		}

		// Check if compression is set when required
		let has_compression = self.compressor.is_some();
		if T::MUST_BE_COMPRESSED && !has_compression {
			return Err(TightBeamError::MissingCompressedData);
		}

		let has_message_integrity = self.metadata_builder.has_hash();
		if T::MUST_HAVE_MESSAGE_INTEGRITY && !has_message_integrity {
			return Err(TightBeamError::MissingDigestInfo);
		}

		let has_frame_integrity = self.witness.is_some();
		if T::MUST_HAVE_FRAME_INTEGRITY && !has_frame_integrity {
			return Err(TightBeamError::MissingDigestInfo);
		}

		// Check if priority is set when required
		if T::MUST_BE_PRIORITIZED && !self.metadata_builder.has_priority() {
			return Err(TightBeamError::MissingPriority);
		}

		Ok(())
	}
}

6.2 Transport Layer

tightbeam MUST operate over ANY transport protocol:

• TCP (built-in async/sync support)
• Custom transports via trait implementation

6.3 Key Management Integration

tightbeam integrates with existing key management standards and infrastructure:

6.3.1 Public Key Infrastructure

• Certificates: X.509 certificates per RFC 5280
• Certificate Chains: Standard PKI validation chains
• Certificate Revocation: CRL (RFC 5280) or OCSP (RFC 6960)
• Enterprise Integration: Compatible with existing CA infrastructure

6.3.2 Key Exchange and Distribution

• Key Schedule: Compatible with TLS 1.3 key derivation (RFC 8446)
• Ephemeral Keys: ECDHE key exchange per NIST SP 800-56A
• Key Agreement: Follows NIST SP 800-56A/B/C recommendations
• Perfect Forward Secrecy: Ephemeral key exchange for session keys

6.3.3 Key Lifecycle Management

• Key Rotation: Follow NIST SP 800-57 Part 1 guidelines
• Key Escrow: Integration with enterprise key management systems
• Hardware Security: HSM compatibility for key storage
• Key Derivation: HKDF (RFC 5869) for session key derivation

6.3.4 Enterprise Integration

• PKCS#11: Hardware token and HSM integration
• Key Management Systems: Compatible with enterprise KMS
• Directory Services: LDAP/Active Directory certificate lookup
• Policy Enforcement: Supports organizational key policies

7. Security Considerations

7.1 Cryptographic Requirements

• Integrity MUST use cryptographically secure hash functions
• Confidentiality MUST use authenticated encryption (AEAD)
• Non-repudiation MUST use digital signatures with secure key pairs

7.2 Version Security

• V0: No security features
• V1: Optional integrity and confidentiality support
• V2: Enhanced with priority, lifetime, state chaining, and matrix controls

7.3 ASN.1 Security Considerations

• DER encoding prevents ambiguous parsing attacks
• Context-specific tags prevent field confusion
• Explicit versioning prevents downgrade attacks
• Optional field handling prevents injection attacks

7.4 Cryptographic Algorithm Policy

tightbeam follows established cryptographic standards and maintains algorithm agility:

7.4.1 Approved Algorithms

• Current Standards: NIST FIPS 140-2/3 approved algorithm lists
• Symmetric Encryption: AES (FIPS 197), ChaCha20-Poly1305 (RFC 8439)
• Hash Functions: SHA-2 (FIPS 180-4), SHA-3 (FIPS 202)
• Digital Signatures: ECDSA (FIPS 186-4), EdDSA (RFC 8032)
• Key Exchange: ECDH (NIST SP 800-56A), X25519 (RFC 7748)

7.4.2 Algorithm Deprecation Schedule

• Transition Guidelines: NIST SP 800-131A Rev. 2 compliance
• Legacy Support: Controlled deprecation with migration periods
• Vulnerability Response: Rapid algorithm disabling capability
• Industry Alignment: Follow IETF/RFC security considerations

7.4.3 Post-Quantum Cryptography

• Preparation: Monitor NIST post-quantum standardization process
• Hybrid Approach: Classical + post-quantum algorithm combinations
• Migration Strategy: Gradual transition from classical to post-quantum
• Interoperability: Maintain backward compatibility during transition

7.4.4 Algorithm Identifier Management

• OID Registry: Use standard algorithm OIDs from IANA/ITU-T
• Parameter Validation: Enforce minimum key sizes and parameters
• Algorithm Negotiation: Support for algorithm capability discovery
• Security Policy: Configurable algorithm allow/deny lists

8. Network Theory

8.1 Network Architecture

• Egress/Ingress policy management
• Retry and Egress client policy
• Service orchestration via Colony Monodomy/Polydomy patterns

8.2 Efficient Exchange-Compute Interconnect

The Efficient Exchange-Compute Interconnect or EECI is a software development paradigm inspired by the entymological world. As threads and tunnels underpin the basics of processing and communication, we can start at these base levels and develop from here. The goal of EECI is to operate on these base layers across any transmission protocol:

• thread-thread.
• thread-port-thread.

8.3 Components

There are four main components to the EECI:

• E Workers - Efficient processing units
• E Servlets - Exchange endpoints
• C Clusters - Compute orchestration
• I Drone/Hive - Interconnected infrastructure

Think of workers as ants, servlets as ant hills, and clusters as ant colonies. Insects have specific functions for which they process organic matter using local information. These functions are often simple, but when combined in large numbers, they can perform complex tasks. The efficiency of each unit is attributed to their fungible nature--how well it can accomplish its singular task.

8.3.1 E: Workers

Workers are the smallest unit of computation. They must be single-threaded and handle a single message at a time. Workers are the "ants" of the EECI. Insects have a head, thorax, and abdomen. Workers have the following similarly inspired structure:

tightbeam::worker! {
	name: PingPongWorker<RequestMessage, PongMessage>,
	config: {
		response: &str,
	},
	policies: {
		with_receptor_gate: [PingGate]
	},
	handle: |_message, config| async move {
		PongMessage {
			result: config.response.to_string(),
		}
	}
}

Not unlike supraorganisms, we can name them, and their "head" may possess a specific configuration (config). They may or may not have receptors which can be used to optionally gate messages. The "thorax" is itself the container for which isolates the entity within its own scoped thread--locality. Finally, its "abdomen" is the handle which digests the message and produces a response.

The important thing to note is that workers operate on local information within their bounded scope. They are not aware of the larger system and only operate on the message they are given. This is a critical aspect of the EECI and allows for a high degree of parallelism and fault tolerance. As a result, they do not have access to the full Frame nor should they need it.

Testing

Testing workers is simple and a container is provided:

tightbeam::test_worker! {
	name: test_ping_pong_worker,
	setup: || {
		PingPongWorker::start()
	},
	assertions: |worker| async move {
		// Test accepted message
		let ping_msg = RequestMessage {
			content: "PING".to_string(),
			lucky_number: 42,
		};
		let response = worker.relay(ping_msg).await?;
		assert_eq!(response, Some(PongMessage { result: "PONG".to_string() }));

		// Test rejected message
		let pong_msg = RequestMessage {
			content: "PONG".to_string(),
			lucky_number: 42,
		};

		let result = worker.relay(pong_msg).await;
		assert!(matches!(result, Err(WorkerRelayError::Rejected(_))));

		Ok(())
	}
}

8.3.2 E: Servlets

Servlets are "anthills" in the sense they operate on a specific protocol. From a TCP/IP perspective, an anthill is a port in many ways. Servlets are multi-threaded and must handle messages asynchronously. A servlet may also define as many different workers as it needs to accomplish its task as well as a set of configurations. Servlets must be provided a relay which is used to relay Message types to the worker without the entire Frame.

tightbeam::servlet! {
	name: PingPongServletWithWorker,
	protocol: Listener,
	config: {
		lotto_number: u32
	},
	workers: |config| {
		ping_pong: PingPongWorker = PingPongWorker::start(),
		lucky_number: LuckyNumberDeterminer = LuckyNumberDeterminer::start(LuckyNumberDeterminerConf {
			lotto_number: config.lotto_number,
		})
	},
	handle: |message, _config, workers| async move {
		let decoded = crate::decode::<RequestMessage, _>(&message.message).ok()?;
		let (ping_result, lucky_result) = tokio::join!(
			workers.ping_pong.relay(decoded.clone()),
			workers.lucky_number.relay(decoded.clone())
		);

		let reply = match ping_result {
			Ok(reply) => reply,
			Err(_) => return None,
		};

		let is_winner = match lucky_result {
			Ok(is_winner) => is_winner,
			Err(_) => return None,
		};

		crate::compose! {
			V0: id: message.metadata.id.clone(),
				message: ResponseMessage {
					result: reply.result,
					is_winner,
				}
		}.ok()
	}
}

Workers may process the message in parallel and have the results combined into a single response.

Testing

Testing servlets is simple and a container is provided:

tightbeam::test_servlet! {
	name: test_servlet_with_workers,
	worker_threads: 2,
	protocol: Listener,
	setup: || {
		PingPongServletWithWorker::start(PingPongServletWithWorkerConf {
			lotto_number: 42,
			expected_message: "PING".to_string(),
		})
	},
	assertions: |client| async move {
		fn generate_message(
			lucky_number: u32,
			content: Option<String>
		) -> Result<crate::Frame, crate::TightBeamError> {
			let message = RequestMessage {
				content: content.unwrap_or_else(|| "PING".to_string()),
				lucky_number,
			};

			crate::compose! { V0: id: b"test-ping", message: message }
		}

		// Test winning case
		let ping_message = generate_message(42, None)?;
		let response = client.emit(ping_message, None).await?;
		let response_message = crate::decode::<ResponseMessage, _>(&response.unwrap().message)?;
		assert_eq!(response_message.result, "PONG");
		assert!(response_message.is_winner);

		Ok(())
	}
}

8.3.3 C: Clusters

Clusters orchestrate multiple servlets and workers. They are the "ant colonies" of the EECI. Colonies are made up of multiple servlets which command different workers. Clusters are multi-threaded and must handle messages asynchronously. Clusters may also define a configuration and as many different servlets as it needs to handle its purpose. While servlets are given a relay, clusters must be provided a router. Routers can emit messages to the servlets registered within the cluster.

TODO

8.3.4 I: Drones & Hives

Drones are containerized servlet runners that can dynamically morph between different servlet types based on command messages from a cluster. This allows you to seed your application over a specific protocol and then morph into any known servlet type at runtime.

Hives are an extension of drones that can manage multiple servlets simultaneously. They are useful for managing a pool of servlets that can be activated on demand. Hives must only be available on Mycelial protocols which support multiple ports per address. Hives should automatically maintain exactly the number of servlets required to efficiently process messages from the cluster.

"Mycelial" Protocols

Protocols such as TCP are considered "mycelial" as they operate over a single address but can have multiple ports (SocketAddress). This allows the hive to establish a servlet on different ports and provide the protocol address to the cluster so it can register it under its hive.

TODO

Conclusion

How you wish to model your colonies is beyond the scope of this document. However, it is important to understand the basic building blocks and how they can be combined to create complex systems. The swarm is yours to command.

9. Testing Framework

Full end-to-end containerized testing framework

• Asynchronous/synchronous containerized end-to-end testing
• Client/server "quantum tunneling" via MPSC channels

9.1 Quantum Entanglement Testing

These are our three "entangled particles" for our test.

// Server handler channel: tx for server, rx for container
let (tx, rx) = mpsc::channel();

// Status channels (container receives ok/reject)
let (ok_tx, ok_rx) = mpsc::channel();
let (reject_tx, reject_rx) = mpsc::channel();

// Exposed in test as single tuple
let channels = (rx, ok_rx, reject_rx);

Message Flow Sequence

1. Client emits a message
2. The server MAY receive the message
3. The gate MAY reject the message and MUST tell reject_tx
   • If so, the client SHOULD[^mpsc] hear from reject_rx
   • If not, the gate tells ok_tx and the client SHOULD hear from ok_rx
4. The server handles the message and MAY arbitrarily talk to tx
   • If so, the client SHOULD hear from rx
5. The server MAY respond with a message

[^mpsc]: MPSC ops MAY return Empty while polling; Disconnect occurs at teardown.

service: |message, tx| async move {
    tightbeam::relay!(ServiceAssertChecklist::ContainerMessageReceived, tx)?;

    let decoded = tightbeam::decode::<RequestMessage, _>(&message.clone().message).ok()?;
    if &decoded.content == "PING" {
        tightbeam::relay!(ServiceAssertChecklist::ContainerPingReceived, tx)?;

        let response = Some(tightbeam::compose! {
            V0: id: message.metadata.id.clone(),
                message: ResponseMessage {
                    result: "PONG".into()
                }
        }.ok()?);

        tightbeam::relay!(ServiceAssertChecklist::SentResponse, tx)?;
        response
    } else {
        None
    }
}

6. The client MAY receive a response or error or timeout
   • If no response, None
   • If response, Some(Frame)
   • If error, Err(TransportError)
7. The client MAY process the response and can now determine:
   • What the client sent
   • What the gate accepted or rejected
   • What the server wants to assert
   • What the server responded with
   • What the client received

Container is in a "Quantum State" before the client gets the response. The "wave function collapses" when await completes--causality intact. You can now observe the results of rx, ok_rx, and reject_rx:

let decoded = if let Some(response) = client.emit(message.clone(), None).await? {
    // Collect checklist items
    assert_recv!(rx, ServiceAssertChecklist::ContainerMessageReceived);
    assert_recv!(rx, ServiceAssertChecklist::ContainerPingReceived);
    assert_recv!(rx, ServiceAssertChecklist::SentResponse);
    // Verify response metadata
    assert_eq!(response.metadata.id, message.metadata.id);
    // Ensure we received the message on the server side
    assert_recv!(ok_rx, message);
    // Ensure server did not reject
    assert_channels_quiet!(reject_rx);

    tightbeam::decode::<ResponseMessage, _>(&response.message).ok()
} else {
    panic!("Expected a response from the service");
};

This occurs while ensuring each client and server operate within their own scope in a single containerized test. Channels are automatically cleaned up.

See: Container Integration Test

10. Examples

10.1 Basic Test Container

/// Checklist for container assertions
#[derive(Enumerated, Beamable, Copy, Clone, Debug, PartialEq)]
#[repr(u8)]
enum ServiceAssertChecklist {
	ContainerMessageReceived = 1,
	ContainerPingReceived = 2,
	SentResponse = 3,
}

test_container! {
	name: container_gates_basic,
	worker_threads: 2,
	protocol: Listener,
	service_policies: {
		with_collector_gate: [policy::AcceptAllGate]
	},
	client_policies: {
		with_emitter_gate: [policy::AcceptAllGate],
		with_restart: [RestartLinearBackoff::new(3, 1, 1, None)]
	},
	service: |message, tx| async move {
		tightbeam::relay!(ServiceAssertChecklist::ContainerMessageReceived, tx)?;

		let decoded = tightbeam::decode::<RequestMessage, _>(&message.clone().message).ok()?;
		if &decoded.content == "PING" {
			tightbeam::relay!(ServiceAssertChecklist::ContainerPingReceived, tx)?;

			let response = Some(tightbeam::compose! {
				V0: id: message.metadata.id.clone(),
					message: ResponseMessage {
						result: "PONG".into()
					}
			}.ok()?);

			tightbeam::relay!(ServiceAssertChecklist::SentResponse, tx)?;
			response
		} else {
			None
		}
	},
	container: |client, channels| async move {
		use tightbeam::transport::MessageEmitter;

		let (rx, ok_rx, reject_rx) = channels;

		// Compose a simple V0 message
		let message = tightbeam::compose! {
			V0: id: b"request",
				message: RequestMessage {
					content: "PING".into()
				}
		}?;

		//# Test message transport

		// Send and expect acceptance + echo response
		let decoded = if let Some(response) = client.emit(message.clone(), None).await? {
			// Collect checklist items
			assert_recv!(rx, ServiceAssertChecklist::ContainerMessageReceived);
			assert_recv!(rx, ServiceAssertChecklist::ContainerPingReceived);
			assert_recv!(rx, ServiceAssertChecklist::SentResponse);
			// Verify response metadata
			assert_eq!(response.metadata.id, message.metadata.id);
			// Ensure we received the message on the server side
			assert_recv!(ok_rx, message);
			// Ensure server did not reject
			assert_channels_quiet!(reject_rx);

			tightbeam::decode::<ResponseMessage, _>(&response.message).ok()
		} else {
			panic!("Expected a response from the service");
		};

		//# Test message shape

		match decoded {
			Some(reply) => {
				assert_eq!(reply.result, "PONG");
			},
			None => panic!("Expected a PONG")
		};

		Ok(())
	}
}

11. References

11.1 Normative References

• RFC 2119: Key words for use in RFCs to Indicate Requirement Levels
• ITU-T X.690: ASN.1 Distinguished Encoding Rules (DER)
• RFC 3274: Compressed Data Content Type for Cryptographic Message Syntax (CMS)
• RFC 3447: Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1
• RFC 5246: The Transport Layer Security (TLS) Protocol Version 1.2
• RFC 5280: Internet X.509 Public Key Infrastructure Certificate and CRL Profile
• RFC 5480: Elliptic Curve Cryptography Subject Public Key Information
• RFC 5652: Cryptographic Message Syntax (CMS)
• RFC 5869: HMAC-based Extract-and-Expand Key Derivation Function (HKDF)
• RFC 6460: Suite B Profile for Transport Layer Security (TLS)
• RFC 6960: X.509 Internet Public Key Infrastructure Online Certificate Status Protocol (OCSP)
• RFC 7748: Elliptic Curves for Security
• RFC 8032: Edwards-Curve Digital Signature Algorithm (EdDSA)
• RFC 8439: ChaCha20 and Poly1305 for IETF Protocols
• RFC 8446: The Transport Layer Security (TLS) Protocol Version 1.3

11.2 Standards References

• FIPS 140-2: Security Requirements for Cryptographic Modules
• FIPS 140-3: Security Requirements for Cryptographic Modules
• FIPS 180-4: Secure Hash Standard (SHS)
• FIPS 186-4: Digital Signature Standard (DSS)
• FIPS 197: Advanced Encryption Standard (AES)
• FIPS 202: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions
• NIST SP 800-56A: Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography
• NIST SP 800-57: Recommendation for Key Management: Part 1 - General
• NIST SP 800-131A: Transitioning the Use of Cryptographic Algorithms and Key Lengths

11.3 ASN.1 References

• ITU-T X.680: ASN.1 Specification of basic notation
• ITU-T X.681: ASN.1 Information object specification
• ITU-T X.682: ASN.1 Constraint specification
• ITU-T X.683: ASN.1 Parameterization of ASN.1 specifications
• RFC 2474: Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
• RFC 3246: An Expedited Forwarding PHB (Per-Hop Behavior)
• ITU-T X.400: Message Handling Systems (MHS): System and service overview
• ITU-T X.420: Message Handling Systems (MHS): Interpersonal messaging system

12. License

For Users (Outbound Licensing)

This project is licensed under either of

• Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
• MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)

at your option. You may choose whichever license best fits your needs:

• Choose MIT if you prefer simplicity and broad compatibility
• Choose Apache-2.0 if you want explicit patent protection and retaliation clauses

For Contributors (Inbound Licensing)

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

This means contributors grant rights under BOTH licenses, providing:

• MIT's simplicity for users who prefer it
• Apache-2.0's patent grants for enhanced protection

13. Implementation Notes

Project Structure

The workspace consists of the following components:

• tightbeam/src/core.rs: Shared library code and common utilities
• tightbeam/src/lib.rs: Library root
• tightbeam/tests/: Integration test suites

Future

• tightbeam-os
• tightbeam-dna
• tightbeam-gate