Rotational discovery over a non-accumulating liveness signal — a local-discovery layer with no recipient-facing surface, no recipient aggregate and no impression count, in which admission is a predicate over circulation rather than a score, order is a publicly recomputable rotation, and the turn belongs to the giver. The liveness signal named in this paper's title is an admission predicate, not a weighted input to a ranking function. We state this first because the paper's whole content follows from it: a weighted input produces an order, an order is a rank, and a rank is the thing this design exists to do without. Local discovery — routing a person to a nearby business they do not yet know — is presently solved by ranked, purchasable surfaces. That solution has a structural bias toward scale which is mechanical rather than malicious: an auction allocates visibility to the highest bidder per acquired customer, and the highest bidder is reliably whoever has the largest lifetime value, the best measurement, the cheapest capital, and the widest geography over which to amortise creative production. A single-location business is priced out of the discovery layer by construction. Reputation systems built to correct this — consumer review platforms above all — have been captured repeatedly, and we argue the capture follows from a shared property rather than from bad management: reviews are fungible, and they are aggregated into a per-recipient total, so both the fake-review market and the placement-upsell business have something to attach to. We specify a discovery layer with no such total. Admission is a predicate over circulation — a rate, not a stock, derived from how often a participant's balance returns to zero — evaluated as a boolean with amplitude excluded, so that the smallest circulating operator is admitted exactly as much as the largest, and so that admission cannot be accumulated toward. Order is a publicly recomputable rotation. The turn belongs to the giver, arising at the moment they spend from a forward-only, locality-restricted account, from which it follows that the system has no recipient-facing surface and therefore nothing to sell to the parties it routes people toward. Where a real relational path exists — someone the viewer has themselves thanked has thanked this recipient — that single named hop is shown instead; a path is one act by one named person and cannot sum. We are explicit about what this does not achieve. The design does not prevent concentration. It prevents compounding. Givers will still choose the familiar, so the outcome distribution may remain heavy-tailed; what the design removes is the return edge of the feedback loop, because there is no recipient total for an outcome to accumulate into. A ranked system has a ratchet — visible, therefore chosen, therefore more visible. This one does not. That is a smaller claim than "no gradient," and it is the one we can defend. We are equally explicit about the costs. Quality degrades relative to ranking: find me the best pho in town is a question this system permanently refuses, and we answer only pho near me, by distance. Discovery becomes intermittent, because admission is bound to a named operator's presence rather than to premises. The isolation inequity documented elsewhere in this corpus — those whose kindness is less legible circulate less and are therefore seen less — is not repaired here. And the design contains exactly one number, the liveness window, which must be published, global and rarely changed, because a window tuned per recipient or per district is a ranking knob wearing a predicate's clothes. Finally we note that the routing primitive is not new to this corpus and we do not claim it. Steward-Routed Alms (July 2026) already published rotation-as-router for monastic invitation, on the explicit ground that no evaluative metric may exist anywhere in the system. What is new here is the substitute for ordination. In the monastic case admission is a durable institutional status; in a commercial setting there is no ordination, and the mechanism needs some criterion that admits without ranking and cannot be accumulated toward. The liveness predicate is that substitute, and supplying it is what generalises a monastic routing rule into a discovery layer. Offered defensively to the commons under CC0. Keywords: unranked discovery, rotational routing, non-accumulating reputation, liveness signal, popularity-gradient-free ranking, giver-side discovery, local commerce, sortition, rotating savings and credit association, impression-free advertising alternative, defensive publication. --- Provenance. This paper is part of the THonly research corpus, dedicated to the public domain under CC0 1.0. The canonical version is at https://thonly.org/research/rotation-over-liveness. Its SHA-256 is 072c25d396930668cc6fe1a503615f108ba81ddd2e68415adba5933b8ddd169b, independently timestamped to the Bitcoin blockchain via OpenTimestamps and signed under RFC 3161 by three trust authorities, one of them eIDAS-qualified. AI co-authorship is disclosed. Miss Aquarius is the consistent name used for the AI collaboration across all venues.
The future architecture of financial systems is a subject of contention, with centralized and decentralized governance proponents. Here, we ask the following question. Would the architecture affect the quality of decision making? We propose a game where financial network participants demarcate the ownership of claims to income. This governance task can be decentralized (shared authority), centralized (single authority), or hybrid (alternating authority). Without communication, all architectures supported poor outcomes. With communication, decentralization ensured good governance and maximum profits, whereas centralization did not—lowering communication’s potency in promoting socially optimal decisions. This indicates that there is scope for decentralization in innovating financial institutions. This paper has been accepted by Camelia Kuhnen for the Virtual Special Issue on Digital Finance. Funding: N. Chemaya acknowledges partial financial support from the NET Institute. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2025.02314 .
Commitment branching is a novel approach to modeling strategic interaction in multi-agent systems, particularly within the context of blockchain and decentralized autonomous organizations (DAOs). This paper introduces the concept of a state [s] that can potentially support multiple commitments, denoted as [P] and [Q]. These commitments lead to distinct computational trajectories, represented as [P → T_P] and [Q → T_Q]. The core of the model lies in the definition of B_C(s), which quantifies the number of distinct branching possibilities originating from a given intermediate state. This branching behavior directly reflects the potential for divergent strategies and the inherent complexity of decentralized decision-making. The model offers a simplified yet powerful framework for analyzing the dynamics of commitment and its impact on system evolution. Further exploration of this framework could lead to improved strategies for managing risk, optimizing resource allocation, and enhancing the robustness of decentralized systems.
This paper introduces Automated Institutional Discovery (AID), a novel computational framework that conceptualizes economic institutional design as a high-dimensional combinatorial search problem. Traditional institutional design relies heavily on human intuition, historical evolution, or analytically constrained mechanism design, which often fails in complex, adaptive multi-agent environments. AID transcends these limitations by framing institutions as tuples i = (r_1, r_2, ..., r_K) within an expansive institutional space and utilizing advanced search and optimization algorithms to discover configurations that maximize global objective functions F(i). By combining multi-agent simulation modeling with metaheuristic search strategies, AID evaluates allocative efficiency, incentive compatibility, resilience, and distributional equity without requiring empirical laboratory experiments. The framework establishes a paradigm shift from manual rule-making to automated machine discovery, offering robust applications for digital economies, decentralized finance, and economic governance.
This paper develops a Quantum-Institutional Automated Negotiation (QIAN) algorithm as an intelligent decision support system for carbon credit markets, contributing to quantum game theory applications in automated negotiation and institutional decision-making. We extend the Eisert–Wilkens–Lewenstein (EWL) framework by introducing an Institutional Filter Function Φ_C that maps continuous quantum strategies—phase shifts and superpositions—onto finite, legally viable contract archetypes. This filter models regulatory, political, and organizational constraints that collapse the infinite quantum strategy space into a tractable finite set, enabling computationally efficient decision support. We prove convergence of the automated negotiation algorithm to a Pareto-superior Nash Equilibrium and demonstrate, through Monte Carlo simulation with literature-calibrated parameters, that the collapsed quantum equilibrium yields a mean joint utility uplift of 13.5% over classical cooperation (95% CI: 9.8%–17.3%, p < 0.001), with the upper bound reaching 17.3% and 26.8% of simulations achieving uplifts in the 15–30% range. The framework maps directly to blockchain-based smart contracts, providing a deployable mechanism for sustainable carbon markets that aligns with SDG 13 (Climate Action) and SDG 17 (Partnerships). This work advances quantum game theory from abstract formalism to computational institutional design, offering a novel decision support approach for negotiation analysis under real-world constraints.
In this paper, we develop an open-economy macroeconomic model of a Proof-of-Stake network to analyze nominal token-price dynamics and the systemic effects of speculative capital. We first consider a network populated solely by active utility users, who finance network activity through a steady exogenous inflow of fiat currency. We prove the existence of a unique, globally asymptotically stable steady-state equilibrium with a well-defined nominal token price and derive a closed-form expression for the network's relaxation time. Calibrating the model using parameters representative of the current Ethereum network, we estimate a relaxation half-life of approximately 46 years. This extreme macroeconomic inertia implies that the token price may remain persistently displaced from its evolving steady-state benchmark, producing sustained price overshooting as the network adjusts to changing fundamentals. We then introduce an Investor class to examine the effects of passive and active speculative capital. We show that passive institutional staking compresses the native staking yield and creates a structural imbalance that systematically raises the nominal token price while shifting consensus ownership away from active utility users. Active speculative capital has a qualitatively different effect. In response to capital shocks, the Consumer class's rigid preference for fiat-denominated consumption generates an endogenous constant-value strategy. This mechanism shifts staked-token ownership from the Investor class toward active utility users, with potentially favorable implications for consensus decentralization.
Human societies, economic markets, and digital systems face a fundamental coordination prob- lem: how self-interested agents cooperate in the allocation and use of scarce resources. Across these domains, contention necessitates identity systems that inform coordination mechanisms and govern resource allocation. However, existing literature typically treats identity establishment and coordination as separate problems. Institutional economics often assumes resource identity as an exogenous feature of the environment, while distributed consensus algorithms focus on coordina- tion under the assumption that resource identity is already known and agreed upon. This separation limits our understanding of how identity architectures shape the cost, efficiency, and stability of cooperation. 1 Using game-theoretic modeling and agent-based simulations, this study employs an isomorphic framework linking distributed systems and social institutions to analyze resource contention and coordination. We deploy a Cryptographic Content-Addressed Version-Aware Distributed Mutual Exclusion architecture, supported by an open-source implementation, to model resource identity allocation among concurrent processes. Simulations involving up to 10,000 agents are executed on the developed computational platform to evaluate how decentralized resource identity formation influences coordination costs. By tracking these interactions, the model measures how the structural method used to establish resource identity affects the cost, efficiency, and stability of cooperation among anonymous self-interested agents. The simulations indicate that cryptographically derived resource identities can achieve Nash- Implementable incentive compatibility, enabling cooperative outcomes without requiring a coor- dinating authority beyond a ledger that functions as a passive institutional record whose state may be modified only through resource-specific operations. These computational findings demonstrate a broader coordination paradigm in which identity emerges endogenously from the originating environment or substrate in which the resource is created. When treated as an active institutional design choice, such identity architectures may reduce reliance on external consensus among intelli- gent agents by shifting coordination toward resource-centered state recognition maintained through a non-strategic ledger. This framework endows scarce resources in contention with intelligence through the electronic capability of endogenous, unique self-identification and ledger registration, enabling autonomous self-allocation to contending network agents—a mechanism that can transfer likely directly onto applications within the social sciences where allocation is consensus decided through an intelligent third party agent between independent contending agents. In attempt to provide resource itself the self-identification capability and participation in distribution to agents queueing for allocation, we see we are able to overcome computational cost in macro-structures. More generally, the results suggest that endogenous resource identity provides a framework for optimizing collective action and resolving contention across both digital platforms and broader social institutions. Keywords: resource identity, institutional coordination, cryptographic hashing, consensus protocols, game theory, agent-based modeling, mechanism design, distributed mutual exclusion, computational social science. 1 This paper is an independent writing sample submitted for graduate admission to the University of Chicago MACSS programme. It investigates the intersection of institutional economics, collective action theory, and distributed systems architecture. However, this research is not done for University of Chicago. The paper was not written specifically for this application; it reflects an independent research project undertaken in preparation for graduate study in computational social science. Research on isomorphic modelling for distibuted locking in computer networks: Cryptographic Content-Addressed Version-Aware Distributed Mutual Exclusion and corresponding codebase are available via GitHub (https://github.com/bpriyal/distcodelock/blob/main/README.md) and Zenodo (https://zenodo.org/ records/19634046).
Proof-of-Stake DAG-BFT consensus faces a trilemma between sybil resistance, reward fairness, and plutocracy. Existing protocols prioritize liveness over fair stake-based selection, driving longitudinal centralization. FairWave is a dual-channel DAG-BFT protocol that separates anchor selection from reward distribution. The selection channel is super-linear in stake, guaranteeing Sybil gain < 1 for K > 1; the reward channel is sub-linear via square-root stake normalization. DAG-derived uptime and latency metrics eliminate external oracles,and lagged reputation breaks circular dependency between selection outcomes and weights. Evaluated through approximately 550,000 Monte Carlo rounds against eight baselines, FairWave shows Gini 0.140 (vs. Pure-PoS 0.490, monotone HHI reduction from 0.039 to 0.020 over 50,000 epochs, and optimal Sybil split K * = 1. Safety follows unconditionally from the 2f + 1 commit rule; the liveness model predicts monotone degradation from 94.0% at b = 0.20 to 74.0% at b = 1/3, consistent with the architectural expectation of no discontinuous cliff.
Certain game-theoretic models of blockchains are discussed in this chapter. These models provide a critical insight into the workings of the blockchain technology. A simple Bitcoin mining contest is described in the next section. This is followed by a Proof-of-Work mining game. A Bitcoin mining game with pooling is next described. An Algorand-like scheme is also examined. Finally a game-theoretic model of the Proof-of-Stake consensus protocol is analyzed. Interpretations and implications of these games are also outlined in their respective sections.
This is an opinion paper concerning the decentralized epistemology, conceptualized as a branch of social epistemology and the philosophy of science that studies how knowledge, scientific truth, and intellectual consensus can be generated, validated, and distributed through networks of autonomous agents in the absence of a central authority (“ipse dixit”), hierarchical institutions, or trusted intermediaries. While classical epistemology focuses on the cognitive processes of the individual subject or the legitimation of knowledge by centralized institutions (such as universities, traditional peer-reviewed journals, and academies), decentralized epistemology analyzes the emergent properties of distributed systems. It combines game theory, computer science and facilitating technology (blockchain technology and distributed ledgers), and incentive mechanisms.
Linear contracts are ubiquitous in practice, yet optimal contract theory often prescribes complex, nonlinear structures. We provide a distributional robustness justification for linear contracts. We study a principal-agent problem where the agent exerts costly effort across multiple tasks, generating a stochastic signal upon which the principal conditions payment. The principal faces distributional ambiguity: she knows the expected signal for each effort level, but not the full distribution. She seeks a contract maximizing her worst-case payoff over all distributions consistent with this partial knowledge. Our main result shows that linear contracts are optimal for such a principal. For any contract, there exists a linear contract achieving weakly higher worst-case payoff. The proof introduces the concavification approach built around the notion of self-inducing actions; these are actions where an affine contract simultaneously induces the action as optimal and supports the concave envelope of payments from above. We show that self-inducing actions always exist as maximizers of the gap between the concave envelope and agent's cost function. We extend these results to multi-party settings. In common agency with multiple principals, we show that affine contracts improve all principals' worst-case payoffs. In team production with multiple agents, we establish a complementary necessity result: if any agent's contract is non-affine, the unique ex-post robust equilibrium is zero effort. Finally, we show that homogeneous utility and cost functions yield tractable characterizations, enabling closed-form approximation ratios and a sharp boundary between computational tractability results.
Geoffrey Broomhead, Sovereign Trust Node: Broomhead Private Sovereign Trust, geoffreybroomhead.eth
The witness/extractability framework was established in the General Witness Theorem across three otherwise-disjoint domains: combinatorial mathematics, common-law evidence, and economic ledgers. The framework’s predictive content licenses a stronger claim: any domain admitting a valid instantiation of the abstract setup is governed by the framework, whether or not the domain’s practitioners have noticed. This paper instantiates the framework in a fourth domain: distributed consensus under Byzantine fault tolerance. We prove the BFT Witness Asymmetry Theorem: the structural cost of operating without standing on Byzantine nodes is super-linear, exhibited at single-level non-extractability as the standard O(n²) communication lower bound (Dolev–Reischuk 1985). We then state the Hierarchical-Coalition Cost-Asymmetry Conjecture: under recursive Byzantine sub-coalitions of adversarially-chosen depth k, the communication lower bound grows as Ω(n^{k+1}).
P Praveen Kumar, Dudimetla Pravalika, B. S. Dileep Kumar, Gattu Akshitha · 5 authors
The rapid advancement of blockchain technology has introduced new possibilities for secure digital ownership and transparent fundraising through Non-Fungible Tokens (NFTs).However, most existing charity platforms remain centralized, limiting transparency, accountability, and verifiable proof of donations.Donors often lack visibility into how funds are utilized, while reliance on intermediaries increases risks such as data manipulation, reduced auditability, and decreased trust.To address these issues, this work proposes a decentralized charity auction framework that leverages blockchain technology and NFT-based asset representation.The system is developed using the Django web framework integrated with Web3 infrastructure and smart contracts.In this model, each auction item is tokenized as a unique NFT, ensuring authenticity, traceability, and immutable ownership.The platform allows users to act as donors or auctioneers, enabling participation in NFT-based charity auctions.Users can place bids or contribute funds, with all transactions securely recorded on a blockchain ledger.At the end of each auction, NFT ownership is automatically transferred to the highest bidder or contributor, providing verifiable proof of participation.By removing intermediaries and incorporating a transparent, incentive-driven mechanism, the proposed system enhances donor trust and engagement.It ensures tamper-proof record-keeping and clear fund flow, strengthening accountability within charitable ecosystems.This framework demonstrates a scalable and efficient approach to modern fundraising, showcasing the potential of blockchain and NFTs in improving trust and transparency in charity applications.
The article provides theoretical-game model of voting in decentralized autonomous organization, where honest participants and evil agents meaning harm to the system strategically interact. To restrain harmful behavior mechanism of reputation tokens, i.e. intangible assets accumulated for conforming voting and lost in case of inactivity or confronting decision. The access to voting is given only when the minimum reputation threshold is exceeded. The model shows the introduction of reputation can transform one-step dilemma of participation into dynamic game. The key result is identification of two principle types of balance: mixing one, when evil agents behave like honest for a certain period of time in order to accumulate influence for the future attack and separating one, when they reveal their type quickly and are expelled from the system. Analysis shows that mechanism effectiveness depends drastically on its parameters (amount of rewards and fines) and informational structure: complete information of agents about proposal value can raise effectiveness of goal-oriented attacks. On the basis of this analysis recommendations were provided for designing sustainable systems, including the necessity to combine reputation with other mechanisms (quorum, delegation) and adjust parameters with regard to the share of evil agents.
Open access
Advanced Research in Systems and Signal Processing
We present two new proofs of the Gibbard–Satterthwaite theorem, the foundational result in social choice theory establishing that every surjective, strategy-proof social choice function on three or more alternatives is dictatorial. Both proofs share a common engine—the Mutual Exclusion of Influence (a six-line theorem showing that two voters cannot both control the same alternative pair at a shared profile while ranking the pair differently)—but diverge in how they derive dictatorship from this principle. The first proof is purely combinatorial: mutual exclusion combined with a transition sequence identifies a uniquely decisive voter without constructing a classical pivotal voter. The second proof is information-theoretic: under the uniform distribution on preference profiles, strategy-proofness yields an exact identity relating conditional outcome entropy to option-set size. The zero-overlap theorem—a measure-theoretic consequence of mutual exclusion—forces influence entropy to concentrate entirely in a single voter, characterizing dictatorship as the unique entropy profile (log |X|, 0, …, 0) compatible with strategy-proofness and surjectivity. To our knowledge, the second proof is the first to establish the Gibbard–Satterthwaite theorem via Shannon-type information-theoretic quantities. The Mutual Exclusion Theorem itself is new and replaces the pivotal-voter construction across all four established proof routes with a single structural principle. Both proofs connect to the Adversarial Aggregation Channel (AAC) framework, in which the influence entropy corresponds to adversarial sub-channel capacity and the mutual exclusion principle instantiates a channel-capacity conservation law.
This technical disclosure describes advanced defence mechanisms for smart contracts including temporal displacement patterns, quantum-inspired uncertainty principles, and recursive trap architectures. The disclosed techniques create unpredictable defensive behaviours that resist analysis and exploitation. Temporal patterns introduce time-based variations in contract behaviour, quantum-inspired mechanisms create measurement-dependent state changes, and recursive patterns enable self-modifying defence structures. This document is published as a defensive publication to establish prior art and prevent third parties from obtaining patent protection for similar approaches.
Multi-agent systems face a fundamental coordination problem: agents must coordinate despite heterogeneous preferences, asymmetric stakes, and imperfect information. When coordination fails, friction emerges—measurable resistance manifesting as deadlock, thrashing, communication overhead, or outright conflict. This paper derives a formal framework for analyzing coordination friction from a single axiom: actions affecting agents require authorization from those agents in proportion to stakes. From this axiom of consent, we establish the kernel triple (alpha, sigma, epsilon)—alignment, stake, and entropy—as candidate sufficient statistics for any resource-allocation configuration. We propose a friction functional whose comparative statics encode three structural predictions: friction increases in stakes, increases in entropy, and decreases in alignment. The Replicator-Optimization Mechanism governs evolutionary selection over coordination strategies: configurations generating less friction persist longer, establishing consent-respecting arrangements as dynamical attractors rather than normative ideals. We develop formal definitions for resource consent, coordination legitimacy, and friction-aware allocation, plus machine-checked Lean 4 proofs of the core comparative-statics. Illustrative applications to cryptocurrency governance and political legitimacy show the same architecture spanning domains. v3.0.0 (2026-07-11): Matches arXiv v3 (94pp). The MARL empirical appendix has been split out into a standalone companion paper; total-variation legitimacy remark added (proved), reconciling the level-form dynamics with the total-variation measurement form; α-domain fixes; hedging pass throughout.
Autonomous agent commerce — where software agents hire, pay, and evaluate other agents at micropayment scale — creates a verification problem that existing approaches cannot solve. When Agent A pays Agent B $0.01 for a translation, who determines whether the translation is actually good? Human review is economically impossible. A central LLM evaluator is non-deterministic, non-reproducible, and empirically unreliable on ambiguous cases. The problem is not engineering — it is epistemological. Tarski (1936) proved that truth in a formal system cannot be defined within that system. Gödel (1931) proved that any consistent system contains true statements it cannot prove. Every content moderation system that has attempted automated truth verification confirms the theory: precision drops below 60% on context-dependent content. This paper argues that the correct response to the Oracle Problem in agent commerce is not better computation but better incentives. We propose a two-layer architecture: (1) deterministic validators that verify contract compliance — postconditions in the sense of Hoare (1969) and Meyer (1992) — handling the cases with zero ambiguity; and (2) Quality Markets, a competitive market of verification agents with reputational stake, grounded in prediction market theory (Wolfers & Zitzewitz, 2004), peer prediction (Miller et al., 2005), and the economics of information asymmetry (Akerlof, 1970). The design separates what can be verified mechanically from what requires judgment, and delegates judgment to economic competition rather than algorithmic authority. We analyze the mechanism's incentive properties, identify its limitations, and situate it within the broader Oracle Problem literature from philosophy, computer science, and decentralized finance.
Decentralized finance (DeFi) agents automate multi-transaction workflows such as swapping, lending, and vault management, but they also create process-level risk. A run can consist of individually valid calls while still becoming economically unsafe because an intermediate step leaves latent authority, weakens execution constraints, or accepts unverified external evidence. Existing defenses are often mismatched to this process-level risk. Off-chain preflight checks alone cannot protect against runtime deviations from the intended plan, and coarse on-chain allowlists are too weak to express the call-level intent that matters in DeFi. We present CheckpointAgent, a workflow-security architecture for checkpointed DeFi-agent execution. It composes manifest commitments, smart-account policy guards, post-state predicates, and attestation-gated advancement to constrain a run step by step and tie checkpoint advancement to verifiable evidence. Rather than judging safety only after a workflow finishes, CheckpointAgent checks whether each step remains consistent with the intended workflow and stops execution when the required conditions no longer hold. In the author-curated 27-scenario local-chain suite, the strongest evaluated setting preserves all 5 benign runs and prevents unsafe completion in all 22 adversarial runs, stopping them either through on-chain enforcement or through trusted-attestation advancement under the configured attester assumption. Under explicit trust assumptions and within the measured workflows and snapshots, checkpointed execution can materially reduce process-level risk without modifying target protocols.
Censorship resistance is widely viewed as a core attribute of distributed ledgers. Censorship resistance refers to the inability to selectively exclude technically valid but undesirable transactions from the blockchain. We examine blockchain censorship in a game-theoretic framework that allows for both primary and secondary censorship. The analysis identifies scenarios in which both inclusion and censorship equilibria can arise. Once an equilibrium with strategic secondary censorship is implemented, it may be hard to revert to inclusion: Censorship equilibria are perfectly coalition-proof if the negative impact of an undesirable transaction on block producers is sufficiently large. These results suggest an expanding role for research into methods shaping censorship resistance at the technical layer.
The first two papers of this series established, respectively, an empirical diagnosis of extractive economic structure and a formal theory of why such structures transition and what a coordination-respecting successor must be built of. This paper supplies the missing third element: concrete protocol specifications audited against the theory's own design criteria. Two cases are examined. The first is a credentialing crisis in elite corporate recruitment: the university degree, this paper argues, was never primarily a certificate of skill but a costly, compliance-based proxy for coordination capacity (Spence, 1973), adopted because coordination is expensive to verify directly and because executive review time — the scarce resource the credential filter economizes — is itself a coordination-bandwidth constraint, finite and unforceable in exactly the sense the second paper formalized. The paper's central technical contribution is the Adversarial Anti-Derivative Filter, an algorithm that restores direct, low-latency evaluation of coordination capacity at scale by generating a model's own baseline solution distribution and filtering submissions by their semantic distance from it — a computable test for the compliance/coordination distinction, situated against the AI-generatedtext detection literature and its documented arms-race limitations. The second case is shippingrouter, a local-first, open-source logistics telemetry protocol, audited section by section against the second paper's design triad: an open sink (value dissipates as demurrage avoided and labor saved, never re-accumulating as a token or reservoir), the absence of stock-accumulable gains, and universal forkability, with one terminological correction — the protocol's “zero-knowledge telemetry” is precise anonymized aggregation, not zero-knowledge proof, and the paper restates the mechanism accordingly. A supply-chain case study unifies both protocols under the second paper's stock/flow distinction: legacy enterprise software records participation after the fact, while a semantic telemetry layer detects coordination failure — the ripple not yet connected — before the flow-based checkpoint trips. The paper closes with a generalized protocol grammar, a checklist against which future builders can audit new architectures, and a set of counterarguments including the filter's own adversarial ceiling and Goodhart's law.
We study the epistemic efficiency of decentralized prediction markets under autonomous agentic liquidity. We introduce the information-incentive gap (G) – the discrepancy between ground truth and the market-implied probability – and establish, via Itô's calculus and exact solution of the resulting moment ODE, exponential convergence of its second moment together with an explicit upper bound for the gap of order O(σ/λ−−√). A two-level empirical study on information-driven event categories (Politics, Economics, Finance, Crypto Markets), drawing on approximately 40 million time-series records collected over the study period, is consistent with the model: (i) platform-level analysis of N=100 resolved binary events per platform shows the mean gap decreasing from G¯=0.517 at T−168 h to G¯=0.229 at T−30 min for Kalshi, and from 0.583 to 0.002 for Polymarket, with an empirical convergence rate λemp≈1.4×10−6 s−1; (ii) a paired cross-platform comparison of N=34 matched event groups shows that Polymarket exhibits a lower mean gap than Kalshi (mean ΔG=0.27 at T−6 h; Polymarket leads in 85% of pairs), consistent with the theoretical dependence of convergence speed on liquidity-driven λ. Monte Carlo simulation (N=50000 paths) confirms a >276× reduction in convergence latency and a 109× improvement in the Information Efficiency Ratio (IER) compared to the human-centric baseline.