Andrea Pelosi
MSc
Roles
- PreDoc Researcher
Publications (created while at TU Wien)
-
2026
-
Bridging Bitcoin to Second Layers via BitVM2
Woll, R. L., Aumayr, L., Avarikioti, Z., Maffei, M., Pelosi, A., Thyfronitis Litos, O. S., Stefo, C., Tse, D., & Zamyatin, A. (2026). Bridging Bitcoin to Second Layers via BitVM2. In Proceedings of the 35th USENIX Security Symposium (pp. 969–988).
DOI: 10.34726/12785 MetadataAbstract
A holy grail in blockchain infrastructure is a trustless bridge between Bitcoin and its second layers or other chains. We make progress toward this vision by introducing the first light-client-based Bitcoin bridge. At its heart lies BITVM2-CORE, a novel paradigm that enables arbitrary program execution on Bitcoin, combining Turing-complete expressiveness with the security of Bitcoin consensus. BITVM2-BRIDGE advances prior approaches by reducing the trust assumption from an honest majority (t-of-n) to existential honesty (1-of-n) during setup. Liveness is guaranteed with only one rational operator, and any user can act as a challenger, enabling permissionless verification. A production-level implementation of BITVM2 has been developed, and a full challenge verification has been executed on the Bitcoin mainnet. -
BitVM: Quasi-Turing Complete Computation on Bitcoin
Aumayr, L., Avarikioti, Z., Woll, R. L., Maffei, M., Pelosi, A., Stefo, C., & Zamyatin, A. (2026). BitVM: Quasi-Turing Complete Computation on Bitcoin. In A. Kiayias & M. Kyropoulou (Eds.), 8th Conference on Advances in Financial Technologies (AFT 2026). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
DOI: 10.4230/LIPIcs.AFT.2026.1 MetadataAbstract
A long-standing question in the blockchain community is which class of computations is efficiently expressible in cryptocurrencies with limited scripting languages, such as Bitcoin Script. Such languages expose a reduced trusted computing base, thereby being less prone to hacks and vulnerabilities, but have long been believed to support only limited classes of payments. In this work, we confute this long-standing belief by showing for the first time that arbitrary computations can be encoded in today’s Bitcoin Script without introducing any language modification or additional security assumptions, such as trusted hardware, trusted parties, or committees with an honest majority. We present BitVM, a two-party protocol that realizes a generic virtual machine by combining cryptographic primitives and economic incentives. We conduct a formal analysis of BitVM, characterizing its functionality, system assumptions, and security properties. We further demonstrate the practicality of our approach by implementing a prototype and performing an experimental evaluation: in the optimistic case (i.e., when parties agree), our protocol requires just three on-chain transactions, whereas in the pessimistic case, the number of transactions grows logarithmically with the size of the virtual machine. We exemplify the deployment potential of BitVM by building a Bitcoin-sidechain bridge application. This work not only solves a long-standing theoretical problem, but it also promises a strong practical impact, enabling the development of complex applications in Bitcoin.