NoGlyph · Blank Generative Constraint Projection Language

A program is not its visible text.

In NoGlyph the visible source can be completely blank. The program is a canonical set of constraints, generation rules, capabilities and dependencies; a deterministic resolver turns it into a program graph, and a conventional compiler builds what that graph lowers to.

Research line · MVP-0 to MVP-7 · revalidated locally

Blank surface ≠ program encoding. NoGlyph is not a Whitespace-style language: spaces, tabs and newlines are not opcodes.

The idea

Separate the program from its surface.

Intent, candidate edits, canonical constraints, the resolved program, its views, the lowered code and the native executable are kept apart, so each step can be inspected and checked on its own.

01

The blank view is one projection

The canonical program lives in constraints, not in a text file. Blank, graph, debug and generated-C views are projections of the same program, and changing only the blank surface changes neither the program graph nor its hash.

02

Deterministic, and fails closed

The same constraints always resolve to the same graph and hash. Equal-priority conflicts are rejected, undeclared capabilities fail closed, every build records its provenance, and a separate lock pins the chain from constraints to backend artifact so a build can be verified against it.

03

Existing compilers stay

NoGlyph adds a semantic, generative front end above existing toolchains. Its backend emits C11 for a GCC- or Clang-style compiler; it does not replace them.

04

AI proposes, the author commits

AI-assisted authoring produces candidate patches only. Their semantic diff, validation and lock impact are shown, and nothing becomes canonical without an explicit author commit.

The pipeline

From constraints to a native executable.

Each arrow is a separate, recorded step. The blank view sits beside the pipeline, never inside it.

  1. Intent or candidate patch
  2. Explicit author commit
  3. Canonical constraints
  4. Static plugin runtimecapability-gated
  5. Resolution report
  6. Program graphviews: blank · graph · debug · generated C
  7. Lowering IR → C11 backend
  8. Lock and verify
  9. Conventional compiler → executable
Where it stands

A complete reference architecture, still a research line.

The reference implementation covers MVP-0 through MVP-7. It is local-first and claims nothing beyond its validation ledger.

Implemented

  • Program Graph v1: stable semantic IDs, typed edges and canonical hashing.
  • Constraint Manifest v1 and a deterministic resolver with structured errors.
  • A versioned projection system: blank, graph, debug and generated-C views.
  • Lowering IR and a C11 backend under an explicit GCC/Clang compiler contract.
  • Reproducible locks and verification; a static, capability-gated plugin boundary.
  • Candidate-only AI-assisted authoring with an explicit commit boundary.

Validated

  • Revalidated on Windows on 2026-09-26: 94 of 94 tests pass with a native C compiler configured.
  • The reference semantic hashes on Windows match the canonical baseline.

Not claimed

  • Security from blankness, or replacing existing compilers.
  • A uniquely correct program for arbitrary natural-language intent.
  • Identical executables across platforms, MSVC support, or dynamic external plugins.
In the family

Five public lines

  1. EML-U

    Language evolution

  2. EML-P

    Practical

  3. EML-NOVA

    Structure-first

  4. NoGlyph

    Constraint-first

  5. CVSG

    Chinese-first

Back to the family
ΣEML 2026

Efficient New Language — a high-density semantic overlay for humans and AI agents.

This site’s demos run on the real EML toolchain, in your browser.

© 2026 EveMissLab (一言諾科技有限公司) / Neo.K. All rights reserved.