SearcharxivSearch

arXiv subjects

Timm Mutzel

Publications and source records attributed to Timm Mutzel.

2 recordsLinked to original sources

Executable Arbitrage and Market Efficiency in Prediction Markets

Deterministic payoff identities imply no-arbitrage bounds in winner-takes-all prediction markets, but violations of these bounds need not be exploitable before settlement. We distinguish payoff-space no-arbitrage, which follows from terminal payoffs, from protocol-executable no-arbitrage, which depends on the position transformations available to traders. Polymarket's negative-risk markets make this distinction observable: linked binary markets represent mutually exclusive outcomes, while the NegRisk Adapter operationalizes only the NO-to-YES direction before settlement. We reconstruct depth-aware executable portfolio values and combine them with actor-level transaction histories and on-chain conversion traces to measure payoff-bound violations and exploitation. Our reconstruction estimates \$1.12 million in arbitrage profit across two realization channels: \$1.086 million from converter-enabled strategies and \$32 thousand from settlement-based basket formation. In the CLOB sample, positive violations concentrate on the unsupported YES side, whereas adapter-supported NO-side violations are substantially less frequent and shorter-lived. These patterns are consistent with the view that pre-settlement conversion strengthens enforcement by reducing capital lock-up and enabling inventory recycling. Finally, we implement a prototype bidirectional extension of the NegRisk Adapter that makes the reverse path executable before settlement. Together, our findings show that market efficiency depends not only on payoff structure, but also on whether protocols expose payoff equivalences as executable primitives.

cs.CE

Cross-Chain Sealed-Bid Auctions Using Confidential Compute Blockchains

Sealed-bid auctions ensure fair competition and efficient allocation but are often deployed on centralized infrastructure, enabling opaque manipulation. Public blockchains eliminate central control, yet their inherent transparency conflicts with the confidentiality required for sealed bidding. Prior attempts struggle to reconcile privacy, verifiability, and scalability without relying on trusted intermediaries, multi-round protocols, or expensive cryptography. We present a sealed-bid auction protocol that executes sensitive bidding logic on a Trusted Execution Environment (TEE)-backed confidential compute blockchain while retaining settlement and enforcement on a public chain. Bidders commit funds to enclave-generated escrow addresses, ensuring confidentiality and binding commitments. After the deadline, any party can trigger resolution: the confidential blockchain determines the winner through verifiable off-chain computation and issues signed settlement transactions for execution on the public chain. Our design provides security, privacy, and scalability without trusted third parties or protocol modifications. We implement it on SUAVE with Ethereum settlement, evaluate its scalability and trust assumptions, and demonstrate deployment with minimal integration on existing infrastructure

cs.CR