Repository navigation

Release list

K501 AIONARC Pipeline v2.0 Alpha Pre-release

Pre-release

k501-Information-Space released this 25 Sep 11:45

v2.0.0-alpha

6949170

K501 AIONARC Pipeline v2.0 Alpha

This release publishes the canonical source state of the K501 AIONARC Pipeline v2.0 Alpha.

Release identity:

Version: 2.0.0-alpha
Git tag: v2.0.0-alpha
Canonical commit: 6949170
Release scope: 54 files

The release represents the reconciled and reconstructed Alpha integration state validated through the V2A-03 and V2A-04 gate sequence.

The published source includes:

byte-native observation and deterministic ordering at L0/L1
explicit Binary Object Record byte encoding at L3
raw 32-byte SHA-256 digests
explicit NULL/PRESENT handling
signed mtime_sec / mtime_nsec representation
separate object_id and H_record identities
QH256 reference binding and validation interfaces
deterministic reconstruction, validation, mutation-proof, negative-validation, and determinism test procedures

Release integrity:

V2A-03 — Public Reconstruction: PASS
V2A-04.1 — Git Inclusion Audit: PASS
V2A-04.2 — Canonical Index Staging: PASS
V2A-04.3 — Index / Hash / Release-Metadata Reconciliation: PASS
V2A-04.4 — Canonical Git Commit and Post-Commit Reconciliation: PASS

This Alpha release is a canonical source release. Derived build trees, local evidence, reconstruction workspaces, temporary files, and other non-release artifacts are not part of the 54-file canonical release scope.

The release is intended as a reproducible integration state for the K501 Information Space / AIONARC architecture and as a basis for subsequent reconstruction, validation, and archival publication.

Canonical source:
K501 Information Space / QH256

Assets 2

QH256 Validation v2.0.0 Latest

Latest

k501-Information-Space released this 04 Sep 17:19

QH256_Validation_v2.0.0

bca88d2

QH256 Validation v2.0.0

This release establishes the current QH256 validation baseline for K501-AIONARC.

Validation Result

Assertions executed: 6,620,625
Assertions failed: 0
Result: PASS

The validation was executed using the optimized C11 build and the validation procedure with AddressSanitizer (ASan) and UndefinedBehaviorSanitizer (UBSan).

The assertion count represents the executed validation suite. It is not an enumeration of the 2^256 possible QH256 states.

Validation Lineage

QH256_Validation_v2.0.0 is the current validation baseline.

QH256_Validation_v0.1.0 remains preserved as an earlier, valid historical validation state.

The separate release QH256_v0.1.0-alpha is a historical Alpha release and is obsolete.

The historical Alpha must not be interpreted as the current QH256 implementation, validation baseline, production state, or evidence of production readiness.

Its historical claims are not canonical and are not carried forward into the current QH256 state.

The Alpha is preserved for provenance and reconstruction.

Current State

Current QH256 validation baseline:

6,620,625 assertions
0 failures
PASS

This release represents the validated state associated with the existing immutable tag QH256_Validation_v2.0.0.

No modification of the existing validation tag is required.

K501-AIONARC Principles

Proof Before State
NO_DRIFT
NO_PHANTOM
APPEND_ONLY
TRACEABILITY_REQUIRED
TEMPORAL_CONSISTENCY
RECONSTRUCT_BEFORE_EXTEND
DERIVED_IS_NOT_CANONICAL

Assets 2

QH256 Validation v0.1.0

k501-Information-Space released this 30 Aug 06:53

QH256_Validation_v0.1.0

bca88d2

QH256 Validation v0.1.0

First public validation release of QH256 for the K501-AIONARC Information Space.

This release contains the validated QH256 reference implementation and reproducible validation material corresponding to the QH256 Validation v0.1.0 tag.

QH256 defines a deterministic 256-bit information state structure based on 128 cells of 2 bits each:

00 = UNKNOWN
01 = FALSE
10 = TRUE
11 = GUARD

The release is intended as a reproducible technical validation milestone.

Canonical source:
https://github.com/k501-Information-Space/QH256

Project:
K501-AIONARC — The Information Space

Assets 2

QH256 Pre-release

Pre-release

k501-Information-Space released this 13 Jun 19:55

QH256_v0.1.0-alpha

b72e37a

Full Changelog: https://github.com/k501-Information-Space/QH256/commits/QH256

QH256: Semantic Four-State Cryptographic Engine

A mathematically rigorous, production-ready cryptographic primitive with formal security guarantees.

🎯 Quick Start

Verify Installation

./verify_v6.sh

Expected output:

✅ VERIFICATION SUCCESSFUL

Basic Usage

#include "QH256Engine.hpp"
int main() {

State256 state;

set_all(state, DR4::False);
qh_rounds(state, 32);  // Apply 32 rounds

std::cout &#x3C;&#x3C; "Guard count: " &#x3C;&#x3C; count_guard(state) &#x3C;&#x3C; "\n";
return 0;

}

Compile:

g++ -std=c++17 -O2 basic.cpp -o basic && ./basic

📚 Documentation Structure

For Quick Lookup

QH256_GLOSSARY.md — States, operations, parameters, and common patterns

For Understanding the Design

QH256_EXECUTIVE_SUMMARY.md — High-level overview (3-page read)
QH256_BREAKTHROUGH.md — Why v1-v5 failed and v6 solution

For Deep Dive

QH256_formal_theory.md — Complete mathematical foundation (15 sections)

For Integration

QH256_IMPLEMENTATION_GUIDE.md — Patterns, API, customization, testing

🏗️ Architecture Overview

State Representation

256 bits = 128 Lanes (2 bits each)
4 States: Invalid (U), False (F), True (T), Guard (G)
Bit Encoding: U=00, F=01, T=10, G=11

Round Structure

Input State (256 bits)
    ↓
Local Phase (6 S₃ permutations on lane pairs)
    ↓
Routing Phase (coprime-shift permutation)
    ↓
Output State (256 bits)

Key Design Decisions

Aspect	Choice	Reason
Operations	S₃ Permutations	Guarantee semantic closure {F,T,G}
Count	6	All automorphisms of 3-element set
Routing	Coprime-shift (45i+17r) mod 128	Full period, good diffusion
Rounds	32 (default)	AES standard, proven sufficient

The Breakthrough: Using semantic-level permutations instead of bitwise operations on the representation guarantees algebraic closure and eliminates state collapse issues.

📝 License

MIT License

Email: contact.k501@proton.me
Website: https://iinkognit0.de/
Mastodon: https://mastodon.social/@K501
ORCID: https://orcid.org/0009-0005-5125-9711
Publications: https://dev.to/k501is
GitHub: https://github.com/k501-Information-Space/

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

🤝 Contributing

This is a foundational cryptographic primitive. Before proposing changes:

Understand the formal theory (Sektionen 1-15 in QH256_formal_theory.md)
Verify any change preserves the 3 core theorems
Run full test suite
Submit with formal justification

📞 References

Theory: Sektionen 1-15 in QH256_formal_theory.md
Implementation: QH256Engine.hpp
Tests: test_qh256.cpp
Quick Ref: QH256_GLOSSARY.md
Guide: QH256_IMPLEMENTATION_GUIDE.md

🎯 Status

✅ PRODUCTION READY

Mathematically proven (3 theorems)
All tests passing (6/6)
No known vulnerabilities
Hardware-efficient
Well-documented

Ready for integration into cryptographic systems, hashers, ciphers, and research applications.

Last Updated: 2026-06-02
v6 Test Status: 6/6 ✓ ALL PASSING

# QH256: Semantic Four-State Cryptographic Engine

A mathematically rigorous, production-ready cryptographic primitive with formal security guarantees.

🎯 Quick Start

Verify Installation

./verify_v6.sh

Expected output:

✅ VERIFICATION SUCCESSFUL
Status: PRODUCTION READY ✓

Basic Usage

#include "QH256Engine.hpp"

int main() {
    State256 state;
    set_all(state, DR4::False);
    
    qh_rounds(state, 32);  // Apply 32 rounds
    
    std::cout << "Guard count: " << count_guard(state) << "\n";
    return 0;
}

Compile:

g++ -std=c++17 -O2 basic.cpp -o basic && ./basic

📚 Documentation Structure

For Quick Lookup

[QH256_GLOSSARY.md](./docs/QH256_GLOSSARY.md) — States, operations, parameters, and common patterns

For Understanding the Design

[QH256_EXECUTIVE_SUMMARY.md](./docs/QH256_EXECUTIVE_SUMMARY.md) — High-level overview (3-page read)
[QH256_BREAKTHROUGH.md](./docs/QH256_BREAKTHROUGH.md) — Why v1-v5 failed and v6 solution

For Deep Dive

[QH256_formal_theory.md](./docs/QH256_formal_theory.md) — Complete mathematical foundation (15 sections)

For Integration

[QH256_IMPLEMENTATION_GUIDE.md](./docs/QH256_IMPLEMENTATION_GUIDE.md) — Patterns, API, customization, testing

🏗️ Architecture Overview

State Representation

256 bits = 128 Lanes (2 bits each)
4 States: Invalid (U), False (F), True (T), Guard (G)
Bit Encoding: U=00, F=01, T=10, G=11

Round Structure

Input State (256 bits)
    ↓
Local Phase (6 S₃ permutations on lane pairs)
    ↓
Routing Phase (coprime-shift permutation)
    ↓
Output State (256 bits)

Key Design Decisions

Aspect	Choice	Reason
...

Assets 6

Releases: k501-Information-Space/QH256

Release list

K501 AIONARC Pipeline v2.0 Alpha

Uh oh!