PoISV v1.0 · 2026
Independent Research · Fatih Dinc

A Truth Layer
for the Internet.

Proof of Independent Semantic Validation — a peer-to-peer consensus mechanism for knowledge quality, not merely transaction order.

⛓ Bitcoin Block 945,622· 2026-04-18 DOI · 10.5281/zenodo.19642292
§ 01 · The Problem

Consensus orders transactions.
Nothing, so far, proves the content is true.

Motivation
01 / Hallucination

AI systems hallucinate because there is no decentralised truth verification.

Large models predict plausibility, not truth. Without an independent consensus on semantic correctness, confident falsehoods propagate at machine speed.

02 / Consensus

Existing consensus (PoW / PoS) orders transactions — not their semantic quality.

Nakamoto-style protocols answer which block is next? They are silent on is the claim inside it correct? Ordering ≠ validation.

03 / Connectivity

MCP and A2A connect systems. Nobody proves the content is true.

Agent-to-agent and model-context protocols transmit claims between machines. Transport is solved; validation of meaning remains open.

§ 02 · The Protocol

Three layers, stacked with intent.

Architecture
I · Foundation

Meta-Bell
Theory

Mathematical foundation

A measurement-theoretic generalisation of Bell's inequalities for semantic correlations between independent validators.

⟨A · B⟩ ≠ p(A) · p(B) ⇒ ∃ hidden truth
II · Standard

Proof of
WiseWork

Quality standard

Work is expended not to hash, but to demonstrate independent, coherent, high-confidence understanding of a claim.

W(B) = ΨB · Σ Scon(A)
III · Operative

PoISV

Operative protocol

The runtime: independent validators, semantic scoring, diversity weighting, Bitcoin-anchored finality.

Scon(A) = max(0, (cos θ − τ)/(1 − τ))
Meta-Bell →Proof of WiseWork →PoISV
§ 03 · Key Formulae

The mathematics, laid bare.

Definition 1–3
Def. 1Semantic Confidence Score
Scon(A) = max(0, cos(vAvκ) − τ 1 − τ )

Cosine alignment of a validator's embedding vA with the committee centroid κ, thresholded at τ and rescaled to [0, 1].

Def. 2Independence · Diversity Ψ
Ψ = 1 − Σi<j wiwj |ρ(eiej)| Σi<j wiwj

Weighted mean pairwise decorrelation between validator error signals. Ψ = 1 means fully independent; Ψ → 0 means collusion or shared bias.

Def. 3Block Quality Weight
W(B) = ΨB · ΣA ∈ B Scon(A)

The canonical weight of a block is the diversity of its validators multiplied by their summed confidence — quality, not hashpower.

§ 04 · Security Analysis

Attack-success upper bounds.

Probability P that a coalition controlling fraction q of validators forges a block under committee size k.

Theorem 4.2
Adversary fraction · q Committee · k P(attack success) Relative margin
0.10 32 < 10−12
0.20 32 < 10−8
0.30 64 < 10−7
0.40 64 < 10−4
0.49 128 < 10−3
// bounds derived under the independence assumption Ψ ≥ 0.8 ; see §4.2 of the whitepaper.
§ 05 · Archive

17 Documents · 3 Languages · 1 Bitcoin-Anchored Archive.

zenodo.19642292
Bitcoin-Anchored · OpenTimestamps

Every document in this archive is permanently anchored on the Bitcoin blockchain via OpenTimestamps.

Verify yourself → poisv.com/verification/

§ 06 · Implementation

Open source. Reproducible. MIT.

Repositories
fatdinhero/poisv
Reference

Reference implementation of the PoISV consensus mechanism — validator daemon, semantic scoring pipeline, and OpenTimestamps anchoring.

Python · 62.4% Rust · 31.8% Shell · 5.8%
github.com/fatdinhero poisv v0.9.2
fatdinhero/agentsprotocol
Protocol

A2A transport layer on top of PoISV — signed semantic claims between autonomous agents, with receipt-of-validation as first-class primitive.

Rust · 71.2% Python · 22.6% Shell · 6.2%
github.com/fatdinhero agentsprotocol v0.4.1