Structure as Storage
A study in rule-constrained symbolic steganography. Exploring the embedding of encrypted entropy into legal chess notation, where integrity becomes a mathematical inevitability.
Information
Density
Symbolic throughput metrics.
Total Message Size (Bits) Encoded
Total PGN Length Encoded
Total Plies
Total Variations
Total Encoding Time
The Thesis
Traditional steganography relies on concealment within media noise (pixels, frequencies). This project validates a different approach: Constraint-Based Embedding. By mapping ciphertext to the decision-tree of a chess engine, we create a carrier where validity is binary. A file is either perfectly legal chess PGN, or it is broken. There is no middle ground for tampering.
Universal Substrate
Chess rules are global constants, providing a verifiable ground truth independent of the carrier.
Deterministic Entropy
Chaos (ciphertext) is transmuted into Order (valid moves) via strict, reversible logic.
System Properties
Mechanismless properties of rule-bound information.
AES-256-GCM
Authenticated confidentiality with 128-bit integrity tags.
UCI-Lexicographical Mapping
Deterministic integer-to-move conversion mapping algorithm.
Plausible Deniability
Statistical indistinguishability from human play variations.
Verifiable Syntax
Output is indistinguishable from valid game records.
Unbounded Capacity
Recursive variation tree scaling for arbitrary payload sizes.
Foundational Logic
System Constraints
Unlike media steganography, rule-bound systems do not degrade. However, they demand exactness. This details the boundary between information existence and game legality.
Adversary Model
Kerckhoffs's Principle
Crypto Primitive
AES-256-GCM
Integrity
Rule-Bound
Detection
Behavioral
Observation Through Structure
Entropy Bound to Rules
"When information is bound to structure, correctness ceases to be optional."
Final Observation
The Inevitability of Structure
Non-Optional Correctness
100%
Consistency maintained across all experimental validations.
Bound Integrity
∞
Recursive variation logic allows for theoretical infinite expansion of carrier move-space.
Rule-Based Truth
High
Move-selection alignment with UCI-grade engine heuristics.
Clarity Over Deployment
Information need not be static. It can be a performance of rules. This demonstration invites a shift in how we perceive the permanence of digital records.
Public Observation
"Making this principle publicly observable through an interactive demonstration."
Scientific Context
"Invites reconsideration across scientific, educational, and archival contexts."
Observe the Interaction
Step into the demonstration to observe how information binds to structure.
Research Lab
Independently Proven