Counter-Rotating Aperture Resolution: A Formal Stream-Processing Model for SHA-256 Recurrence, Root-Cover Coupling, and Transformer Language Attention
Year: 2026
Type: dissertation
Abstract: Counter-Rotating Aperture Resolution: A Formal Stream-Processing Model for SHA-256 Recurrence, Root-Cover Coupling, and Transformer Language Attention Driven By Dean A. Kulik May 2026 Abstract This paper formalizes Counter-Rotating Aperture Resolution (CRAR): a model in which a fixed aperture and a moving data surface produce output through relative phase contact. The central claim is operational rather than metaphoric: a static output, or “still,” cannot identify the stream that generated it. A stream is an operator, recurrence, or transition law, and it is exposed only through controlled perturbation across the aperture. The theory is developed in three stages. First, we define stills, streams, apertures, and counter-rotating domains using a train-and-circle model. A processor may remain externally fixed while an oppositely moving surface passes beneath it; computation occurs at the contact point, not in absolute translation. Second, we instantiate the model in the SHA-256 message schedule. The lag set and seed width generate the aperture complement which organizes the direct-entry taxonomy. The first two expanded words have parent apertures whose unique intersection is . Thus is the Root-Cover Axis: the unique seed word that directly seeds both expansion roots and , has , has clean echo set , and saturates immediately at . The result is then correctly bounded: is the first triple-entry, length-sensitive face-selection hinge, while is the global coupling axis. Third, we translate the mathematics into transformer attention. Causal language models process symbolic streams by passing prompt tokens across fixed weights and a causal mask. Attention is not simple forward reading; it is counter-rotating aperture contact between a forward token stream and a backward-facing context field. We distinguish a forbidden seam, implemented by the causal mask for , from a balance seam, such as equal-score or orthogonality surfaces in . The SHA-to-transformer mapping is stated as a testable transport hypothesis, not as a completed proof. The result is a unified mathematical paper on why the word is the still, meaning is the stream crossing it, and controlled perturbation is the method that reveals the operator. 1. Scope and Thesis The working principle is: A still is a projected state. A stream is the transition law that moves states. If only the final state is observed, the underlying operator is generally non-identifiable. This matters for cryptographic schedules, language models, and any symbolic processor whose visible output hides the internal recurrence. In SHA-256, the final digest is a still. The message schedule is the stream. In language, a word token is a still. Meaning is the stream crossing the token through context, memory, and prediction. In both cases, the correct object is not the output value, but the preserved transition structure exposed by perturbation. This paper therefore studies the operator geometry rather than the final output. This paper does not claim a break of SHA-256. It does not claim that transformer attention has been fully proven equivalent to SHA-256 recurrence. It extracts the shared mathematics of aperture, counterflow, recurrence, masking, contamination, saturation, and projection. 2. Stills, Streams, and Operators Let denote a system state at discrete time . A still is a projection of a state: A stream is the transition law: or, more generally, The differential view is The still is residue. The stream is recurrence. 2.1 Static Non-Identifiability Lemma Lemma 2.1. Let be a many-to-one projection. Given only , the transition operator that generated is not uniquely identifiable. Proof. Since is many-to-one, there exist distinct states such that . There may exist distinct transition operators and and initial states satisfying Both generate the same projected still . Therefore alone cannot determine the stream operator. 2.2 Perturbation Principle A stream is exposed by controlled perturbation: Define a perturbation-response map for differentiable systems, or a Boolean contamination recurrence for discrete systems. The operator becomes visible through where motion can and cannot propagate. Thus: 3. The Train-Circle Model of Counter-Rotating Recursion Consider a train moving linearly: On the train is a circular recursive domain of radius with angular phase A point on the circle has global position The train moves forward in global time, but the circular domain returns to previous local phase states: Thus the system does not reverse external time; it returns to a previous domain state. 3.1 Radius as Phase Curvature The tangential velocity on the circle is At the center, , the point follows the train: Near the rim, phase dominates. Therefore: 3.2 Counter-Rotating Surface Now suppose an observer attempts to walk one way while the circular surface moves the opposite way. Let Then the observer has no external displacement: But the surface still passes beneath the contact point. The relative velocity is So processing can occur even while the observer does not move globally. The contact point becomes a read head. This is the central physical image of CRAR: 4. Counter-Rotating Aperture Resolution A counter-rotating aperture system is a tuple where: • is the moving data stream. • is the fixed or slowly varying geometric field. • is the hard constraint or mask. • is the aperture contact operator. • is the final projection or readout. The local contact state is The output still is The data stream may move forward while the aperture reaches backward into prior states: This gives the CRAR law: 5. SHA-256 Message Schedule as a Counter-Rotating Aperture The SHA-256 message schedule expands a 16-word seed window into using The SHA-256 schedule functions are The lag set is The seed width is Each expanded word is a contact point between a forward index and a backward lag field: Therefore the schedule is not only forward diffusion. It is a forward execution that continually reads backward. 6. Aperture Complement Law For a recurrence with seed width and lag set , define the aperture complement For SHA-256: Sorted: These are the seed coordinates that first become visible at the expansion boundary. The first expanded word is Thus the first aperture parent set is The four coordinates are not arbitrary. They are the direct readout of the lag complement. 7. Direct-Entry Spectrum For seed word , , direct appearances in the expansion occur when one of the recurrence slots equals : with . Therefore the direct-entry set is The entry cardinality is Thus the seed window partitions as The boundary is structural because It is the first seed word that can enter the expansion zone through the raw slot. 8. The Root-Cover Axis Theorem The aperture complement identifies . The next expanded word gives the odd-chain root: Hence Theorem 8.1 - Root-Cover Axis The unique seed coordinate shared by the first even-chain root and the first odd-chain root is . Proof. Compute the intersection: Therefore is the unique shared seed parent of both expansion roots. 8.1 Direct Root Coverage For , Thus directly enters both and . These are consecutive expansion words. Therefore, in the contamination recurrence, Since a consecutive dirty pair exists at the first expansion boundary, saturation is immediate: The clean echo set is empty: This proves that is not merely a hinge vertex. It is the universal root-cover axis and global pinch point of the schedule. 9. Even/Odd Root Chains The first two expansion roots divide the recurrence into initial parity chains: The parent sets are Thus the structural hierarchy is W[1] = universal root-cover axis | |-- W[16] even root | parents: {W[0], W[1], W[9], W[14]} | even chain: 16,18,20,22,... | `-- W[17] odd root parents: {W[1], W[2], W[10], W[15]} odd chain: 17,19,21,23,... This resolves the role separation: 10. W[9] as First Triple-Entry Face-Selection Hinge For , The three direct entries are: Thus enters as at is the triple convergence point because three of its four inputs carry contamination: • carries the slow arm from . • carries the fast arm from . • re-enters directly through the slot. The fourth input, , is clean relative to at that point. 11. Contamination Recurrence and Clean Echo Sets For a fixed seed , define if depends on , and otherwise. The seed condition is The contamination recurrence is The clean echo set is The saturation threshold is the first index such that 12. Saturation Theorem Theorem 12.1. If there exists such that then within the forward expansion after the pair appears. Proof. Since , the recurrence forces through the slot. Since , the recurrence forces By induction, if and , then and . Therefore all subsequent terms are contaminated. 13. Seed Echo Taxonomy The complete seed echo taxonomy is: Seed Entry Class First Dirty Pair 0 single 3 22 1 double 0 16 2 double 1 17 3 double 2 18 4 double 3 19 5 double 4 20 6 double 5 21 7 double 6 22 8 double 7 23 9 triple 3 22 10 triple 4 23 11 triple 5 24 12 triple 6 25 13 triple 7 26 14 quad 2 20 15 quad 3 21 The important edge cases are
Author: Kulik, Dean
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7162682989