Open Standard · Free to Implement · Formally Proven

A Dimensional Address
Grammar for
Observable Reality

Every observable phenomenon — at any scale, in any domain, at any time — addressed in a single grammar with explicit causal, epistemic, jurisdictional, and evidentiary encoding.

Read the Specification ↗ All Documents
Full Address Syntax — DAG-OR
MGN·URB·STR·SR/NA/US/FL/MIA·A4F2·|HMN|·:VID·%HUM·SEC:E·.D-I@2026-03-31T11:00:00Z·^EVID·^VFYD·§US-FL
Namespace Domain Realm + Locus Node Scale Medium Observer Activity Evidence Grade Jurisdiction
15
Zenodo DOIs · Published
272k+
Registry Classifications · Live
11
Domains · Universal Coverage
9
Scale Tiers · Planck to Cosmic
60yr
Gettier Problem · Structurally Dissolved
Open Standard Free to Implement · No License Fee CC BY 4.0 · All Documents Modulign™ and MGN™ are trademarks of Vincent Gonzalez
Published Scholarship

The Corpus.

Every document is published under CC BY 4.0, archived on Zenodo with a permanent DOI, and freely citable. Loaded live from the MGN community.

Document 01 · Foundation 10.5281/zenodo.19348704
Modulign Standard
A Dimensional Address Grammar for Observable Reality
The complete specification. Eleven domains, nine scale tiers, five realm prefixes, three registries, ten system invariants, and the full Trust Architecture.
Specification Open Standard DAG-OR
Read on Zenodo ↗ PDF
The Grammar

What a Modulign
Address Encodes

A minimum valid address — five required segments — is immediately useful. Every additional segment adds precision without invalidating the base code.

DOM · SUB
Domain
What type of observable environment. Eleven domains: URB NAT TRN COM RES EVT SEC INF ENV BIO UNK.
REALM / G1–G4
Locus
Where in physical space. Five realms (SR AT AQ OR VR) × four-level geo hierarchy. Monotonic: no city without country.
NOD
Node
The specific instrument or site. Base36⁴ = 1,679,616 unique nodes per locus.
|SCL|
Scale
At what scale observed. Nine tiers: |QNT| |MLC| |BIO| |HMN| |GEO| |STL| |CSM| and more. Wrong scale = false classification.
:MED
Medium
How captured. Eleven codes including :SYN — the synthetic content primitive. VR/ + :SYN ↔ SyntheticContent = TRUE.
%OBS
Observer
Who classified and at what competence. %HUM %AUT %HYB × domain × :T :E :A. Gates ^EVID eligibility.
@TIME
Timestamp
ISO 8601. Required for ^EVID grade. Immutable in the append-only Observational Ledger.
§JUR
Jurisdiction
Governing legal framework. Constitutive in ^EVID classifications. Encodes which admissibility standard applies.
^META
Evidence Grade
^EVID: append-only, cryptographically signed, satisfies FRE 901(b)(9). ^PROV: provisional, excluded from proceedings.
Full Syntax · All Segments
MGN·[DOM·SUB]·[REALM/G1/G2/G3/G4]·[NOD]·|SCL|·:[MED]·%[OBS]·.[CAM]-[ACT]@[TIME]·^[META]·§[JUR]·~[DYN]·+[BG]
Formal Results

What the Architecture
Formally Proves

These results are consequences of the architecture, not motivations for it. The Standard was built to classify television channels. The epistemology was an accidental discovery during formalization.

Theorem 4.1 · Formal Logic
ATNA
∀ Stepₙ ∈ CDP : justificatory_input(Stepₙ) ⊆ F(ω)
T(C) → F(ω) → J(C,ω) → C
∴ C is non-accidentally true when true. □
The Address-Theoretic Non-Accidentality Principle. A classification produced by the full Decision Protocol cannot be accidentally true. The structural precondition for Gettier cases does not exist in the architecture.
Theorem 4.1C · Formal Logic
Fake Barns Dissolved
scale(T(C)) = |GEO| (regional)
SCL(Henry) = |HMN| (perceptual)
SCL(C) ≠ scale(T(C)) → C is FALSE. □
Goldman's fake barns case — which defeats every fourth-condition proposal — is dissolved by scale-sensitivity. The architecture refuses to certify barn-knowledge at the wrong scale.
Invariant I6 · Standard
Synthetic Content Primitive
REALM = VR ∧ MED = SYN
↔ SyntheticContent(ω) = TRUE
Not a tag. A structural biconditional.
VR/·:SYN is the first formal epistemic primitive for synthetic content. The biconditional is architecturally enforced, not policy-dependent.
Theorem 6.1 · Formal Logic
Evidentiary Completeness
∀e ∈ {Auth, CoC, BestEvidence, Daubert}
satisfied(e, C^EVID) = TRUE. □
FRE 901(b)(9) · FRE 1001–1008 · FRE 702
Every ^EVID-grade classification satisfies all four foundational legal admissibility requirements as constitutive outputs of the CDP.
Corollary 4.1 · Formal Logic
Zagzebski's Recipe Fails
Recipe entry point: w' where X satisfied, T(C) fails.
Under ATK: X = CDP requires F(ω).
If T(C) fails, F(ω) severs. CDP cannot complete. □
Zagzebski (1994) proved no K = df true belief + X escapes Gettier cases while X is fallible. ATK escapes by abandoning the K = df form entirely.
Theorem 4.2 · Formal Logic
Intersubjectivity
CDP(ω,O₁) = CDP(ω,O₂)
for O₁,O₂ with equivalent competence
modulo threshold boundaries. □
Any two competent observers applying the CDP to the same observable features must converge on the same classification. Procedural — not metaphysical — intersubjectivity.
Public Record

Timestamped.
Permanent. Citable.

All documents are published to Zenodo with permanent DOIs. Every record is version-controlled and freely citable.

March 31, 2026 · Zenodo
Modulign Standard
Full specification published. Eleven domains, ten invariants, three registries, Trust Architecture, ATK/ATNA formulations. DOI: 10.5281/zenodo.19348704
Live · CC BY 4.0
March 31, 2026 · Zenodo
The Formal Logic of Modulign
All proofs published. ATNA, Gettier dissolution, Zagzebski corollary, Intersubjectivity, Scale-Sensitivity, Evidentiary Completeness. DOI: 10.5281/zenodo.19350848
Live · CC BY 4.0
March 31, 2026 · Zenodo
Synthetic Content as Epistemic Category
Five-case typology, EU AI Act Article 50 analysis, C2PA comparison, VR/·:SYN governance implications. DOI: 10.5281/zenodo.19351055
Live · CC BY 4.0
March 31, 2026 · Zenodo
Modulign as Evidence
Legal treatise. FRE admissibility proofs, Daubert mapping, chain-of-custody architecture. DOI: 10.5281/zenodo.19351250
Live · CC BY 4.0
April 6, 2026 · Zenodo
Structural Dissolution of the Gettier Problem
Address-Theoretic Epistemology. ATK formulation. Full formal proof of Gettier dissolution. DOI: 10.5281/zenodo.19432926
Live · CC BY 4.0
April 13, 2026 · Zenodo
Dimensional Address as Rigid Designation
How DAG-OR grounds reference without metaphysical posit. Kripke rigid designation satisfied structurally. DOI: 10.5281/zenodo.19557382
Live · CC BY 4.0
April 13, 2026 · Zenodo
Automated Classifier Certification Framework
AUT framework. Observer certification protocol for automated classifiers. DOI: 10.5281/zenodo.19559602
Live · CC BY 4.0
April 14, 2026 · Zenodo
The Classification Deficit — EU AI Act Article 50
The epistemic gap Article 50 cannot close and the formal standard that does. DOI: 10.5281/zenodo.19578571
Live · CC BY 4.0
April 18, 2026 · Zenodo
Chain of Custody Formalisation in Digital Forensics
^EVID architecture as registry-based evidentiary framework. NIST SP 800-86 / ISO 27037 alignment. DOI: 10.5281/zenodo.19642385
Live · CC BY 4.0
April 18, 2026 · Zenodo
AI-Generated Evidence Admissibility
Formal classification framework for synthetic content in legal proceedings. DOI: 10.5281/zenodo.19642437
Live · CC BY 4.0
April 18, 2026 · Zenodo
Architecture, Epistemic Enforcement, and Universal Classification
Implementation across sensor-heterogeneous environments. Live registry with 182,000+ classifications. DOI: 10.5281/zenodo.19642557
Live · CC BY 4.0
April 18, 2026 · Zenodo
Inter-Rater Reliability of Automated Modulign Classifiers
First empirical reliability study. κ = 0.847 overall across 234 streams, two independent classifiers. DOI: 10.5281/zenodo.19643322
Live · CC BY 4.0
April 18, 2026 · Zenodo
On The Record: Toward a Formal Epistemology of Journalistic Attestation
Formal basis for distinguishing attested from synthetic claims in public journalism. DOI: 10.5281/zenodo.19644070
Live · CC BY 4.0
2026 · Under Review
Structural Dissolution of the Gettier Problem — Submitted to Analysis
Peer review pending at Analysis (Oxford). The companion paper establishing the philosophical foundation of ATK.
Under Review · Analysis (Oxford)
2026 · In Preparation
Dimensional Address as Rigid Designation — Prepared for Mind
Target journal: Mind (Oxford). DAG-OR as the first structurally grounded theory of reference.
In Preparation · Mind (Oxford)

The Observation Registry

A publicly queryable, append-only database of MGN-classified observations. Query by MGN code, GSI-ID, domain, region, or keyword. Every ^EVID record is cryptographically signed and tamper-evident. 182,000+ classifications. Live.

Open Registry ↗

Support This Infrastructure

The Modulign Registry is free to all users — no subscriptions, no paywalls, no ads. All 15 publications are open-access on Zenodo. The entire annual cost of keeping this infrastructure publicly accessible is $322.99 — domain, server, and database. If this work is useful to you, keeping it online is the ask.

GitHub Sponsors ↗