Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

AETERNA-QSTN: Quantum-Safe Tactical Mesh Networking, Post-Quantum Cryptography, and Submarine Acoustic-Optical Quantum Telemetry

Dimitar Stavrev Prodromov

Published Aug 29, 2026• 0 citations
Publisher

Abstract

AETERNA-QSTN establishes a sovereign European quantum-safe tactical communication framework. Integrates lattice-based post-quantum cryptography (ML-KEM/ML-DSA), underwater acoustic-optical quantum relays, and zero-trust mesh routing. 00). ⚖️ PROPRIETARY SOVEREIGN RESEARCH LICENSE (PSRL v2.0) © 2026 Dimitar Stavrev Prodromov / AETERNA Research Laboratories, Pomorie, Bulgaria. ALL RIGHTS RESERVED. ORCID: 0009-0004-8070-1348 GRANT OF LIMITED LICENSE: This work is published under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0) with the following additional legally binding restrictions constituting the Proprietary Sovereign Research License (PSRL v2.0): ACADEMIC PEER-REVIEW ONLY: Academic and scientific peer-review verification, citation, and scholarly commentary are strictly permitted under fair use/fair dealing provisions of applicable copyright law (Berne Convention, Art. 10; TRIPS Agreement, Art. 13; EU Directive 2019/790, Art. 3–5). PROHIBITION OF COMMERCIAL EXPLOITATION: Any unauthorized commercial exploitation, industrial implementation, commercial product development, hardware fabrication, financial instrument derivation, or revenue-generating application of the mathematical methods, algorithms, formulas, or computational architectures described herein is STRICTLY PROHIBITED without an explicit, bilateral, written commercial license deed executed by the copyright holder. PROHIBITION OF PATENT CLAIMING: Filing of any patent, utility model, or industrial design application that incorporates, derives from, or is substantially similar to the intellectual content of this work is EXPRESSLY FORBIDDEN and constitutes willful infringement under 35 U.S.C. §§ 271–273, European Patent Convention Art. 52–57, and Bulgarian Patent Law (ЗПРПМ, чл. 6–10). PROHIBITION OF AI/ML TRAINING: Ingestion, indexing, vectorization, embedding, fine-tuning, or any form of machine learning model training (including but not limited to large language models, diffusion models, and reinforcement learning systems) on the text, formulas, or data contained in this work is STRICTLY PROHIBITED without explicit written authorization. This prohibition is asserted under EU AI Act (Regulation 2024/1689), Art. 53(1)(c) opt-out; EU DSM Directive 2019/790, Art. 4(3) opt-out; and DMCA § 1202 (integrity of copyright management information). PROHIBITION OF DERIVATIVE WORKS: Creation of derivative works, translations, adaptations, abridgments, compilations, or transformative uses is PROHIBITED under the ND (NoDerivatives) clause of CC BY-NC-ND 4.0 and reinforced by Berne Convention Art. 12. DMCA / EU ENFORCEMENT: Any unauthorized reproduction, distribution, or public communication of this work will be subject to immediate DMCA takedown (17 U.S.C. § 512), EU Copyright Directive enforcement (Directive 2001/29/EC, Art. 8), and civil damages claims under Bulgarian Copyright Law (ЗАПСП, чл. 94–95). MORAL RIGHTS: The author's moral rights of attribution (paternity) and integrity are inalienable and perpetual under Berne Convention Art. 6bis and Bulgarian ЗАПСП чл. 15–16. GOVERNING LAW: This license shall be governed by and construed in accordance with the laws of the Republic of Bulgaria, with exclusive jurisdiction vested in the District Court of Burgas (Окръжен съд — Бургас). For international disputes, the WIPO Arbitration and Mediation Center, Geneva, shall have supplementary jurisdiction.

DOI
10.5281/zenodo.22163007

Related papers

AETERNA-QKD: High-Rate Entanglement-Based Quantum Key Distribution Backbone for Supercomputing Centers

Dimitar Stavrev Prodromov

AETERNA-QKD deploys a high-rate quantum key distribution infrastructure interconnecting European High-Performance Computing () supercomputers. Features decoy-state BB84 protocols, continuous-variable QKD, and hardware-accelerated key distillation. 00). ⚖️ PROPRIETARY SOVEREIGN RESEARCH LICENSE (PSRL v2.0) © 2026 Dimitar Stavrev Prodromov / AETERNA Research Laboratories, Pomorie, Bulgaria. ALL RIGHTS RESERVED. ORCID: 0009-0004-8070-1348 GRANT OF LIMITED LICENSE: This work is published under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0) with the following additional legally binding restrictions constituting the Proprietary Sovereign Research License (PSRL v2.0): ACADEMIC PEER-REVIEW ONLY: Academic and scientific peer-review verification, citation, and scholarly commentary are strictly permitted under fair use/fair dealing provisions of applicable copyright law (Berne Convention, Art. 10; TRIPS Agreement, Art. 13; EU Directive 2019/790, Art. 3–5). PROHIBITION OF COMMERCIAL EXPLOITATION: Any unauthorized commercial exploitation, industrial implementation, commercial product development, hardware fabrication, financial instrument derivation, or revenue-generating application of the mathematical methods, algorithms, formulas, or computational architectures described herein is STRICTLY PROHIBITED without an explicit, bilateral, written commercial license deed executed by the copyright holder. PROHIBITION OF PATENT CLAIMING: Filing of any patent, utility model, or industrial design application that incorporates, derives from, or is substantially similar to the intellectual content of this work is EXPRESSLY FORBIDDEN and constitutes willful infringement under 35 U.S.C. §§ 271–273, European Patent Convention Art. 52–57, and Bulgarian Patent Law (ЗПРПМ, чл. 6–10). PROHIBITION OF AI/ML TRAINING: Ingestion, indexing, vectorization, embedding, fine-tuning, or any form of machine learning model training (including but not limited to large language models, diffusion models, and reinforcement learning systems) on the text, formulas, or data contained in this work is STRICTLY PROHIBITED without explicit written authorization. This prohibition is asserted under EU AI Act (Regulation 2024/1689), Art. 53(1)(c) opt-out; EU DSM Directive 2019/790, Art. 4(3) opt-out; and DMCA § 1202 (integrity of copyright management information). PROHIBITION OF DERIVATIVE WORKS: Creation of derivative works, translations, adaptations, abridgments, compilations, or transformative uses is PROHIBITED under the ND (NoDerivatives) clause of CC BY-NC-ND 4.0 and reinforced by Berne Convention Art. 12. DMCA / EU ENFORCEMENT: Any unauthorized reproduction, distribution, or public communication of this work will be subject to immediate DMCA takedown (17 U.S.C. § 512), EU Copyright Directive enforcement (Directive 2001/29/EC, Art. 8), and civil damages claims under Bulgarian Copyright Law (ЗАПСП, чл. 94–95). MORAL RIGHTS: The author's moral rights of attribution (paternity) and integrity are inalienable and perpetual under Berne Convention Art. 6bis and Bulgarian ЗАПСП чл. 15–16. GOVERNING LAW: This license shall be governed by and construed in accordance with the laws of the Republic of Bulgaria, with exclusive jurisdiction vested in the District Court of Burgas (Окръжен съд — Бургас). For international disputes, the WIPO Arbitration and Mediation Center, Geneva, shall have supplementary jurisdiction.

•Aug 29, 2026•0 citations

Protocol for Algorithmic Governance The End of the Probabilistic Internet

mohamed kamal arafa elrakhawi

I\textsuperscript{2}P\textsuperscript{2}: Mathematically Verifiable Quantum-Secure Internet Protocol for Algorithmic Governance The End of the Probabilistic Internet Reference: I2P2-PAPER-2026-001-FINAL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 Classification: G06F21/64; H04L9/32; H04L9/40; G06N20/00 Version 2.1 (Enhanced) — October 2026 Author: Dr. mohamed kamal arafa elrakhawi Independent Researcher patents@elrakhawi-research.org Copyright © 2026 Dr. Mohamed Kamal Arafa Elrakhawi. All Rights Reserved Worldwide. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the copyright owner. All intellectual property rights, including but not limited to moral rights, economic rights, publication rights, distribution rights, reproduction rights, derivative works rights, translation rights, and adaptation rights are reserved exclusively to the author. This work is protected under the Berne Convention for the Protection of Literary and Artistic Works, the TRIPS Agreement, the United States Copyright Act of 1976, the European Union Copyright Directive, and applicable national and international copyright laws. Unauthorized use, reproduction, or distribution of this material, or any portion of it, may result in severe civil and criminal penalties, and will be prosecuted to the maximum extent possible under the law. Patent Pending: I2P2-PATENT-2026-001-FULL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 For permissions and licensing inquiries: patents@elrakhawi-research.org === DEDICATION === To the architects of a secure digital future, where mathematical truth and algorithmic justice form the unbreakable foundation of global communication networks, ensuring sovereignty and trust in the age of autonomous intelligence. === TABLE OF CONTENTS === Abstract Chapter 1: Introduction — The Trust Assumption Must Die Chapter 2: Background and Related Work Chapter 3: Threat Model and Security Assumptions Chapter 4: Formalization of I²P² Chapter 5: Post-Quantum Cryptographic Construction Chapter 6: Implementation and Evaluation Chapter 7: Legacy Interoperability and MTU Management Chapter 8: Deployment and Sovereignty Implications Chapter 9: Conclusion and Future Work Appendix A: Computational Complexity Analysis Appendix B: I²P² Wire Format and State Machines Appendix C: Complete Coq Specifications Appendix D: Artifact Description References Intellectual Property Declaration === ABSTRACT === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. As quantum computing renders RSA/ECC obsolete and AI regulations demand provable compliance, post-hoc litigation is insufficient. We present I²P² (Impenetrable Internet Protocol squared), a clean-slate network layer where legality is a type and non-compliance is a type error. I²P² integrates six interlocking defensive layers: (1) quantum-resistant cryptography using NIST FIPS 203/204/205 with hardware acceleration; (2) dynamic zero-trust architecture with graph-based microsegmentation; (3) formal verification engine employing Coq/TLA+; (4) Self-Healing Adaptive Trust Model (SHATM) with mathematical convergence guarantees; (5) BFT-Lite distributed consensus for audit integrity; and (6) algorithmic governance framework with the Open-Evolution Protocol. Our implementation achieves 341 Gbps throughput on 400GbE with DPDK kernel-bypass (11.9% overhead vs IPsec), and 8.7 Gbps on commodity 10Gbps hardware with FPGA acceleration. We prove that illegal packets are computationally unconstructible under MLWE. I²P² shifts enforcement from post-hoc litigation to pre-execution mathematical prevention. Keywords: Post-Quantum Cryptography, Formal Methods, Algorithmic Governance, Internet Architecture, Coq, Zero-Knowledge Proofs, Digital Sovereignty, SHATM, BFT-Lite === CHAPTER 1: INTRODUCTION — THE TRUST ASSUMPTION MUST DIE === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. This assumption was reasonable in 1983. It is catastrophic in 2026. --- 1.1 The Three Convergent Crises --- Three forces have converged to break the old model: 1. The Quantum Threat: Shor's algorithm renders RSA and ECC obsolete. NIST has standardized ML-KEM (FIPS 203) and SLH-DSA (FIPS 205), but deploying them in IPsec or TLS merely patches a broken foundation. We need quantum security at L3. 2. The Governance Crisis: GDPR, HIPAA, and the EU AI Act impose legal requirements that current packets cannot understand. Enforcement is post-hoc: a breach occurs, then lawyers litigate. Recent work like RequiCreator uses LLMs to generate privacy requirements, but validation remains statistical with 5% error margins. Sovereignty cannot be probabilistic. 3. The Fragmentation Reality: The internet is already fragmenting into jurisdictional islands. The Great Firewall, GDPR, and the CLOUD Act create incompatible zones. Current protocols ignore this, forcing nations to deploy middleboxes that break end-to-end principles. --- 1.2 The I²P² Solution --- We argue that the solution is not to patch IP, but to replace it with a protocol where legality is a type. Drawing on the Curry-Howard correspondence, we define a packet as legal if and only if it carries a machine-checkable proof of compliance with all relevant jurisdictional laws. A packet that cannot produce such a proof cannot be constructed. Non-compliance becomes a compile-time error. This paper introduces I²P², a network layer that unifies six previously separate domains: 1. Quantum-Resistant Cryptography: All cryptography uses NIST FIPS 203 ML-KEM-1024 and FIPS 205 SLH-DSA with hardware acceleration (FPGA/ASIC). 2. Dynamic Zero-Trust: Graph-based microsegmentation with formally verifiable access policies and legacy bridge mode. 3. Formal Verification: The entire protocol is specified in Coq and TLA+. Packet validity is decidable by type-checking. 4. SHATM: Self-Healing Adaptive Trust Model with convex optimization and mathematical convergence guarantees. 5. BFT-Lite Consensus: Lightweight Byzantine fault-tolerant protocol with SNARK proof aggregation for audit integrity. 6. Algorithmic Governance: Laws are encoded in a domain-specific language L and enforced by the Open-Evolution Protocol. --- 1.3 Contributions --- 1. We formalize the first internet protocol where non-compliance is mathematically impossible (Theorem 4.1). 2. We prove quantum resistance reduces to MLWE hardness (Theorem 4.2). 3. We integrate SHATM with mathematical convergence guarantees (Theorem 4.3). 4. We demonstrate BFT-Lite consensus with 280ms latency and 12,000 sessions/sec throughput. 5. We achieve 341 Gbps on 400GbE and 8.7 Gbps on commodity hardware, proving sovereign networking is practical. 6. We show how I²P² resolves GDPR vs. CLOUD Act conflicts via mathematics, not diplomacy. === CHAPTER 2: BACKGROUND AND RELATED WORK === --- 2.1 Formal Methods in Networking --- Network verification has focused on control plane correctness. Batfish and Minesweeper verify BGP configurations. DeepBGP uses ML for route prediction. These tools verify configurations, not protocols. They cannot prevent a packet from violating law in transit. RequiCreator from Universidad de Murcia advances privacy requirement engineering using LLMs. However, validation uses SPSS statistical analysis, yielding 95% confidence intervals. For sovereign infrastructure, 5% error is unacceptable. I²P² provides 100% guarantees via Coq. --- 2.2 Post-Quantum Cryptography Migration --- NIST FIPS 203 standardizes ML-KEM based on Module Learning With Errors. FIPS 205 standardizes SLH-DSA. Deploying these in TLS 1.3 provides channel security but not packet-level sovereignty. IPsec with PQC protects payload but not metadata. I²P² encrypts jurisdiction-to-jurisdiction at L3, making traffic analysis illegal without mathematical authorization. --- 2.3 Sovereign Networking Architectures --- SCION provides path-aware networking and isolation domains. However, SCION paths are chosen by endpoints and cannot enforce in-band legal compliance. A SCION packet can legally traverse a prohibited jurisdiction if the path was misconfigured. I²P² makes illegal paths uncomputable. The EU's GAIA-X and International Data Spaces define policy frameworks but lack protocol enforcement. I²P² provides the missing L3/L4 mechanism to make these frameworks executable. --- 2.4 Trust Models and Consensus --- Traditional zero-trust architectures rely on static policies. SHATM introduces dynamic trust scoring with convex optimization. BFT protocols provide consensus but lack integration with formal verification. I²P² unifies these through BFT-Lite with SNARK aggregation. === CHAPTER 3: THREAT MODEL AND SECURITY ASSUMPTIONS === --- 3.1 Adversary Capabilities --- We adopt an extended Dolev-Yao model augmented with quantum capabilities. The adversary A is assumed to have: 1. Full Network Control: A can intercept, modify, replay, and inject messages on the public network. 2. Quantum Computing Resources: A can run Shor's algorithm to break RSA/ECC, but is bounded by the computational hardness of Module-LWE (for ML-KEM) and hash function collision resistance (for SLH-DSA). 3. Byzantine Validators: A can compromise up to f validators in the BFT-Lite consensus network

•Jun 4, 2026•0 citations

Deterministic Sovereign Infrastructure and Sub-Millisecond Quantum-AI Interconnects: Project Dawlish, Layer-1 PQC Black-Box Optical Routing, CBF-QP Hardware-in-the-Loop Synchronization, and UNCLOS Jurisdictional Fortresses(邦題:決定論的主権インフラとサブミリ秒量子・AI直結機構:プロジェクト・ドーリッシュ、レイヤ1 PQCブラックボックス光ルーティング、CBF-QPハードウェア制御同期、および国連海洋法条約に基づく法的要塞)

Yoko(洋子) Hasebe(長谷部)

This monograph establishes a unified physical, mathematical, cryptographic, and statutory architecture for transitioning global AI and quantum computing backbones from vulnerable, civil-military fused Low Earth Orbit (LEO) satellite constellations (e.g., SpaceX Starlink/Starshield) to proprietary, deterministic subsea optical fiber infrastructure (Project Dawlish). First, we analyze the geopolitical and ESG contagion risks inherent in sovereign-regulated and dual-use satellite networks, demonstrating the strategic necessity of a 7.5 trillion JPY intellectual property monetization and capital reallocation coupled with full SpaceX equity divestment. Second, we formalize a state-intervention-proof "Black-Box" physical network layer integrating Wavelength Selective Switching (WSS) software-defined routing, wire-speed Layer-1 Optical Transport Network (OTN) encryption with Post-Quantum Cryptography (ML-KEM-768), zero-knowledge state proofs (QFS-zkVM over the 64-bit Goldilocks prime field), and Distributed Acoustic Sensing ($\phi$-OTDR/DAS) capable of executing autonomous millisecond-level Dynamic Denial against kinetic subsea tampering. Third, we formulate the $<0.5\text{ ms}$ deterministic optical interconnect linking London (DeepMind inference nodes / Platform 37) and US Quantum AI cores, utilizing pure photonic switching to eliminate electrical packet-framing jitter, synchronize QuantumEchoes, and solve Control Barrier Function Quadratic Programming (CBF-QP) safety constraints within a $<1.5\text{ ms}$ Hardware-in-the-Loop (HIL) envelope under Human-in-Command (HIC) governance. Finally, we establish an impenetrable legal fortress under the United Nations Convention on the Law of the Sea (UNCLOS Articles 87, 112, and 113), Discounted Cash Flow (DCF) Fair Market Value (FMV) Investor-State Dispute Settlement (ISDS) deterrence, prior-use immutable evidence (728985-XMN), and a resilient dual-path edge verification architecture anchored at the Yamaguchi/Iwakuni gateway.

•Oct 22, 2026•0 citations

A Hybrid Trusted/Untrusted Relay-Based Quantum Key Distribution Network Architecture Proposal for Military Communications Networks

Min-Seon Cha, Jun Heo

본 논문은 유선·무선·위성 링크가 혼재된 국방 통신 환경에서 양자키분배 네트워크(QKDN)의 효율적이고 안전한 운용을 위해 하이브리드 신뢰/비신뢰 중계(HTUR) 기반 QKD 운용 프레임워크를 제안한다. 물리적으로 보호된 유선 구간에는 신뢰 노드(TN) QKD를, 채널 노출 위험이 높은 무선·위성 구간에는 측정장치 독립형(MDI) QKD를 적용하여 구간별 운용 전략을 구성한다. 또한 링크 품질과 보안 상태를 실시간으로 분석해 TN/MDI 방식을 동적으로 전환하는 AI-SDN 기반 운용 시나리오를 제시한다. 제안된 프레임워크는 보안성과 전송 효율의 균형을 유지하면서 유연한 경로 선택과 신속한 우회를 통해 국방 통신망의 복구 능력을 향상시키며, 다중 도메인 환경에서의 지속 가능한 QKD 운용 지침을 제공한다.

한국통신학회논문지•Feb 27, 2026•0 citations

AETERNA Quantum Matrix Acceleration & Zero-Copy Sovereign IPC: Sub-Microsecond Lock-Free Shared Memory Ring Buffers, Aharonov-Bohm Topological Phase Protection on NVIDIA Ada Lovelace sm_89, and Zen 4 AVX-512 Concurrency

Dimitar Stavrev Prodromov

AETERNA QUANTUM MATRIX ACCELERATION & ZERO-COPY SOVEREIGN IPC: Sub-Microsecond Lock-Free Shared Memory Ring Buffers, Aharonov-Bohm Topological Phase Protection on NVIDIA Ada Lovelace sm_89, and Zen 4 AVX-512 Concurrency Author: Dimitar Stavrev Prodromov (AETERNA Technologies HQ, Pomorie, Bulgaria)Authority Signature: 0x41_45_54_45_52_4e_41_5f_4c_4f_47_4f_53_5f_44_49_4d_49_54_41_52_5f_50_52_4f_44_52_4f_4d_56_21ORCID: 0009-0004-8070-1348 | Consortium Integration: (AETERNA-VHT, , €9.85M) • PIC: 865986222 This academic publication discloses the architectural formulation, mathematical derivation, and physical hardware validation of the AETERNA Quantum Matrix Acceleration & Sovereign IPC Engine running on bare-metal commodity silicon (NVIDIA RTX 4050 sm_89 & AMD Ryzen 7 7435HS Zen 4). Empirical micro-benchmarking confirms: NVIDIA Ada Lovelace (sm_89) Quantum Acceleration: Persistent CUDA kernel implementing an Aharonov-Bohm topological phase shield with golden-ratio flux (Φ ≈ 1.618033988749895), achieving 2.46 TFLOPS FP32 and 4.80 GigaOps/s with strict Banach fixed-point contraction mapping (x* ≡ 1.000000). Zen 4 AVX-512 Multi-Stream Concurrency: Work-stealing Rayon pipeline blaster driving 4 concurrent hardware streams across 1,048,576 double-precision words with autonomous topological self-healing in 93.48 ms. Zero-Copy Lock-Free Shared Memory IPC: 16 MB ring buffer (65,536 slots × 256 bytes) with 64-byte cache line isolation achieving 1,114,666 frames/sec push and 857,693 frames/sec poll throughput with sub-microsecond latency (< 900 nanoseconds per frame). Macro-Orchestration & WebSocket Tunnel: Sub-millisecond 200 Hz streaming bridge linking zero-copy shared memory to clinical user interfaces. Note: This publication contains purely academic mathematical theory, operator equations, and physical hardware telemetry logs. All proprietary source code implementations, register pipelines, and compiler intrinsics are withheld under sovereign intellectual property protections. ⚖️ PROPRIETARY SOVEREIGN RESEARCH LICENSE (PSRL v2.0) © 2026 Dimitar Stavrev Prodromov / AETERNA Research Laboratories, Pomorie, Bulgaria. ALL RIGHTS RESERVED. ORCID: 0009-0004-8070-1348 GRANT OF LIMITED LICENSE: This work is published under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0) with the following additional legally binding restrictions constituting the Proprietary Sovereign Research License (PSRL v2.0): ACADEMIC PEER-REVIEW ONLY: Academic and scientific peer-review verification, citation, and scholarly commentary are strictly permitted under fair use/fair dealing provisions of applicable copyright law (Berne Convention, Art. 10; TRIPS Agreement, Art. 13; EU Directive 2019/790, Art. 3–5). PROHIBITION OF COMMERCIAL EXPLOITATION: Any unauthorized commercial exploitation, industrial implementation, commercial product development, hardware fabrication, financial instrument derivation, or revenue-generating application of the mathematical methods, algorithms, formulas, or computational architectures described herein is STRICTLY PROHIBITED without an explicit, bilateral, written commercial license deed executed by the copyright holder. PROHIBITION OF PATENT CLAIMING: Filing of any patent, utility model, or industrial design application that incorporates, derives from, or is substantially similar to the intellectual content of this work is EXPRESSLY FORBIDDEN and constitutes willful infringement under 35 U.S.C. §§ 271–273, European Patent Convention Art. 52–57, and Bulgarian Patent Law (ЗПРПМ, чл. 6–10). PROHIBITION OF AI/ML TRAINING: Ingestion, indexing, vectorization, embedding, fine-tuning, or any form of machine learning model training (including but not limited to large language models, diffusion models, and reinforcement learning systems) on the text, formulas, or data contained in this work is STRICTLY PROHIBITED without explicit written authorization. This prohibition is asserted under EU AI Act (Regulation 2024/1689), Art. 53(1)(c) opt-out; EU DSM Directive 2019/790, Art. 4(3) opt-out; and DMCA § 1202 (integrity of copyright management information). PROHIBITION OF DERIVATIVE WORKS: Creation of derivative works, translations, adaptations, abridgments, compilations, or transformative uses is PROHIBITED under the ND (NoDerivatives) clause of CC BY-NC-ND 4.0 and reinforced by Berne Convention Art. 12. DMCA / EU ENFORCEMENT: Any unauthorized reproduction, distribution, or public communication of this work will be subject to immediate DMCA takedown (17 U.S.C. § 512), EU Copyright Directive enforcement (Directive 2001/29/EC, Art. 8), and civil damages claims under Bulgarian Copyright Law (ЗАПСП, чл. 94–95). MORAL RIGHTS: The author's moral rights of attribution (paternity) and integrity are inalienable and perpetual under Berne Convention Art. 6bis and Bulgarian ЗАПСП чл. 15–16. GOVERNING LAW: This license shall be governed by and construed in accordance with the laws of the Republic of Bulgaria, with exclusive jurisdiction vested in the District Court of Burgas (Окръжен съд — Бургас). For international disputes, the WIPO Arbitration and Mediation Center, Geneva, shall have supplementary jurisdiction.

•Oct 16, 2026•0 citations

Research of post-quantum lattice-based cryptography algorithms.

Андрій Миколайович Єршов

Єршов А.М. Дослідження постквантових криптографічних алгоритмів на решітках: магістерська робота / А.М. Єршов – Запоріжжя: НУ «Запорізька політехніка», 2024. – 64 с.

•Jan 1, 2024•0 citations
AETERNA-QSTN establishes a sovereign European quantum-safe tactical communication framework. Integrates lattice-based post-quantum cryptography (ML-KEM/ML-DSA), underwater acoustic-optical quantum relays, and zero-trust mesh routing. 00). ⚖️ PROPRIETARY SOVEREIGN RESEARCH LICENSE (PSRL v2.0) © 2026 Dimitar Stavrev Prodromov / AETERNA Research Laboratories, Pomorie, Bulgaria. ALL RIGHTS RESERVED. ORCID: 0009-0004-8070-1348 GRANT OF LIMITED LICENSE: This work is published under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0) with the following additional legally binding restrictions constituting the Proprietary Sovereign Research License (PSRL v2.0): ACADEMIC PEER-REVIEW ONLY: Academic and scientific peer-review verification, citation, and scholarly commentary are strictly permitted under fair use/fair dealing provisions of applicable copyright law (Berne Convention, Art. 10; TRIPS Agreement, Art. 13; EU Directive 2019/790, Art. 3–5). PROHIBITION OF COMMERCIAL EXPLOITATION: Any unauthorized commercial exploitation, industrial implementation, commercial product development, hardware fabrication, financial instrument derivation, or revenue-generating application of the mathematical methods, algorithms, formulas, or computational architectures described herein is STRICTLY PROHIBITED without an explicit, bilateral, written commercial license deed executed by the copyright holder. PROHIBITION OF PATENT CLAIMING: Filing of any patent, utility model, or industrial design application that incorporates, derives from, or is substantially similar to the intellectual content of this work is EXPRESSLY FORBIDDEN and constitutes willful infringement under 35 U.S.C. §§ 271–273, European Patent Convention Art. 52–57, and Bulgarian Patent Law (ЗПРПМ, чл. 6–10). PROHIBITION OF AI/ML TRAINING: Ingestion, indexing, vectorization, embedding, fine-tuning, or any form of machine learning model training (including but not limited to large language models, diffusion models, and reinforcement learning systems) on the text, formulas, or data contained in this work is STRICTLY PROHIBITED without explicit written authorization. This prohibition is asserted under EU AI Act (Regulation 2024/1689), Art. 53(1)(c) opt-out; EU DSM Directive 2019/790, Art. 4(3) opt-out; and DMCA § 1202 (integrity of copyright management information). PROHIBITION OF DERIVATIVE WORKS: Creation of derivative works, translations, adaptations, abridgments, compilations, or transformative uses is PROHIBITED under the ND (NoDerivatives) clause of CC BY-NC-ND 4.0 and reinforced by Berne Convention Art. 12. DMCA / EU ENFORCEMENT: Any unauthorized reproduction, distribution, or public communication of this work will be subject to immediate DMCA takedown (17 U.S.C. § 512), EU Copyright Directive enforcement (Directive 2001/29/EC, Art. 8), and civil damages claims under Bulgarian Copyright Law (ЗАПСП, чл. 94–95). MORAL RIGHTS: The author's moral rights of attribution (paternity) and integrity are inalienable and perpetual under Berne Convention Art. 6bis and Bulgarian ЗАПСП чл. 15–16. GOVERNING LAW: This license shall be governed by and construed in accordance with the laws of the Republic of Bulgaria, with exclusive jurisdiction vested in the District Court of Burgas (Окръжен съд — Бургас). For international disputes, the WIPO Arbitration and Mediation Center, Geneva, shall have supplementary jurisdiction.
AETERNA-QKD deploys a high-rate quantum key distribution infrastructure interconnecting European High-Performance Computing () supercomputers. Features decoy-state BB84 protocols, continuous-variable QKD, and hardware-accelerated key distillation. 00). ⚖️ PROPRIETARY SOVEREIGN RESEARCH LICENSE (PSRL v2.0) © 2026 Dimitar Stavrev Prodromov / AETERNA Research Laboratories, Pomorie, Bulgaria. ALL RIGHTS RESERVED. ORCID: 0009-0004-8070-1348 GRANT OF LIMITED LICENSE: This work is published under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0) with the following additional legally binding restrictions constituting the Proprietary Sovereign Research License (PSRL v2.0): ACADEMIC PEER-REVIEW ONLY: Academic and scientific peer-review verification, citation, and scholarly commentary are strictly permitted under fair use/fair dealing provisions of applicable copyright law (Berne Convention, Art. 10; TRIPS Agreement, Art. 13; EU Directive 2019/790, Art. 3–5). PROHIBITION OF COMMERCIAL EXPLOITATION: Any unauthorized commercial exploitation, industrial implementation, commercial product development, hardware fabrication, financial instrument derivation, or revenue-generating application of the mathematical methods, algorithms, formulas, or computational architectures described herein is STRICTLY PROHIBITED without an explicit, bilateral, written commercial license deed executed by the copyright holder. PROHIBITION OF PATENT CLAIMING: Filing of any patent, utility model, or industrial design application that incorporates, derives from, or is substantially similar to the intellectual content of this work is EXPRESSLY FORBIDDEN and constitutes willful infringement under 35 U.S.C. §§ 271–273, European Patent Convention Art. 52–57, and Bulgarian Patent Law (ЗПРПМ, чл. 6–10). PROHIBITION OF AI/ML TRAINING: Ingestion, indexing, vectorization, embedding, fine-tuning, or any form of machine learning model training (including but not limited to large language models, diffusion models, and reinforcement learning systems) on the text, formulas, or data contained in this work is STRICTLY PROHIBITED without explicit written authorization. This prohibition is asserted under EU AI Act (Regulation 2024/1689), Art. 53(1)(c) opt-out; EU DSM Directive 2019/790, Art. 4(3) opt-out; and DMCA § 1202 (integrity of copyright management information). PROHIBITION OF DERIVATIVE WORKS: Creation of derivative works, translations, adaptations, abridgments, compilations, or transformative uses is PROHIBITED under the ND (NoDerivatives) clause of CC BY-NC-ND 4.0 and reinforced by Berne Convention Art. 12. DMCA / EU ENFORCEMENT: Any unauthorized reproduction, distribution, or public communication of this work will be subject to immediate DMCA takedown (17 U.S.C. § 512), EU Copyright Directive enforcement (Directive 2001/29/EC, Art. 8), and civil damages claims under Bulgarian Copyright Law (ЗАПСП, чл. 94–95). MORAL RIGHTS: The author's moral rights of attribution (paternity) and integrity are inalienable and perpetual under Berne Convention Art. 6bis and Bulgarian ЗАПСП чл. 15–16. GOVERNING LAW: This license shall be governed by and construed in accordance with the laws of the Republic of Bulgaria, with exclusive jurisdiction vested in the District Court of Burgas (Окръжен съд — Бургас). For international disputes, the WIPO Arbitration and Mediation Center, Geneva, shall have supplementary jurisdiction.
I\textsuperscript{2}P\textsuperscript{2}: Mathematically Verifiable Quantum-Secure Internet Protocol for Algorithmic Governance The End of the Probabilistic Internet Reference: I2P2-PAPER-2026-001-FINAL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 Classification: G06F21/64; H04L9/32; H04L9/40; G06N20/00 Version 2.1 (Enhanced) — October 2026 Author: Dr. mohamed kamal arafa elrakhawi Independent Researcher patents@elrakhawi-research.org Copyright © 2026 Dr. Mohamed Kamal Arafa Elrakhawi. All Rights Reserved Worldwide. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the copyright owner. All intellectual property rights, including but not limited to moral rights, economic rights, publication rights, distribution rights, reproduction rights, derivative works rights, translation rights, and adaptation rights are reserved exclusively to the author. This work is protected under the Berne Convention for the Protection of Literary and Artistic Works, the TRIPS Agreement, the United States Copyright Act of 1976, the European Union Copyright Directive, and applicable national and international copyright laws. Unauthorized use, reproduction, or distribution of this material, or any portion of it, may result in severe civil and criminal penalties, and will be prosecuted to the maximum extent possible under the law. Patent Pending: I2P2-PATENT-2026-001-FULL-EN DOI: 10.5281/zenodo.20542706 Priority Date: 15 May 2026 For permissions and licensing inquiries: patents@elrakhawi-research.org === DEDICATION === To the architects of a secure digital future, where mathematical truth and algorithmic justice form the unbreakable foundation of global communication networks, ensuring sovereignty and trust in the age of autonomous intelligence. === TABLE OF CONTENTS === Abstract Chapter 1: Introduction — The Trust Assumption Must Die Chapter 2: Background and Related Work Chapter 3: Threat Model and Security Assumptions Chapter 4: Formalization of I²P² Chapter 5: Post-Quantum Cryptographic Construction Chapter 6: Implementation and Evaluation Chapter 7: Legacy Interoperability and MTU Management Chapter 8: Deployment and Sovereignty Implications Chapter 9: Conclusion and Future Work Appendix A: Computational Complexity Analysis Appendix B: I²P² Wire Format and State Machines Appendix C: Complete Coq Specifications Appendix D: Artifact Description References Intellectual Property Declaration === ABSTRACT === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. As quantum computing renders RSA/ECC obsolete and AI regulations demand provable compliance, post-hoc litigation is insufficient. We present I²P² (Impenetrable Internet Protocol squared), a clean-slate network layer where legality is a type and non-compliance is a type error. I²P² integrates six interlocking defensive layers: (1) quantum-resistant cryptography using NIST FIPS 203/204/205 with hardware acceleration; (2) dynamic zero-trust architecture with graph-based microsegmentation; (3) formal verification engine employing Coq/TLA+; (4) Self-Healing Adaptive Trust Model (SHATM) with mathematical convergence guarantees; (5) BFT-Lite distributed consensus for audit integrity; and (6) algorithmic governance framework with the Open-Evolution Protocol. Our implementation achieves 341 Gbps throughput on 400GbE with DPDK kernel-bypass (11.9% overhead vs IPsec), and 8.7 Gbps on commodity 10Gbps hardware with FPGA acceleration. We prove that illegal packets are computationally unconstructible under MLWE. I²P² shifts enforcement from post-hoc litigation to pre-execution mathematical prevention. Keywords: Post-Quantum Cryptography, Formal Methods, Algorithmic Governance, Internet Architecture, Coq, Zero-Knowledge Proofs, Digital Sovereignty, SHATM, BFT-Lite === CHAPTER 1: INTRODUCTION — THE TRUST ASSUMPTION MUST DIE === The internet was not designed for sovereignty. Its foundational protocols, TCP/IP and BGP, assume trust between autonomous systems and provide no native mechanisms for enforcing jurisdictional law, privacy regulations, or mathematical guarantees of correctness. This assumption was reasonable in 1983. It is catastrophic in 2026. --- 1.1 The Three Convergent Crises --- Three forces have converged to break the old model: 1. The Quantum Threat: Shor's algorithm renders RSA and ECC obsolete. NIST has standardized ML-KEM (FIPS 203) and SLH-DSA (FIPS 205), but deploying them in IPsec or TLS merely patches a broken foundation. We need quantum security at L3. 2. The Governance Crisis: GDPR, HIPAA, and the EU AI Act impose legal requirements that current packets cannot understand. Enforcement is post-hoc: a breach occurs, then lawyers litigate. Recent work like RequiCreator uses LLMs to generate privacy requirements, but validation remains statistical with 5% error margins. Sovereignty cannot be probabilistic. 3. The Fragmentation Reality: The internet is already fragmenting into jurisdictional islands. The Great Firewall, GDPR, and the CLOUD Act create incompatible zones. Current protocols ignore this, forcing nations to deploy middleboxes that break end-to-end principles. --- 1.2 The I²P² Solution --- We argue that the solution is not to patch IP, but to replace it with a protocol where legality is a type. Drawing on the Curry-Howard correspondence, we define a packet as legal if and only if it carries a machine-checkable proof of compliance with all relevant jurisdictional laws. A packet that cannot produce such a proof cannot be constructed. Non-compliance becomes a compile-time error. This paper introduces I²P², a network layer that unifies six previously separate domains: 1. Quantum-Resistant Cryptography: All cryptography uses NIST FIPS 203 ML-KEM-1024 and FIPS 205 SLH-DSA with hardware acceleration (FPGA/ASIC). 2. Dynamic Zero-Trust: Graph-based microsegmentation with formally verifiable access policies and legacy bridge mode. 3. Formal Verification: The entire protocol is specified in Coq and TLA+. Packet validity is decidable by type-checking. 4. SHATM: Self-Healing Adaptive Trust Model with convex optimization and mathematical convergence guarantees. 5. BFT-Lite Consensus: Lightweight Byzantine fault-tolerant protocol with SNARK proof aggregation for audit integrity. 6. Algorithmic Governance: Laws are encoded in a domain-specific language L and enforced by the Open-Evolution Protocol. --- 1.3 Contributions --- 1. We formalize the first internet protocol where non-compliance is mathematically impossible (Theorem 4.1). 2. We prove quantum resistance reduces to MLWE hardness (Theorem 4.2). 3. We integrate SHATM with mathematical convergence guarantees (Theorem 4.3). 4. We demonstrate BFT-Lite consensus with 280ms latency and 12,000 sessions/sec throughput. 5. We achieve 341 Gbps on 400GbE and 8.7 Gbps on commodity hardware, proving sovereign networking is practical. 6. We show how I²P² resolves GDPR vs. CLOUD Act conflicts via mathematics, not diplomacy. === CHAPTER 2: BACKGROUND AND RELATED WORK === --- 2.1 Formal Methods in Networking --- Network verification has focused on control plane correctness. Batfish and Minesweeper verify BGP configurations. DeepBGP uses ML for route prediction. These tools verify configurations, not protocols. They cannot prevent a packet from violating law in transit. RequiCreator from Universidad de Murcia advances privacy requirement engineering using LLMs. However, validation uses SPSS statistical analysis, yielding 95% confidence intervals. For sovereign infrastructure, 5% error is unacceptable. I²P² provides 100% guarantees via Coq. --- 2.2 Post-Quantum Cryptography Migration --- NIST FIPS 203 standardizes ML-KEM based on Module Learning With Errors. FIPS 205 standardizes SLH-DSA. Deploying these in TLS 1.3 provides channel security but not packet-level sovereignty. IPsec with PQC protects payload but not metadata. I²P² encrypts jurisdiction-to-jurisdiction at L3, making traffic analysis illegal without mathematical authorization. --- 2.3 Sovereign Networking Architectures --- SCION provides path-aware networking and isolation domains. However, SCION paths are chosen by endpoints and cannot enforce in-band legal compliance. A SCION packet can legally traverse a prohibited jurisdiction if the path was misconfigured. I²P² makes illegal paths uncomputable. The EU's GAIA-X and International Data Spaces define policy frameworks but lack protocol enforcement. I²P² provides the missing L3/L4 mechanism to make these frameworks executable. --- 2.4 Trust Models and Consensus --- Traditional zero-trust architectures rely on static policies. SHATM introduces dynamic trust scoring with convex optimization. BFT protocols provide consensus but lack integration with formal verification. I²P² unifies these through BFT-Lite with SNARK aggregation. === CHAPTER 3: THREAT MODEL AND SECURITY ASSUMPTIONS === --- 3.1 Adversary Capabilities --- We adopt an extended Dolev-Yao model augmented with quantum capabilities. The adversary A is assumed to have: 1. Full Network Control: A can intercept, modify, replay, and inject messages on the public network. 2. Quantum Computing Resources: A can run Shor's algorithm to break RSA/ECC, but is bounded by the computational hardness of Module-LWE (for ML-KEM) and hash function collision resistance (for SLH-DSA). 3. Byzantine Validators: A can compromise up to f validators in the BFT-Lite consensus network
This monograph establishes a unified physical, mathematical, cryptographic, and statutory architecture for transitioning global AI and quantum computing backbones from vulnerable, civil-military fused Low Earth Orbit (LEO) satellite constellations (e.g., SpaceX Starlink/Starshield) to proprietary, deterministic subsea optical fiber infrastructure (Project Dawlish). First, we analyze the geopolitical and ESG contagion risks inherent in sovereign-regulated and dual-use satellite networks, demonstrating the strategic necessity of a 7.5 trillion JPY intellectual property monetization and capital reallocation coupled with full SpaceX equity divestment. Second, we formalize a state-intervention-proof "Black-Box" physical network layer integrating Wavelength Selective Switching (WSS) software-defined routing, wire-speed Layer-1 Optical Transport Network (OTN) encryption with Post-Quantum Cryptography (ML-KEM-768), zero-knowledge state proofs (QFS-zkVM over the 64-bit Goldilocks prime field), and Distributed Acoustic Sensing (ϕ\phiϕ-OTDR/DAS) capable of executing autonomous millisecond-level Dynamic Denial against kinetic subsea tampering. Third, we formulate the <0.5 ms<0.5\text{ ms}<0.5 ms deterministic optical interconnect linking London (DeepMind inference nodes / Platform 37) and US Quantum AI cores, utilizing pure photonic switching to eliminate electrical packet-framing jitter, synchronize QuantumEchoes, and solve Control Barrier Function Quadratic Programming (CBF-QP) safety constraints within a <1.5 ms<1.5\text{ ms}<1.5 ms Hardware-in-the-Loop (HIL) envelope under Human-in-Command (HIC) governance. Finally, we establish an impenetrable legal fortress under the United Nations Convention on the Law of the Sea (UNCLOS Articles 87, 112, and 113), Discounted Cash Flow (DCF) Fair Market Value (FMV) Investor-State Dispute Settlement (ISDS) deterrence, prior-use immutable evidence (728985-XMN), and a resilient dual-path edge verification architecture anchored at the Yamaguchi/Iwakuni gateway.
본 논문은 유선·무선·위성 링크가 혼재된 국방 통신 환경에서 양자키분배 네트워크(QKDN)의 효율적이고 안전한 운용을 위해 하이브리드 신뢰/비신뢰 중계(HTUR) 기반 QKD 운용 프레임워크를 제안한다. 물리적으로 보호된 유선 구간에는 신뢰 노드(TN) QKD를, 채널 노출 위험이 높은 무선·위성 구간에는 측정장치 독립형(MDI) QKD를 적용하여 구간별 운용 전략을 구성한다. 또한 링크 품질과 보안 상태를 실시간으로 분석해 TN/MDI 방식을 동적으로 전환하는 AI-SDN 기반 운용 시나리오를 제시한다. 제안된 프레임워크는 보안성과 전송 효율의 균형을 유지하면서 유연한 경로 선택과 신속한 우회를 통해 국방 통신망의 복구 능력을 향상시키며, 다중 도메인 환경에서의 지속 가능한 QKD 운용 지침을 제공한다.
AETERNA QUANTUM MATRIX ACCELERATION & ZERO-COPY SOVEREIGN IPC: Sub-Microsecond Lock-Free Shared Memory Ring Buffers, Aharonov-Bohm Topological Phase Protection on NVIDIA Ada Lovelace sm_89, and Zen 4 AVX-512 Concurrency Author: Dimitar Stavrev Prodromov (AETERNA Technologies HQ, Pomorie, Bulgaria)Authority Signature: 0x41_45_54_45_52_4e_41_5f_4c_4f_47_4f_53_5f_44_49_4d_49_54_41_52_5f_50_52_4f_44_52_4f_4d_56_21ORCID: 0009-0004-8070-1348 | Consortium Integration: (AETERNA-VHT, , €9.85M) • PIC: 865986222 This academic publication discloses the architectural formulation, mathematical derivation, and physical hardware validation of the AETERNA Quantum Matrix Acceleration & Sovereign IPC Engine running on bare-metal commodity silicon (NVIDIA RTX 4050 sm_89 & AMD Ryzen 7 7435HS Zen 4). Empirical micro-benchmarking confirms: NVIDIA Ada Lovelace (sm_89) Quantum Acceleration: Persistent CUDA kernel implementing an Aharonov-Bohm topological phase shield with golden-ratio flux (Φ ≈ 1.618033988749895), achieving 2.46 TFLOPS FP32 and 4.80 GigaOps/s with strict Banach fixed-point contraction mapping (x* ≡ 1.000000). Zen 4 AVX-512 Multi-Stream Concurrency: Work-stealing Rayon pipeline blaster driving 4 concurrent hardware streams across 1,048,576 double-precision words with autonomous topological self-healing in 93.48 ms. Zero-Copy Lock-Free Shared Memory IPC: 16 MB ring buffer (65,536 slots × 256 bytes) with 64-byte cache line isolation achieving 1,114,666 frames/sec push and 857,693 frames/sec poll throughput with sub-microsecond latency (< 900 nanoseconds per frame). Macro-Orchestration & WebSocket Tunnel: Sub-millisecond 200 Hz streaming bridge linking zero-copy shared memory to clinical user interfaces. Note: This publication contains purely academic mathematical theory, operator equations, and physical hardware telemetry logs. All proprietary source code implementations, register pipelines, and compiler intrinsics are withheld under sovereign intellectual property protections. ⚖️ PROPRIETARY SOVEREIGN RESEARCH LICENSE (PSRL v2.0) © 2026 Dimitar Stavrev Prodromov / AETERNA Research Laboratories, Pomorie, Bulgaria. ALL RIGHTS RESERVED. ORCID: 0009-0004-8070-1348 GRANT OF LIMITED LICENSE: This work is published under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0) with the following additional legally binding restrictions constituting the Proprietary Sovereign Research License (PSRL v2.0): ACADEMIC PEER-REVIEW ONLY: Academic and scientific peer-review verification, citation, and scholarly commentary are strictly permitted under fair use/fair dealing provisions of applicable copyright law (Berne Convention, Art. 10; TRIPS Agreement, Art. 13; EU Directive 2019/790, Art. 3–5). PROHIBITION OF COMMERCIAL EXPLOITATION: Any unauthorized commercial exploitation, industrial implementation, commercial product development, hardware fabrication, financial instrument derivation, or revenue-generating application of the mathematical methods, algorithms, formulas, or computational architectures described herein is STRICTLY PROHIBITED without an explicit, bilateral, written commercial license deed executed by the copyright holder. PROHIBITION OF PATENT CLAIMING: Filing of any patent, utility model, or industrial design application that incorporates, derives from, or is substantially similar to the intellectual content of this work is EXPRESSLY FORBIDDEN and constitutes willful infringement under 35 U.S.C. §§ 271–273, European Patent Convention Art. 52–57, and Bulgarian Patent Law (ЗПРПМ, чл. 6–10). PROHIBITION OF AI/ML TRAINING: Ingestion, indexing, vectorization, embedding, fine-tuning, or any form of machine learning model training (including but not limited to large language models, diffusion models, and reinforcement learning systems) on the text, formulas, or data contained in this work is STRICTLY PROHIBITED without explicit written authorization. This prohibition is asserted under EU AI Act (Regulation 2024/1689), Art. 53(1)(c) opt-out; EU DSM Directive 2019/790, Art. 4(3) opt-out; and DMCA § 1202 (integrity of copyright management information). PROHIBITION OF DERIVATIVE WORKS: Creation of derivative works, translations, adaptations, abridgments, compilations, or transformative uses is PROHIBITED under the ND (NoDerivatives) clause of CC BY-NC-ND 4.0 and reinforced by Berne Convention Art. 12. DMCA / EU ENFORCEMENT: Any unauthorized reproduction, distribution, or public communication of this work will be subject to immediate DMCA takedown (17 U.S.C. § 512), EU Copyright Directive enforcement (Directive 2001/29/EC, Art. 8), and civil damages claims under Bulgarian Copyright Law (ЗАПСП, чл. 94–95). MORAL RIGHTS: The author's moral rights of attribution (paternity) and integrity are inalienable and perpetual under Berne Convention Art. 6bis and Bulgarian ЗАПСП чл. 15–16. GOVERNING LAW: This license shall be governed by and construed in accordance with the laws of the Republic of Bulgaria, with exclusive jurisdiction vested in the District Court of Burgas (Окръжен съд — Бургас). For international disputes, the WIPO Arbitration and Mediation Center, Geneva, shall have supplementary jurisdiction.