The full cryptographic lifecycle
The unit of analysis is not IBM Phoenix, the RTX 5090, TPM, SHAKE256, AES-GCM or any individual hash. It is the lifecycle connecting them. INETERNUM coordinates physical observation, health control, conditioning, conservative quantification, multi-source contribution, event binding, ephemeral transfer, authenticated use, controlled destruction and post-burn evidence.
The system is designed so that the secret can die, the causal history can continue, and the proof can remain.
Secret State
Transient authority. It exists for the event, is consumed, and controlled representations are zeroized after use.
Causal State
A non-secret chain head carries history into the next event without requiring the previous root to survive.
Evidence State
Commitments, manifests, hashes, ciphertexts and audit relations persist for later verification without becoming recovery material.
A conventional machine becomes the operational cryptographic platform
The experimental genealogy begins on IBM Phoenix, but the sovereign architecture moves the physical/computational event into local conventional hardware. CPU timing, host-observed CUDA execution latency, Windows BCryptGenRandom and TPM participation are combined on the local platform. The documented GPU is an NVIDIA RTX 5090 Laptop running CUDA 12.8 and PyTorch 2.11.0+cu128.
samples per documented sovereign/temporal run, with health gating and changing observed distributions.
latency observations per run, with hundreds of distinct values in the documented executions.
ephemeral physical root used by the final authenticated streaming workload.
Phoenix is the experimental laboratory of origin. Sovereign INETERNUM internalizes the paradigm in conventional local hardware capable of creating, using and burning cryptographic authority.
From IBM Phoenix to local physical authority
Six earlier IBM Phoenix workloads document a progression across circuit breadth, shot depth, concentrated response regimes and syndrome-like structures. A later Phoenix event used in the cryptographic line records 4,096 shots × 32 measured bits = 131,072 bits, with a declared one-fraction of 0.49520111083984375 and a raw-measurement commitment fixed by SHA-256.
| Generation | Composition | Architectural role |
|---|---|---|
| R1 | Von Neumann (IBM) | Physical QPU event enters cryptographic use. |
| R2 | Von Neumann (IBM) XOR BCryptGenRandom | OS contribution is added around the same physical event. |
| R3 | Von Neumann (IBM) XOR TPM | Hardware trust contribution is introduced. |
| R4 | CPU timing ⊕ GPU timing ⊕ OS CSPRNG ⊕ TPM | Physical authority becomes locally sovereign. |
| R5 | Functional CPU ⊕ functional GPU ⊕ OS ⊕ TPM ⊕ causal binding | The root becomes event- and history-bound. |
Conditioning, conservative entropy and operational budgets
INETERNUM separates three questions that are often blurred together: whether a source is behaving acceptably, how observations are cryptographically conditioned, and how much unpredictability can be conservatively credited. Conditioning is not treated as a machine for creating entropy.
conservative bits per 8-bit symbol in the documented restart evaluation.
conservative bits per 8-bit symbol in the documented restart evaluation.
conservative bits per byte across the 1,000,000-byte conditioned dataset.
The conditioned dataset contains exactly 1,000,000 bytes and all 256 byte values. Its empirical Shannon entropy is approximately 7.99979 bits/byte, while the published conservative result is 7.096303 bits/byte. The limiting path is the bitstring Compression estimate: 0.887038 bits/bit × 8.
The evidence then bridges statistical evaluation to production: the documented CPU budget is 349.03872 bits/block and the GPU budget is 419.622656 bits/block. The same budgets reappear in the physical-root audit used by the final benchmark.
The root belongs to an event, not merely to a random draw
The temporal layer adds nonce, device, TPM identity, prior causal state and a functional schedule. Two linked events show sequence continuity: the first event's new chain head becomes the second event's previous chain head. Across the two events, nonce, schedule, CPU commitment, GPU commitment, TPM identity, ciphertext and chain head change.
Source ablations
Removing CPU, GPU, OS or TPM causes the documented validation path to reject. These gates test contribution dependency.
Context displacements
Time, device, history and functional-order displacements are rejected. These gates test event binding.
Causal continuity
The history moves forward through a non-secret chain state rather than through preservation of the previous secret root.
4 GiB. 3.37367 seconds. 1,273.08 MB/s.
The final streaming benchmark moves the architecture from small experimental payloads into service-scale authenticated encryption. A 32-byte ephemeral physical root governs an exact 4 GiB workload using AES-256-GCM through OpenSSL EVP.
4,294,967,296 bytes processed in 256 chunks of 16 MiB.
approximately 1.18565 GiB/s binary throughput.
approximately 13.18 ms per 16 MiB chunk.
| Gate | Result |
|---|---|
| AES-256-GCM round trip | PASS |
| Wrong-key rejection | PASS |
| Tamper rejection | PASS |
| Root VirtualLock | PASS |
| Root zeroization | PASS |
| Persistent key file created | false |
Physical entropy does not need to run at bulk-encryption speed. The physical event creates authority; symmetric cryptography scales that authority across the workload.
Persistent proof without persistent secret authority
INETERNUM runs two superimposed systems. The operational/causal graph creates and consumes cryptographic authority. The epistemic graph creates verifiable knowledge about what the operational system did.
The public package deliberately retains manifests, ciphertexts, commitments, hashes, audits, statistical results, the conditioned dataset and execution metadata while excluding private keys, pads, seeds, raw CPU/GPU physical samples, plaintexts, source code, executables and credentials.
declared public file hashes matched in independent recalculation, with zero missing and zero mismatches.
Commitment layer
Objects intentionally not published can still be cryptographically fixed without being disclosed as recovery material.
Explicit absence
The collection report records missing public artifacts instead of silently treating them as verified.
Properties that emerge from the whole system
| Property | Meaning |
|---|---|
| Transient cryptographic authority | The root exists for an action and its lifecycle includes destruction. |
| Local physical sovereignty | CPU/GPU/OS/TPM support operation without a remote QPU dependency. |
| Multi-contribution dependency | Documented ablations test functional dependence on CPU, GPU, OS and TPM contributions. |
| Event binding | Documented displacement gates test time, device, history and functional-order binding. |
| Causal continuity without secret continuity | History survives through causal state; the prior secret root does not need to. |
| Evidence / recovery separation | Proof persists without intentionally preserving the root as a recovery object. |
| Temporal attack-surface compression | The protocol deliberately minimizes how long and where secret authority exists. |
| Decoupled scalability | A 32-byte root governs a 4 GiB authenticated workload at 1.273 GB/s. |
| Post-burn auditability | The event remains inspectable after controlled secret state has been destroyed. |
A different lifecycle, not a claim that every primitive is new
KMS/HSM systems address custody and managed key lifecycles; TPM provides hardware-rooted key properties; forward-secure and key-evolving cryptography address temporal key evolution; entropy-source standards address health, conditioning and conservative estimation; AEAD provides authenticated encryption. INETERNUM's distinguishing object of study is the integration of these concerns around an event-bound root that is intended to disappear while causal state and non-secret evidence survive.
Comparative research performed for the technical report found clear prior art for individual components and neighboring ideas, but did not identify a published architecture equivalent to the specific integrated lifecycle documented here: local physical acquisition, conservative entropy budgeting, CPU/GPU/OS/TPM contribution, device/history/order binding, ephemeral transfer without a key file, high-throughput authenticated consumption, wrong-key and tamper rejection, controlled memory destruction, causal continuity and persistent public evidence not designed for recovery.
Strong claims require precise boundaries
The public evidence supports the documented protocol lifecycle and its released artifacts. It does not claim whole-machine erasure across registers, kernel, hypervisor, firmware, DMA, snapshots or third-party runtime internals; it is not a formal NIST certification; it does not equate AES throughput with physical entropy throughput; and it does not claim that a live root is impossible to capture by an adversary already controlling the execution environment.
The design target is narrower and concrete: minimize the lifetime and intentional persistence of secret authority, make event dependence testable, and preserve evidence after the secret has fulfilled its function.
Download the evidence
HUMAN BLOOMING — INETERNUM Public Evidence
The downloadable ZIP contains the public manifests, ciphertexts, commitments, audits, statistical results, conditioned dataset, benchmark metadata, public hash ledger and collection report used to substantiate the published technical claims.
Download Public Evidence ZIPSize: 1,041,432 bytes · SHA-256:470DE0D7AB5E81845CCA6AE5CFA0C8CB08CDEECE435F05596BD9FF0E65F3551B
Verification example: sha256sum HUMAN_BLOOMING_INETERNUM_PUBLIC_EVIDENCE_20260929.zip