Skip to content
View A19dammer91's full-sized avatar
73 followers · 65 following

Block or report A19dammer91

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
A19dammer91/README.md

Linear Diophantine Systems, Post-Quantum Cryptography and Clock Architecture

I work on the mathematics behind deterministic systems — from linear Diophantine representation theory to a post-quantum authentication framework built on it (MRS-AUTH), and a clock structure where counting from 1 removes the boundary cases (RDSI).

Research focus

  • Linear Diophantine representation systems with p ≡ 1 (mod q), such as the MRS(19,9) framework (A₀ = dr(N))
  • Post-quantum, coercion-resistant authentication (MRS-AUTH)
  • Counting from 1: RDSI, The Hidden Mathematics Behind the Clock
  • Computational number theory applied to systems design

Tech stack Rust · Python · HTML

Amsterdam · GitHub

Pinned Loading

  1. MRS-Hybride-PQC MRS-Hybride-PQC Public

    Hybrid Post-Quantum cryptographic library: Kyber1024 KEM + MRS(19,9) Diophantine key derivation + AES-256-GCM encryption.

    Rust 2

  2. RDSI-The-Hidden-Mathematics-Behind-the-Clock RDSI-The-Hidden-Mathematics-Behind-the-Clock Public

    Shifting from 0-based to 1-based indexing eliminates complex software workarounds. Pure algebra replaces bitwise hacks and costly conditional branches with direct arithmetic. No logical jumps. No o…

    Python 3

  3. Linear-Diophantine-Representation-Systems-p-1-mod-q- Linear-Diophantine-Representation-Systems-p-1-mod-q- Public

    A complete theory of linear Diophantine systems N = pA + qB with p ≡ 1 (mod q). The minimal A-value always equals the digital root of N. Includes Additivity Theory, Matryoshka Theory, and proof tha…

    Python 3

  4. D3-by-A-C-Coupling-Demo D3-by-A-C-Coupling-Demo Public

    This demo validates the D³ pattern on the Euro currency system. For any amount N, it computes the control value A₀ = N mod 9 = dr(N), the optimal greedy decomposition across 5 structural layers wit…

    HTML 1

  5. p-mod-q-calculator p-mod-q-calculator Public

    Calculator for the p ≡ 1 (mod q) framework. Computes the number of representations N = pA + qB in strict O(1) time using digital roots (dr) as starting point A0 = N mod q. Supports arbitrarily larg…

    HTML 1