EpistemicPhysics
All articles
Field note · Lineage

One trial, many echoes

Follow a single observation through an echo chamber, then discover effective sample size, lineage-aware attention, and the geometry of justification.

A sensor at an observatory records a faint, instantaneous flash of gamma rays.

A researcher writes down the observation in a lab note. Three colleagues read the note and cite it in their reports. A dozen science blogs summarize the reports, and by evening, hundreds of social media posts proclaim that multiple independent sources have confirmed the signal.

The claim sounds overwhelmingly credible because it has grown loud.

Yet beneath all the noise, citations, and retweets, there remains only one single physical interaction with the universe.

Now imagine a second sensor on the other side of the planet that independently records a flash at the same timestamp. Its report might contain identical wording to the blog posts, but it carries something radically different: a distinct physical lineage.

Classical probability theory treats observations as numbers, oblivious to the paths by which they traveled. To prevent an information system from turning into an echo chamber, we must track the route an observation took from physical reality into belief.

In Epistemic Physics, we call this route lineage.

The whisper network: Why volume is not evidence

In ordinary human communication, we frequently confuse volume with evidence. When ten people repeat the same rumor, our intuition treats it as ten pieces of supporting data.

In Bayesian inference, this mistake is catastrophic.

Suppose two hypotheses, H1 and H2, are tested by an experiment. An original observation D produces a likelihood ratio:

L=P(D∣H1)P(D∣H2).

If five separate commentators report the exact same observation D, and an algorithm naively treats them as five conditionally independent trials, it multiplies the likelihood ratios:

Lnaive=L5.

If L=3 (mild support), the naive update computes 35=243 (overwhelming confirmation).

In terms of epistemic rapidity ρ=12ln⁡L, the update scales linearly with the number of echoes k:

ρecho=k2ln⁡L=kρ.

Every echo delivers another unearned velocity boost, hurtling the system’s belief toward the speed of light.

When I formulated the foundations of Epistemic Physics, it became clear that an evidence notebook must track more than its current coordinates: it must preserve the cryptographic pedigree of its tracelets. A belief is not merely where you stand; it is the history of how you got there.

Giving an observation a name: The idempotence of set union

The mathematical cure for echoes begins with an elementary algebraic property: idempotence.

An algebraic operation is idempotent if applying it multiple times produces the exact same result as applying it once: f(f(x))=f(x).

In a lineage-aware notebook, every original trial receives a globally unique identifier (such as a cryptographic hash of its timestamp, detector ID, and raw sensory readings): τ1,τ2,…

A report is not a bare count: it is a mathematical set of trial identifiers.

Suppose Report 1 carries the set of trials {A,B}, and Report 2 carries the set of trials {B,C}.

When an agent integrates both reports, it does not add their cardinalities (2+2=4). It computes their set union:

{A,B}∪{B,C}={A,B,C}.

Because set union is idempotent (S∪S=S), reading the same trial a thousand times leaves the collection completely unchanged:

{A}∪{A}∪⋯∪{A}={A}.

The single physical trial A enters the evidence ledger exactly once.

Interactive · 02

One trial. Many echoes.

Each letter identifies an original trial. Copies keep the same identity. In this example, distinct original trials are assumed independent.

A+original
B−original
C+original
Counting every appearancemean 0.633000.51probability pdensity

3 appearances counted as observations

Keeping the lineagemean 0.633000.51probability pdensity

3 original trials, prior counted once

Copying trial A changes the naive tally but leaves the lineage-aware belief unchanged. Both plots use the same probability and density scales. This example assumes known identities; real shared causes require additional modeling.

Test this in the interactive lab above. Copy an existing trial repeatedly: watch its visual echoes multiply while the lineage-aware belief remains rock-solid. Then add a genuine, independent trial, and observe how the true evidence state shifts.

Notice a crucial conceptual distinction: an identifier belongs to the physical event, while its signed interpretation belongs to a proposition. A single clinical trial measuring patient blood pressure can simultaneously provide positive evidence for “drug reduces hypertension” and negative evidence for “drug has zero cardiovascular side effects.” The physical trial keeps its unique identifier, while different propositions reference that same trial with appropriate signs.

Two pathologies of repetition: Distorted curves and exploding odds

Let us calculate exactly what goes wrong when an evidence system ignores lineage.

Consider an agent maintaining a Beta distribution over an unknown probability p. The agent starts with a neutral prior (α0,β0)=(1/2,1/2), and observes Y positive trials and N negative trials.

Now suppose each observation is copied k times across a network, and a naive agent logs every copy as a new trial:

αk=kY+12,βk=kN+12.

Look at what happens to the mean and variance:

  1. The mean probability: μk=kY+1/2k(Y+N)+1=Y+12k(Y+N)+1k. As k→∞, the prior term 1/(2k) evaporates: μk→YY+N. A mountain of photocopies drowns out prior caution, making the agent forget that its initial sample was tiny.
  2. The variance (epistemic uncertainty): Var⁡(P)k=μk(1−μk)k(Y+N)+2. With both Y and N positive, the variance shrinks like 1/k for large k! If all original observations fall on one side, the retained half-count prior gives an even faster 1/k2 decrease.

The naive notebook becomes dogmatically certain of its answer, believing it has gathered thousands of independent confirmations when it has merely photocopied a single page.

The prior duplication trap: Merging without double-counting

A more subtle echo occurs when two researchers attempt to combine their findings.

Suppose Researcher 1 and Researcher 2 both begin their investigations with the standard neutral prior:

(α0,β0)=(12,12),τ0=α0+β0=1.

Researcher 1 gathers experimental trials (Y1,N1), arriving at posterior parameters:

α1=Y1+α0,β1=N1+β0.

Researcher 2 independently gathers experimental trials (Y2,N2), arriving at posterior parameters:

α2=Y2+α0,β2=N2+β0.

Now they meet at a conference and combine their notebooks.

If they naively add their posterior parameters (α1+α2,β1+β2), they compute:

αnaive=(Y1+α0)+(Y2+α0)=Y1+Y2+2α0.

They have duplicated the prior! Their combined notebook now contains twice as much prior inertia as it should.

To combine two independent notebooks that started from the same prior baseline, you must subtract the shared prior once:

αcombined=α1+α2−α0=Y1+Y2+α0,βcombined=β1+β2−β0=N1+N2+β0.

If M independent teams combine their conclusions, they must subtract M−1 copies of the shared prior:

αcombined=∑m=1Mαm−(M−1)α0.

Prior subtraction is the simplest example of inclusion-exclusion in epistemic spacetime: to combine lineages cleanly, you must subtract the common ancestors.

Effective sample size: Kish’s formula for recycled data

In real distributed networks, data is rarely cleanly independent or purely duplicated. Instead, different original observations are repeated different numbers of times.

How much genuine statistical information does a redundant dataset contain?

We can calculate this rigorously using Leslie Kish’s design effect formula.

Suppose there are R distinct original trials, each producing an independent binary signal Zr∈{−1,+1} with true mean v=E[Zr] and variance Var⁡(Zr)=1−v2.

Now suppose trial r appears cr≥1 times in our incoming data stream, with these multiplicities fixed independently of the trial outcomes.

An analyst unaware of the duplicates calculates the weighted sample average:

v^=∑r=1RcrZr∑r=1Rcr.

Let us calculate the true variance of this estimator across repeated samplings of the original trials:

Because the original trials Zr are independent:

Var⁡(v^)=∑r=1Rcr2Var⁡(Zr)(∑r=1Rcr)2=(1−v2)∑r=1Rcr2(∑r=1Rcr)2.

For n truly independent trials, the variance of the sample mean is simply (1−v2)/n.

Equating the two variances yields the effective sample size neff:

neff=(∑r=1Rcr)2∑r=1Rcr2.

Look at what this elegant formula tells us:

  1. Equal repetition: If all R original trials are each duplicated exactly k times (so cr=k for all r): neff=(R⋅k)2R⋅k2=R2k2Rk2=R. No matter how large k is, ten thousand copies of 20 trials provide an effective sample size of exactly 20!
  2. Dominant echo: Suppose you have 10 original trials. Nine of them appear once (c1=⋯=c9=1), while one viral trial appears 100 times (c10=100). The total count is ∑cr=9+100=109. The sum of squares is ∑cr2=9(12)+1002=9+10,000=10,009. The effective sample size is: neff=109210,009=11,88110,009≈1.187. This weighted average of 109 reports has barely more precision than a single independent observation! The single loud echo dominates the estimator. Count each original trial once, however, and all ten independent observations are still there to recover.
How many independent trials is this mean worth?

Make one trial loud. Watch the average wobble.

Six original trials each return a fair +1 or −1 signal. Their reports can repeat. Tap a stack to add an appearance, or drag A's point along the graph. Before copying A, predict whether the true variance of the report-weighted average will rise or fall.

Do distinct trials share a common cause?

ρ is the correlation between every pair of distinct original signals. This is a chosen common-cause model; different identities alone do not establish independence.

Report-weighted mean: actual varianceEach original onceTreat every report as independent
Variance of the mean0.000.250.500.751.00Copies of original A; drag sideways: drag or use arrow keys15101520Reports of A · drag sideways
The same 6 reports, three readings of their precision
How the mean is readVarianceEffective trials
Weight by appearances0.16676.00
Count each original once0.16676.00
Assume all reports independent0.16676.00
6 appearances, 6 identities, 6.00 effective trials for the report-weighted mean. With independent originals, equal copying preserves six effective trials. Uneven copying lets a loud original dominate this estimator.
wi=ci∑jcj,V=ρ+(1−ρ)∑iwi2,neff=1V

c counts appearances; w is the resulting weight. V is the sampling variance of the mean of fair ±1 signals, whose individual variance is one. Multiplicities are fixed independently of their outcomes. At ρ = 0 this is Kish's formula. Effective size matches one estimator's variance; it does not specify a full likelihood or Beta posterior.

Epistemic attention: Why neural networks confuse focus with certainty

This distinction between volume and diversity is central to modern artificial intelligence.

In Transformer neural networks, the attention mechanism distributes focus across input tokens using the softmax function:

ai=eℓi∑j=1Meℓj,

where ℓi is the query-key compatibility logit for item i, and ai∈(0,1) is its normalized attention weight (∑ai=1).

If item 1 receives 95% of the attention weight (a1=0.95), we know where the model is looking.

However, does the model know how much independent evidence justifies that focus?

Softmax is completely blind to this question.

Notice that softmax is invariant under constant additions: if you add an arbitrary constant C to every logit (ℓi→ℓi+C), the attention weights ai remain identical:

eℓi+C∑jeℓj+C=eCeℓieC∑jeℓj=ai.

The normalized attention weights alone do not identify the difference between:

  • Focusing on a document because ten independent sources confirm it.
  • Focusing on a document because a single source was duplicated ten times in the prompt.

Both scenarios can produce the same attention weights. Softmax discards a common logit offset; source independence must come from lineage information, which a Transformer can also represent in its context.

Epistemic mass in attention heads: Distinguishing alignment from conflict

To equip attention with epistemic awareness, we can associate each item i with a directional unit vector ni in evidence space, along with a total concentration weight τ.

The net directional alignment vector is the attention-weighted average:

vattn=∑i=1Maini.

Now calculate the epistemic rest mass of the attention head:

m2=τ2(1−‖vattn‖2).

Look at what this mass reveals about the internal state of the model:

  1. Unanimous alignment: If all attended items point in the same direction (ni=u for all i): vattn=∑aiu=u⟹‖vattn‖=1. The rest mass vanishes: m=0. The attention head experiences zero internal conflict.
  2. Balanced conflict: Suppose the model attends equally (a1=a2=0.5) to two items with diametrically opposed claims (n1=+1,n2=−1): vattn=(0.5)(+1)+(0.5)(−1)=0⟹‖vattn‖=0. The rest mass reaches its theoretical maximum: m=τ.

In both cases, the softmax weights might be identical. But in the first case, the mass is zero (unanimous agreement), while in the second case, the mass is τ (deep contradiction).

By monitoring m, an AI system can distinguish between serene consensus and paralyzing disagreement.

Let us build a concrete design: an attention head with an evidence notebook attached. Give it three explicit outputs:

  1. What it favors (the directional focus vector vattn).
  2. How much backing supports that tendency (the accumulated total concentration τ).
  3. Which original trials supplied the backing (the lineage set L).

Then show it two collections of documents: first, a single medical experiment paraphrased twenty different ways across twenty blogs; second, twenty independent clinical trials conducted at twenty hospitals. Attention weights describe the focus; our attached lineage ledger makes the backing explicit. With the source lineage supplied, the first prompt collapses to a single trial (neff=1), while in the second, twenty equally weighted, independent tracelets accumulate (neff=20).

Imagine an intelligent search engine that can report: “These twelve articles agree because they all quote the same Reuters dispatch,” or “These three clinical trials disagree because their patient cohorts used different dosages,” with a distinct geometric state (v,τ,m) for each.

The same reports, two pooling rules

Give attention a source map.

Three original trials point in different directions. Trial A arrives in six reports. An appearance-first attention head scores every report; a source-first head scores each original once. Choose a source and drag the outer ring to turn its direction, or copy a report and watch the two answers separate.

Reports6
Score ℓ0
Reports1
Score ℓ0
Reports1
Score ℓ0

A score ℓ is a compatibility number: softmax gives a score's exponential a share of the total. All copies of one source keep its score and direction.

+1−1Turn source A direction: drag or use arrow keysDrag the ring to aim AOne disk, two normalized answers
Appearance-first focusSource-first focus

The circle is the maximum resultant length, one. The dot and square share these axes. Angles turn counterclockwise from right; focus the outer handle for arrow-key control.

How much focus reaches each source?

Shares of the same normalized attention budget
SourceAppearance-firstSource-first
A75.0%33.3%
B12.5%33.3%
C12.5%33.3%
The resulting geometry, with normalized total one
QuantityAppearance-firstSource-first
Length ‖v‖0.6250.000
Cone ratio m/τ0.7811.000
8 reportscarry3 original trial identities
Common score offset: 0

Try shifting every score together. Both focus distributions stay put: normalization removes a common offset.

The source-first head gives A 33.3% of its focus, whether A has one report or 6. Copying a source can change appearance-first focus while the ledger still holds three original trial identities.
Appearance-firstwi=cieℓi∑jcjeℓj
Source-firstai=eℓi∑jeℓj

c is a report count. Each focus vector v is the weighted mean of unit directions, and m/τ = √(1 − ‖v‖²). The source-first rule is an explicit design choice for known identities; dependence between different sources needs more information. These normalized head geometries keep their trial ledger separately.

The stopped clock: Gettier problems and causal lineages

In classical epistemology, philosophers defined knowledge as justified true belief.

In 1963, Edmund Gettier shattered this definition with a famous counterexample: the stopped clock.

Suppose you glance at an antique grandfather clock that stopped exactly twelve hours ago. It reads 3:00 PM. By pure coincidence, you happen to look at it at precisely 3:00 PM.

Your belief that “the time is 3:00 PM” is true. You are also justified in believing it, because the clock has been reliable for years. Yet you do not possess knowledge: you were merely lucky.

What went wrong?

The causal lineage connecting the state of the world (the position of the sun) to your mental state was severed. The clock’s display was not caused by the current time; it was an artifact of a past failure.

Lineage solves Gettier’s paradox naturally.

A belief is not merely a probability distribution over states: it is a directed acyclic graph (DAG) connecting sensory tracelets to inferential conclusions. If an edge in that causal graph is broken or uncalibrated, the belief loses its epistemic warrant, regardless of whether its numerical value happens to be accurate.

Now imagine justification as something that travels physically with evidence. A laboratory result carries the precise experimental conditions under which it was produced. Transporting that result to another temperature, another biological species, or a different diagnostic instrument becomes an explicit geometric transformation whose assumptions can be audited. A claim is accompanied by a small map of where its supporting history remains valid.

That could make a scientific library feel like a navigable landscape. We would search for hypotheses, then trace the physical paths connecting them to primary observations. Two answers with the same mode might occupy radically different positions on that map.

The geometry of lineage: Tracing tracelets through networks

Every observation that enters a learning system is an interaction: a physical tracelet exchanged between an instrument and the world.

When we preserve the lineage of those tracelets:

  • Idempotent set operations prevent echo chambers from manufacturing extra trials.
  • Prior subtraction ensures that combining scientific studies does not multiply initial assumptions.
  • Kish’s effective sample size quantifies the severe information loss caused by viral echoes.
  • Lineage-aware attention heads distinguish between broad focus and deep conflict.
  • Causal DAGs protect autonomous systems against Gettier-style accidental truths.

This provides fertile ground for distributed evidence networks. By tracking which quantities were observed together, their shared trials, and the transformations between measurement domains, autonomous agents can identify where a single global model fits and where the local pieces demand richer structure.

A trial can travel, split into reports, and return along a hundred paths. Its lineage remembers the event beneath those appearances. Causal structure in a learning universe begins with this discipline: follow what interacted with what, preserve the joint stories, and let every new encounter add something the echoes could never supply.

In our next excursion, we will discover how to detect hidden dimensions in The best sensor is looking sideways, exploring how orthogonal measurement channels unmask correlated noise.