PAILEvidence Runtime
PAIL Research Program

What should an AI be allowed to say?

Most AI systems begin with an answer and then look for confidence. PAIL begins with a different question: does the available evidence permit an answer at all?

Follow the inquiry
01

The problem

Fluent language is not the same as verified truth.

An AI can write a convincing response even when two records describe different people, when an old event is mistaken for the latest state, or when the requested fact never appeared in the source.

Retrieval helps a model find likely material. It does not, by itself, decide whether those pieces belong together. PAIL studies that missing decision layer: a deterministic checkpoint between retrieved data and generated language.

Find broadly. Verify narrowly. Generate only after the boundary is clear.
02

The method

SutraFlow turns evidence checking into an ordered process.

Panini's grammar is an engineering inspiration, not a claim that ancient grammar was an AI system. The useful idea is simple: define roles precisely, apply rules in a known order, preserve exceptions, and do not silently combine incompatible forms.

  1. 01
    Read without trusting

    Accept records, logs, documents, or sensor events as untrusted observations.

    RAW INPUT
  2. 02
    Name the roles

    Separate who acted, what changed, which object was affected, when it happened, and where the claim came from.

    ROLE BINDING
  3. 03
    Hold the boundary

    Keep neighboring cases apart. Exact identifiers, source boundaries, and time constraints must agree.

    RELATION GUARD
  4. 04
    Resolve or expose conflict

    Apply deterministic precedence and contradiction rules. Disagreement is returned as disagreement, not hidden by ranking.

    RULE DECISION
  5. 05
    Release the smallest proof

    Pass only supported facts and their provenance to the answer layer. If proof is missing, release a refusal contract.

    VERIFIED PACKET
03

What exists today

Running code, reference material, and open research are not the same thing.

This distinction is part of the product contract. A named idea is not counted as implemented until software executes it and a test can fail.

Executable runtime

Source-aware ingestion, role and identifier normalization, relation checking, contradiction handling, temporal cutoffs, prompt-injection quarantine, evidence packing, provenance, and fail-closed outputs run in the current middleware.

Runs and is testable
Catalog and design reference

Additional grammar references document possible rule families and naming conventions. They guide future implementation but do not make runtime decisions merely because they are listed.

Useful context, not execution
Exploratory research

Acoustic representations, offline waveform transport, adaptive memory, richer narrative reasoning, and learned routing remain experiments until controlled comparisons show an advantage.

Hypothesis, not product claim
04

Falsifiable hypotheses

The method must survive comparison, not admiration.

A hypothesis belongs here only when another team can design a test that disproves it.

H1

Relation guards reduce wrong joins.

Compare the same retrieved candidates with and without PAIL on held-out, multi-source questions.

Falsified if the guarded path does not reduce wrong entity combinations without unacceptable loss of correct answers.
H2

Fail-closed decisions reduce unsupported answers.

Measure answer coverage, refusal precision, conflict recall, and wrong-release rate together.

Falsified if refusals merely hide errors or block too many answerable questions.
H3

Evidence packets reduce context without losing required facts.

Count tokens with the declared tokenizer and test whether every labeled answer fact survives.

Falsified if savings disappear against a fair baseline or required evidence is truncated.
H4

Reviewed feedback can improve routing without redefining truth.

Let feedback adjust candidate routes while deterministic evidence rules retain final authority.

Falsified if route learning can self-authorize unsupported facts or amplify unreviewed errors.
05

Current evidence

What the prototype supports, and what it does not prove.

Exact entity isolation

Controlled dirty-data tests show that explicit identifiers can keep neighboring cases from being merged.

This does not establish accuracy for every schema, language, or missing-ID dataset.

Conflict hard stop

When protected relation fields disagree, the runtime can release the contradiction instead of selecting a convenient value.

Conflict detection is correlation control; it does not prove which source describes reality.

Measured evidence reduction

Per-query token accounting can compare the selected packet with its declared source baseline.

Small answers can cost more because control metadata has overhead. Savings are workload-dependent.

Acoustic ablation

Earlier experiments found that unconstrained symbolic resonance could damage ranking, so it was prevented from overriding deterministic order.

No broad semantic or large-scale retrieval advantage has been demonstrated.

Synthetic and local benchmarks are engineering evidence, not a substitute for independent customer replication, production soak testing, or peer review.

06

Honest limits

PAIL controls evidence. It does not manufacture truth.

It cannot verify a fact absent from its sources.

It cannot prove causality merely because events share identifiers or timestamps.

It is not a universal semantic model for literature, images, speech, or every language.

Its acoustic layer is not a replacement for learned embeddings or physical memory hardware.

Its production readiness still depends on deployment-specific security, scale, recovery, and integration testing.

The correct output can be: insufficient evidence.
07

Next research directions

The next gains must come from better experiments.

NEAR TERM

Independent domain replication

Run blind, labeled evaluations across support, operations, insurance, healthcare administration, industrial telemetry, and offline field data.

MEASUREMENT

End-to-end answer evaluation

Compare vector-only, vector plus PAIL, and deterministic PAIL paths using answer correctness, wrong release, refusal quality, latency, and cost.

LEARNING

Bounded adaptive memory

Study whether reviewed feedback can strengthen useful routes while contradiction memory and evidence authority remain immutable.

SIGNAL RESEARCH

Acoustic transport and representation

Separate reliable signed-packet transport experiments from claims about semantic resonance, then publish negative as well as positive ablations.

Research and IP collaboration

Bring a difficult evidence problem, not a polished success story.

We are looking for reproducible datasets, independent evaluation, domain partners, and reviewers who will challenge the method. Public contracts and test methods can be inspected; proprietary grammar and signal internals remain protected.

Propose an evaluation Email the laboratory For research, licensing, IP review, or a controlled technical demonstration.