No Trade Under Verifiable Information

Spyros Galanis

arxiv: 2506.04944 · v1 · submitted 2025-06-05 · 💰 econ.TH

No Trade Under Verifiable Information

Spyros Galanis This is my paper

Pith reviewed 2026-05-19 11:23 UTC · model grok-4.3

classification 💰 econ.TH

keywords no trade theoremverifiable informationprivate informationinsider tradingmarket liquidityblockchain oracles

0 comments

The pith

When private information verifies a security's true value, agents cannot agree to trade.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

No trade theorems identify conditions under which agents with differing information fail to find mutually beneficial trades on a security whose payoff depends on some state of nature. This paper examines the specific case where agents' private information reveals or verifies the true state, so that beliefs align and rule out disagreement. Such verification prevents trade even if agents start from different priors or have bounded rationality. The result applies directly to insider trading, explanations for low market liquidity, and trading mechanisms that use public blockchains with oracles to verify outcomes.

Core claim

Conditions on private information that reveal or verify the true state of nature imply no trade, because agents' updated beliefs leave no room for mutually beneficial agreements on the security's value.

What carries the argument

Verifiable private information structure: a partition or signal system in which the true state becomes known to agents and is incorporated into their beliefs, eliminating disagreement on the security's payoff.

If this is right

Insider trading is impossible once information verifies the true payoff.
Low liquidity can arise directly from verifiable information structures without invoking other frictions.
Blockchain oracles that verify outcomes produce no-trade equilibria in security markets.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The result may extend to any market where settlement or payoff is publicly verifiable after the trade window.
It suggests testing whether markets with strong oracle-like verification show systematically lower volume than those without.
The mechanism could interact with common-knowledge assumptions in epistemic models of trade.

Load-bearing premise

Verification of the true state occurs and updates beliefs so that no mutually beneficial trade remains possible.

What would settle it

A documented case in which agents receive verifying private signals yet still complete a trade that both expect to profit from would falsify the claim.

read the original abstract

No trade theorems examine conditions under which agents cannot agree to disagree on the value of a security which pays according to some state of nature, thus preventing any mutual agreement to trade. A large literature has examined conditions which imply no trade, such as relaxing the common prior and common knowledge assumptions, as well as allowing for agents who are boundedly rational or ambiguity averse. We contribute to this literature by examining conditions on the private information of agents that reveals, or verifies, the true value of the security. We argue that these conditions can offer insights in three different settings: insider trading, the connection of low liquidity in markets with no trade, and trading using public blockchains and oracles.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Verifiable private information that reveals the true state prevents trade, but this looks like a modest extension of existing no-trade results rather than a sharp new mechanism.

read the letter

The main thing to know is that the paper derives no trade when agents receive private signals that verify the actual value of the security, then sketches applications to insider trading, market liquidity, and oracle-based blockchain trades. It stays inside the common-prior, common-knowledge setup and treats verification as the distinguishing modeling choice. That framing is clean and directly addresses the three settings mentioned in the abstract. The applications are the clearest part of the contribution; they give the abstract result a concrete hook without forcing big changes to the underlying information structure. The formal step of showing that verification rules out mutually beneficial trade appears straightforward once the information partitions are defined, which is a plus for readability. On the soft side, the result risks being incremental. Verifiable information often collapses into standard partition models or common-knowledge conditions already covered in the literature, so the proofs will need to demonstrate that the no-trade outcome does not simply restate earlier theorems under a relabeled signal. The abstract is silent on belief updating after verification and on whether the verification is costless or noisy, both of which could affect whether the no-trade conclusion is robust. The blockchain and liquidity examples are suggestive but thin on institutional detail, so they read more as illustrations than as fully worked-out cases. This is a paper for readers already working on information-based no-trade theorems or on microstructure questions in finance and crypto. A specialist looking for a targeted condition to plug into existing models would find it useful; a general reader will see mostly familiar territory. It is coherent on its own terms and shows honest engagement with the literature, so it deserves a serious referee who can check the exact information structure and tighten the applied sections.

Referee Report

2 major / 2 minor

Summary. The paper extends the no-trade theorem literature by introducing conditions under which agents' private information verifies the true state of nature for a security, implying that no mutually beneficial trade can occur. It distinguishes this from prior work on common priors, common knowledge, bounded rationality, and ambiguity aversion, and applies the idea to insider trading, explanations for low market liquidity, and trading on public blockchains with oracles.

Significance. If the formal model and equilibrium derivations hold, the result offers a clean, domain-specific extension of no-trade theorems focused on verifiable information structures rather than re-deriving existing quantities. The applications to blockchain oracles and insider trading provide falsifiable predictions about when trade should be absent, which is a strength. The manuscript credits the standard literature and avoids ad-hoc parameters or invented entities.

major comments (2)

§3 (Model): The definition of verifiable information must be shown to be strictly stronger than standard private information partitions; without an explicit comparison to the common-prior no-trade benchmark (e.g., Milgrom-Stokey), it is unclear whether the no-trade result follows solely from verification or requires an implicit common-knowledge assumption on the verification event itself.
Proposition 1: The proof sketch relies on agents updating to the true state upon verification, but the argument does not explicitly rule out trade when verification is private and not commonly known; a counter-example or additional lemma is needed to confirm this is not a gap.

minor comments (2)

The abstract and introduction could state the central proposition more precisely (e.g., 'under verifiable information, the only equilibrium is no trade') rather than describing it at a high level.
Notation for the information structure (e.g., the verification operator) should be defined once in §2 and used consistently; current usage mixes verbal descriptions with symbols.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments. These points help sharpen the distinction between verifiable information and standard no-trade results. We address each major comment below and commit to revisions that clarify the model and strengthen the proof of Proposition 1.

read point-by-point responses

Referee: §3 (Model): The definition of verifiable information must be shown to be strictly stronger than standard private information partitions; without an explicit comparison to the common-prior no-trade benchmark (e.g., Milgrom-Stokey), it is unclear whether the no-trade result follows solely from verification or requires an implicit common-knowledge assumption on the verification event itself.

Authors: We agree that an explicit comparison is needed to isolate the role of verification. In the revised manuscript we will insert a short subsection in §3 that formally compares our verifiable information structure to the standard private-information partitions of Milgrom and Stokey (1982). We will prove that verifiable information is strictly stronger: it not only partitions the state space but also ensures that, conditional on verification, the true state becomes commonly known, thereby eliminating disagreement in a manner that arbitrary partitions do not guarantee. This addition will demonstrate that the no-trade result follows directly from the verification property rather than from any hidden common-knowledge assumption. revision: yes
Referee: Proposition 1: The proof sketch relies on agents updating to the true state upon verification, but the argument does not explicitly rule out trade when verification is private and not commonly known; a counter-example or additional lemma is needed to confirm this is not a gap.

Authors: We acknowledge the potential gap. The current sketch assumes verification produces common knowledge of the state, but does not separately treat the case in which verification remains private. In the revision we will add a supporting lemma to the proof of Proposition 1. The lemma will show that, under the paper’s definition of verifiable information, even privately observed verification precludes mutually beneficial trade: any proposed trade would require the parties to assign different values to the security, yet verification forces both to assign the same (true) value. We will also briefly note why a counter-example with non-verifiable private signals does not apply to our setting. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper extends no-trade theorems by introducing conditions on agents' private information structures under which the true state is verified or revealed, thereby preventing mutually beneficial trade. This modeling choice is presented as a distinct contribution that applies to settings like insider trading and blockchain oracles, without any indicated reduction of the central result to fitted parameters, self-definitional equations, or load-bearing self-citations. The derivation chain relies on standard information-based assumptions from the literature, augmented by the new verifiable-information premise, making the result self-contained rather than tautological.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard information-economics background plus a new domain assumption about verifiable private information; no free parameters or invented entities are mentioned in the abstract.

axioms (1)

domain assumption Agents possess private information that can verify the true state of nature for the security.
This is the novel condition the paper examines to generate no-trade outcomes.

pith-pipeline@v0.9.0 · 5625 in / 1113 out tokens · 56744 ms · 2026-05-19T11:23:18.555342+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Security X is threshold verifiable at ω if, whenever X(C(ω)) is not constant, there exist i ∈ I and ω′, ω′′ ∈ C(ω) such that max X(ω0) < x < min X(ω0)
IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean absolute_floor_iff_bare_distinguishability unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1. Security X is threshold verifiable at ω if and only if there is no common knowledge trade at ω, for any set of priors.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.