TardiSHA

TardiSHA

TardiSHA is a deterministic structured-content seal, source engine, and constructed computational language created by Magus Jamye Reficul Ahnend.

The name expands to Time and Relative Dimension in Space Hash.

TardiSHA is the first public software implementation of the Ahnend Logical Q-State Core. It implements ALQC source emission, the Final Equation 𝔃 route, Court and Domus derivation, Synodic Magicae manifestation, and the Aeternum return operator on ordinary computers.

It accepts files, directory trees, standard input, exact strings, and canonical in-memory values. From the source it derives a Unicode structure called a Grimchain.

A Grimchain records:

• two source-resolved Goetics;
• a governing Court;
• an independently resolved alternating Court;
• an inherited Q-body;
• a compressed Shadow Locus or finite Synodic Magicae middle;
• the complete return shell.

The same source, source domain, nonce, and selected middle depth produce the same Grimchain.

Basic use

The primary command is:

grimchain source.txt

A source may also be supplied through standard input:

printf 'memory returns through crystal' | grimchain

An exact shell string may be processed with:

grimchain --string "hello world"

A positive Synodic Magicae middle depth may be selected by placing the number before the source:

grimchain 64 source.txt

or with:

grimchain --middle 64 source.txt

When no positive middle depth is supplied, the Grimchain uses the compressed Shadow Locus glyph `⛎`.

Example

For the exact UTF-8 source bytes:

The path out carries its path back.

including its terminal newline, TardiSHA version 23 produces the following depth-zero Grimchain:

🜛✡🜚ᚲ🜚:🜖_::🜕::🜕:⛎:🜗::🜕::_𝔅:🜚🜇🜚ꙮ🜛

The depth-zero body contains exactly 31 Unicode code points.

The opening colon before the Q-bias glyph and the closing colon after `𝔅` are part of the grammar. They are not optional spacing.

Visible grammar

The exact visible Grimchain grammar is:

🜛gᵢ🜚κ(C)🜚:B_Q_::V₀::V₁:Aₙ:V₂::V₃::_𝔅:🜚κ(D)🜚gⱼ🜛

The symbols have the following offices:

Body	Office
`gᵢ`	First source-resolved Goetic and governing identity of Court C
`κ(C)`	Glyph of governing Court C
`B_Q`	Q-bias glyph inherited through Court C
`V₀,V₁,V₂,V₃`	Four Q-state glyphs in exact vector order
`A₀ = ⛎`	Compressed Shadow Locus body
`Aₙ`	Positive-depth Synodic Magicae manifestation
`κ(D)`	Glyph of independently resolved alternating Court D
`gⱼ`	Second source-resolved Goetic and hyperbolic parent of Court C
`🜚`	Klein join between bodies
`🜛`	Outer closure of the complete word
`_𝔅`	Return through the underscore to the opening Q-bias office

At depth zero:

A₀ = ⛎

At positive depth `n`, the middle `Aₙ` contains exactly `n` Synodic Magicae code points.

The fixed shell contains 30 code points. The complete visible length is therefore:

31

at depth zero, and:

30 + n

at positive depth `n`.

The Domus words

The ten-code-point opening Domus word is:

L₈ = :B_Q_::V₀::V₁:

The ten-code-point returning Domus word is:

R₈ = :V₂::V₃::_𝔅:

The center is placed between these words without removing either boundary colon:

Γ₈(X,Aₙ) = L₈ Aₙ R₈

The complete seal is:

🜛 gᵢ 🜚 κ(C) 🜚 Γ₈(X,Aₙ) 🜚 κ(D) 🜚 gⱼ 🜛

Source derivation

TardiSHA processes a source in the following order:

finite source body F
    ↓
ALQC sponge with twelve finalized 64-bit Goetic lanes
    ↓
structural measure S and AHN-relative operational measure O
    ↓
𝔃₀ through Φ⁻¹ and 𝔃₁ through Φ⁻²
    ↓
ordered Goetic pair (gᵢ,gⱼ)
    ↓
governing Court C
    ↓
144-entry Court product measure Wᴿ = O ⊗ S
    ↓
independently resolved alternating Court D
    ↓
exact ξ_D within D's own interval
    ↓
ν_H = Ω_D + ξ_DΦ²
    ↓
Q-body and Domus witnesses
    ↓
one Domus identity
    ↓
⛎ or a finite Synodic Magicae manifestation
    ↓
Aeternum Mirror return

A later layer does not replace an earlier resolved office.

Source emission

For a source `F`, the ALQC sponge emits twelve unsigned 64-bit lanes:

E(F) = (L₀,L₁,…,L₁₁)

Each lane satisfies:

0 ≤ Lₖ < 2⁶⁴

All twelve lanes participate in the source derivation.

The Goetics are not selected from an endpoint byte, a modulo-12 shortcut, lexical sentiment, or an added random value.

The supported source domains include:

• canonical material;
• raw files;
• directory trees;
• standard input;
• exact strings;
• canonical in-memory values.

Filesystem metadata is excluded from raw-file identity. Directory identity is derived from a canonical tree record.

Parliament measures

The same finalized source state is read through a structural measure and an operational measure.

The structural measure is:

Sₖ = Lη(pₖ)

with:

ΣS > 0

The operational measure begins at AHN, the Parliament phase seam. Its directed gaps around one complete 64-bit turn form:

Oₖ = Δη(pₖ)

and satisfy:

ΣO = 2⁶⁴

The structural and operational bodies are two readings of the same completed source emission.

Final Equation 𝔃

The completed source state is squeezed into consecutive 256-bit cadences:

σ(E(F)) = 𝔃₀(F) ‖ 𝔃₁(F) ‖ …

The structural bearing is:

ALPHA = Φ⁻¹ = (√5 − 1)/2

The operational bearing is:

BETA = Φ⁻² = (3 − √5)/2

Both intervals are resolved using exact `ℚ(√5)` arithmetic.

The Golden closure is:

Φ⁻¹ + Φ⁻² = 1

The source-route witness derives:

D-COMP(𝔃) = 0
Truth(𝔃) = 1

Goetics and Courts

The two Parliament bearings resolve an ordered Goetic pair:

gᵢ = Resolve₁₂(S, phase=𝔃₀, bearing=Φ⁻¹)
gⱼ = Resolve₁₂(O, phase=𝔃₁, bearing=Φ⁻²)

The governing Court is then:

C = Cᵢⱼ

with address:

address(C) = 12i + j

There are twelve governing roots and twelve alternating roots, producing:

12² = 144

ordered Courts.

The twelve diagonal self-Courts are valid and are not altered merely to force a difference between the two roots.

Court C inherits its identity, Q-bias, and Q-vector from its governing Goetic `gᵢ`.

Its resonance anchor is inherited from its alternating Goetic `gⱼ`:

Ω_C = frequency(gⱼ)

Its source-bound Court frequency is:

ν_C = Ω_C + δ_C

subject to:

|δ_C| ≤ Φ

Alternating Court D

The second Court used by the Domus is not automatically the transpose `Cⱼᵢ`.

TardiSHA constructs a 144-entry Court product measure in canonical row-major order:

Wᴿ[k,l] = O[k]S[l]

with:

address = 12k + l

Its total is:

ΣWᴿ = (ΣO)(ΣS) > 0

and its normalized body satisfies:

Σ(Wᴿ/ΣWᴿ) = 1

Court D is resolved independently across all 144 Court intervals:

D = Resolve₁₄₄(Wᴿ, phase=𝔃₁, bearing=Φ⁻²)

No additional digest, cadence, nonce, or entropy source is introduced for Court D.

Domus motion

The signed position of the `𝔃₁` bearing within Court D's interval is:

ξ_D = 2(effective_bearing − cumulative_before) /
      (cumulative_after − cumulative_before) − 1

and satisfies:

−1 ≤ ξ_D ≤ 1

The Domus anchor is the frequency of D's alternating Goetic:

Ω_D = frequency(D.alternating_goetic)

The Domus resonance is:

ν_H = Ω_D + ξ_DΦ²

therefore:

|ν_H − Ω_D| ≤ Φ²

The layer bounds are:

Goetic → Court: bounded by Φ
Court → Domus: bounded by Φ²

Court crossing body

The ordered crossing of governing Court C and alternating Court D is indexed by:

index(C,D) = 144·address(C) + address(D)

Its cardinality is:

|C×D| = 144² = 20,736

The indices range from `0` to `20,735`.

This is the finite ordered Court-crossing body. It is not the number of all possible Domus states.

Q-body

The visible Q-body is inherited from governing Court C through its governing Goetic.

The four Q-state glyphs are:

State	Glyph	Office
Q₀	`🜔`	Form and latent structural presence
Q₁	`🜕`	Truth, archive, and rational commitment
Q₂	`🜖`	Shadow, debt, and pressure to be converted
Q₃	`🜗`	Recursion, residue, and return-fire

The vector remains in exact order:

[Q₀,Q₁,Q₂,Q₃]

The visible bias and vector glyphs are derived from the inherited Court body.

Synodic Magicae

At positive depth, the Domus middle is generated from a living alphabet of 192 distinct Unicode code points.

All 192 glyphs belong to the same language body. The twelve grammar glyphs are native members of the alphabet rather than a separate suffix or notation layer.

The glyphs `☽`, `☉`, and `☾` remain three distinct code points.

No glyph is normalized, transliterated, merged, omitted, or replaced by a visually similar character.

For a fixed source, source domain, nonce, and Domus identity, a shorter positive-depth middle is a prefix of every longer middle derived from the same body.

Changing depth changes the visible extent. It does not recompute a different source root.

State-space

At positive depth `n`, the non-middle Grimchain slots contribute:

12²·144²·4⁵ = 3,057,647,616

The middle contributes:

192ⁿ

The complete positive-depth visible state count is therefore:

|Grimchainₙ| = 12²·144²·4⁵·192ⁿ

or:

|Grimchainₙ| = 3,057,647,616·192ⁿ

Every declared depth `n` is finite.

Because there is no greatest declared finite depth, the set of all finite manifested depths is countably infinite:

|Domus_TardiSHA| = ℵ₀

Aeternum return

Let `Gₙ(F)` be the Grimchain derived from finite source body `F` at middle depth `n`.

The outward section appends that Grimchain to its source:

s𝔃,ₙ(F) = F ‖ Gₙ(F)

The return operator reads the terminal Grimchain, determines its actual depth, recomputes the same-depth value from the preceding body, and measures the UTF-8 residual:

D_return(F,S) = Δ(S,Gₙ(F))

The return succeeds only when the residual is exactly zero:

ρ𝔃(F ‖ S) = F       when S = Gₙ(F)
ρ𝔃(F ‖ S) = F ‖ S   when S ≠ Gₙ(F)

Therefore:

ρ𝔃 ∘ s𝔃 = id

An exact terminal return carries:

source D-COMP = 0
source Truth  = 1
return D-COMP = 0
return Truth  = 1
fold          = true

A parseable but false terminal return carries:

return D-COMP > 0
return Truth  = 0
fold          = false

A stale, mutated, foreign, or nonterminal Grimchain is treated as source material rather than accepted as a return.

Inspection and verification

A visible Grimchain may be parsed with:

grimchain '🜛...🜛' --inspect

Inspection checks the visible grammar.

Verification requires the original source and recomputes the source emission, Goetics, governing Court C, alternating Court D, Q-body, Domus identity, middle, and outer shell.

A string is not accepted merely because it resembles a valid Grimchain.

A file or stream may be verified with:

grimchain source.bin --verify --output source.grim

Checksum-style lists may be checked with:

grimchain -c checksums.txt

or:

grimchain --check checksums.txt

Manifests

TardiSHA can produce manifests for files and directory trees:

grimchain 64 --manifest file.bin
grimchain 64 --manifest directory
grimchain 64 -R --manifest directory

Manifest processing reads and witnesses every selected source byte.

A cached filesystem signature does not replace current source material.

Implementation

TardiSHA version 23.0.7 requires Python 3.10 or newer.

The per-byte sponge requires the compiled extension:

TardiSHA._alqc_kernel

Import fails if the compiled kernel is absent. There is no pure-Python fallback.

The package installs the following commands:

grimchain
tardisha
TardiSHA

The public implementation is distributed as:

• a Python wheel;
• a source distribution;
• a Debian package;
• a Launchpad source package;
• an auditable source checkout.

Installation

Using the direct Debian package:

sudo apt install ./dist/tardisha_23.0.7-1_amd64.deb

Using the wheel:

python3 -m pip install dist/tardisha-23.0.7-*.whl

Using the source distribution:

python3 -m pip install dist/tardisha-23.0.7.tar.gz

Using a source checkout:

python3 -m pip install .

Validation

The 23.0.7 release records the following validation results:

Validation body	Result
Built-in TardiSHA suite	154/154 pass
Public integration suite	59/59 pass
Independent Golden resolver	200/200 match
Hostile Aeternum audit	8/8 pass
Hostile source population	32 sources
Append-only return lineage	16 exact returns
ALQC compliance suite	12/12 pass
Non-manifest terminal commands	32/32 pass
Manifest create and verify commands	6/6 pass
Court registry	144/144 addresses
C×D crossing index	20,736/20,736 positions
Court product normalization	exact 1
ξ_D interval bound	exact
ξ_DΦ² allowance	exact
Domus-internal hash calls	zero

Classification boundaries

TardiSHA is described by its implementation as:

• a deterministic ALQC source emission;
• a twelve-lane state machine;
• an exact Golden Parliament route;
• an ordered 144-Court body;
• an exact 20,736-position C×D crossing body;
• a Court-rooted Domus resonance;
• a Living Domus grammar;
• a prefix-stable Synodic Magicae manifestation;
• a measured Aeternum section and return;
• file, directory, stream, manifest, and reversible archive tooling;
• an exactly countable discrete Domus state-space across unbounded finite depth.

It is not described as:

• an encryption system;
• a public-key signature system;
• a standardized replacement for protocol-required cryptographic primitives;
• proof that every different source has a globally unique visible Grimchain;
• a claim that longer output creates additional entropy;
• quantum hardware.

External links

• Official source repository
• Official Corpus and Textbook repository