Lucianna Kiffer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lucianna Kiffer has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Lioba Heimbach
ETH Zurich
5 shared publications - Dennis Trautwein
University of Göttingen, Göttingen, Germany
4 shared publications - Yann Vonlanthen
Ethereum Foundation, Zurich, Switzerland
4 shared publications - Ari Juels
Cornell Tech, New York, NY, USA
3 shared publications - Giulia Fanti
Carnegie Mellon University, Pittsburgh, USA
3 shared publications - Oliver Gasser
IPinfo, Seattle, WA, USA
3 shared publications
Latest Publications
- Open Access
- 13 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 550-558
Actionable Signals in Prediction Markets: Evaluating Public and Private Information through Systematic Trading
- 13 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 550-558
Open AccessActionable Signals in Prediction Markets: Evaluating Public and Private Information through Systematic Trading
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 22-24
Multiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
We present the first longitudinal, cross-network measurement study of 36 public blockchain peer-to-peer (P2P) networks, spanning nine months from late 2024. We deployed 15 active crawlers with hourly connectivity probes, performed Internet-wide scans, and decomposed shared discovery substrates to identify 19 auxiliary networks. We find that active node counts span three orders of magnitude (10,000) and vary substantially in reachability, discovery coverage, and deployment structure. To characterize these differences, we quantify discovery effectiveness, churn dynamics, peer-table coverage, and AS- and geographic concentration (via the Herfindahl--Hirschman Index). Our results reveal pronounced heterogeneity in network structure and highlight fundamental observability limitations in widely deployed peer-discovery mechanisms. This extended abstract accompanies the full paper [10].
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 22-24
Open AccessMultiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
We present the first longitudinal, cross-network measurement study of 36 public blockchain peer-to-peer (P2P) networks, spanning nine months from late 2024. We deployed 15 active crawlers with hourly connectivity probes, performed Internet-wide scans, and decomposed shared discovery substrates to identify 19 auxiliary networks. We find that active node counts span three orders of magnitude (10,000) and vary substantially in reachability, discovery coverage, and deployment structure. To characterize these differences, we quantify discovery effectiveness, churn dynamics, peer-table coverage, and AS- and geographic concentration (via the Herfindahl--Hirschman Index). Our results reveal pronounced heterogeneity in network structure and highlight fundamental observability limitations in widely deployed peer-discovery mechanisms. This extended abstract accompanies the full paper [10].
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 22-24
Multiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
We present the first longitudinal, cross-network measurement study of 36 public blockchain peer-to-peer (P2P) networks, spanning nine months from late 2024. We deployed 15 active crawlers with hourly connectivity probes, performed Internet-wide scans, and decomposed shared discovery substrates to identify 19 auxiliary networks. We find that active node counts span three orders of magnitude (10,000) and vary substantially in reachability, discovery coverage, and deployment structure. To characterize these differences, we quantify discovery effectiveness, churn dynamics, peer-table coverage, and AS- and geographic concentration (via the Herfindahl--Hirschman Index). Our results reveal pronounced heterogeneity in network structure and highlight fundamental observability limitations in widely deployed peer-discovery mechanisms. This extended abstract accompanies the full paper [10].
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 22-24
Open AccessMultiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
We present the first longitudinal, cross-network measurement study of 36 public blockchain peer-to-peer (P2P) networks, spanning nine months from late 2024. We deployed 15 active crawlers with hourly connectivity probes, performed Internet-wide scans, and decomposed shared discovery substrates to identify 19 auxiliary networks. We find that active node counts span three orders of magnitude (10,000) and vary substantially in reachability, discovery coverage, and deployment structure. To characterize these differences, we quantify discovery effectiveness, churn dynamics, peer-table coverage, and AS- and geographic concentration (via the Herfindahl--Hirschman Index). Our results reveal pronounced heterogeneity in network structure and highlight fundamental observability limitations in widely deployed peer-discovery mechanisms. This extended abstract accompanies the full paper [10].
- 17 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Stability of peer-to-peer networks under greedy peering
- 17 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Stability of peer-to-peer networks under greedy peering
- Open Access
- 2 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 9 (3) , 1-32
Multiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
Blockchain technologies underpin an expanding ecosystem of decentralized applications, financial systems, and infrastructure. However, the fundamental networking layer that sustains these systems, the peer-to-peer (P2P) layer, of all but the top few ecosystems remains largely opaque. In this paper, we present the first longitudinal, cross-network measurement study of 36 public blockchain networks. Over 9 months (since late 2024), we deployed 15 active crawlers, sourced data from two additional community crawlers, and conducted hourly connectivity probes (e.g., pings and protocol-level handshakes) to observe the evolving state of these networks. Furthermore, by leveraging Ethereum's discovery protocols, we inferred metadata for an additional 19 auxiliary networks that utilize the Ethereum peer discovery protocol. We also explored Internet-wide scans, which only require probing each protocol's default ports with a simple, network-specific payload. This approach allows us to rapidly identify responsive peers across the entire address space without having to implement custom discovery and handshake logic for every blockchain. We validated this method on Bitcoin and similar networks with known ground truth, then applied it to Cardano, which we could not crawl directly. Our study uncovers dramatic variation in network size from under 10 to more than 10,000 active nodes. We quantify trends in IPv4 versus IPv6 usage, analyze autonomous systems and geographic concentration, and characterize churn, diurnal behavior, and the coverage and redundancy of discovery protocols. These findings expose critical differences in network resilience, decentralization, and observability. Beyond characterizing each network, our methodology demonstrates a general framework for measuring decentralized networks at scale. This opens the door for continued monitoring, benchmarking, and more transparent assessments of blockchain infrastructure across diverse ecosystems.
- 2 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 9 (3) , 1-32
Open AccessMultiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
Blockchain technologies underpin an expanding ecosystem of decentralized applications, financial systems, and infrastructure. However, the fundamental networking layer that sustains these systems, the peer-to-peer (P2P) layer, of all but the top few ecosystems remains largely opaque. In this paper, we present the first longitudinal, cross-network measurement study of 36 public blockchain networks. Over 9 months (since late 2024), we deployed 15 active crawlers, sourced data from two additional community crawlers, and conducted hourly connectivity probes (e.g., pings and protocol-level handshakes) to observe the evolving state of these networks. Furthermore, by leveraging Ethereum's discovery protocols, we inferred metadata for an additional 19 auxiliary networks that utilize the Ethereum peer discovery protocol. We also explored Internet-wide scans, which only require probing each protocol's default ports with a simple, network-specific payload. This approach allows us to rapidly identify responsive peers across the entire address space without having to implement custom discovery and handshake logic for every blockchain. We validated this method on Bitcoin and similar networks with known ground truth, then applied it to Cardano, which we could not crawl directly. Our study uncovers dramatic variation in network size from under 10 to more than 10,000 active nodes. We quantify trends in IPv4 versus IPv6 usage, analyze autonomous systems and geographic concentration, and characterize churn, diurnal behavior, and the coverage and redundancy of discovery protocols. These findings expose critical differences in network resilience, decentralization, and observability. Beyond characterizing each network, our methodology demonstrates a general framework for measuring decentralized networks at scale. This opens the door for continued monitoring, benchmarking, and more transparent assessments of blockchain infrastructure across diverse ecosystems.
- Open Access
Multiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
Blockchain technologies underpin an expanding ecosystem of decentralized applications, financial systems, and infrastructure. However, the fundamental networking layer that sustains these systems, the peer-to-peer layer, of all but the top few ecosystems remains largely opaque. In this paper, we present the first longitudinal, cross-network measurement study of 36 public blockchain networks. Over 9 months, we deployed 15 active crawlers, sourced data from two additional community crawlers, and conducted hourly connectivity probes to observe the evolving state of these networks. Furthermore, by leveraging Ethereum's discovery protocols, we inferred metadata for an additional 19 auxiliary networks that utilize the Ethereum peer discovery protocol. We also explored Internet-wide scans, which only require probing each protocol's default ports with a simple, network-specific payload. This approach allows us to rapidly identify responsive peers across the entire address space without having to implement custom discovery and handshake logic for every blockchain. We validated this method on Bitcoin and similar networks with known ground truth, then applied it to Cardano, which we could not crawl directly. Our study uncovers dramatic variation in network size from under 10 to more than 10,000 active nodes. We quantify trends in IPv4 versus IPv6 usage, analyze autonomous systems and geographic concentration, and characterize churn, diurnal behavior, and the coverage and redundancy of discovery protocols. These findings expose critical differences in network resilience, decentralization, and observability. Beyond characterizing each network, our methodology demonstrates a general framework for measuring decentralized networks at scale. This opens the door for continued monitoring, benchmarking, and more transparent assessments of blockchain infrastructure across diverse ecosystems.
Open AccessMultiple Sides of 36 Coins: Measuring Peer-to-Peer Infrastructure Across Cryptocurrencies
Blockchain technologies underpin an expanding ecosystem of decentralized applications, financial systems, and infrastructure. However, the fundamental networking layer that sustains these systems, the peer-to-peer layer, of all but the top few ecosystems remains largely opaque. In this paper, we present the first longitudinal, cross-network measurement study of 36 public blockchain networks. Over 9 months, we deployed 15 active crawlers, sourced data from two additional community crawlers, and conducted hourly connectivity probes to observe the evolving state of these networks. Furthermore, by leveraging Ethereum's discovery protocols, we inferred metadata for an additional 19 auxiliary networks that utilize the Ethereum peer discovery protocol. We also explored Internet-wide scans, which only require probing each protocol's default ports with a simple, network-specific payload. This approach allows us to rapidly identify responsive peers across the entire address space without having to implement custom discovery and handshake logic for every blockchain. We validated this method on Bitcoin and similar networks with known ground truth, then applied it to Cardano, which we could not crawl directly. Our study uncovers dramatic variation in network size from under 10 to more than 10,000 active nodes. We quantify trends in IPv4 versus IPv6 usage, analyze autonomous systems and geographic concentration, and characterize churn, diurnal behavior, and the coverage and redundancy of discovery protocols. These findings expose critical differences in network resilience, decentralization, and observability. Beyond characterizing each network, our methodology demonstrates a general framework for measuring decentralized networks at scale. This opens the door for continued monitoring, benchmarking, and more transparent assessments of blockchain infrastructure across diverse ecosystems.
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 363-377
Nakamoto Consensus under Bounded Processing Capacity
For Nakamoto's longest-chain consensus protocol, whose proof-of-work (PoW) and proof-of-stake (PoS) variants power major blockchains such as Bitcoin and Cardano, we revisit the classic problem of the security--performance tradeoff: Given a network of nodes with finite communication- and computation-resources, against what fraction of adversary power is Nakamoto consensus (NC) secure for a given block production rate? State-of-the-art analyses of NC fail to answer this question, because their bounded-delay model does not capture the rate limits to nodes' processing of blocks, which cause congestion when blocks are released in quick succession. We develop a new analysis technique to prove a refined security--performance tradeoff for PoW NC in a bounded-capacity model. In this model, we show that, in contrast to the classic bounded-delay model, Nakamoto's private attack is no longer the worst attack, and a new attack we call the teasing strategy, that exploits congestion, is strictly worse. In PoS, equivocating blocks can exacerbate congestion, making traditional PoS NC insecure except at very low block production rates. To counter such equivocation spamming, we present a variant of PoS NC we call Blanking NC (BlaNC), which achieves the same resilience as PoW NC.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 363-377
Open AccessNakamoto Consensus under Bounded Processing Capacity
For Nakamoto's longest-chain consensus protocol, whose proof-of-work (PoW) and proof-of-stake (PoS) variants power major blockchains such as Bitcoin and Cardano, we revisit the classic problem of the security--performance tradeoff: Given a network of nodes with finite communication- and computation-resources, against what fraction of adversary power is Nakamoto consensus (NC) secure for a given block production rate? State-of-the-art analyses of NC fail to answer this question, because their bounded-delay model does not capture the rate limits to nodes' processing of blocks, which cause congestion when blocks are released in quick succession. We develop a new analysis technique to prove a refined security--performance tradeoff for PoW NC in a bounded-capacity model. In this model, we show that, in contrast to the classic bounded-delay model, Nakamoto's private attack is no longer the worst attack, and a new attack we call the teasing strategy, that exploits congestion, is strictly worse. In PoS, equivocating blocks can exacerbate congestion, making traditional PoS NC insecure except at very low block production rates. To counter such equivocation spamming, we present a variant of PoS NC we call Blanking NC (BlaNC), which achieves the same resilience as PoW NC.
- 30 November 2024
- Published by Springer Nature
- p. 281-292
Short Paper: The PoW Landscape in the Aftermath of The Merge
- 30 November 2024
- Published by Springer Nature
- p. 281-292
Short Paper: The PoW Landscape in the Aftermath of The Merge
- Open Access
Stability of P2P Networks Under Greedy Peering (Full Version)
Major cryptocurrency networks have relied on random peering choice rules for making connections in their peer-to-peer networks. Generally, these choices have good properties, particularly for open, permissionless networks. Random peering choices however do not take into account that some actors may choose to optimize who they connect to such that they are quicker to hear about information being propagated in the network. In this paper, we explore the dynamics of such greedy strategies. We study a model in which nodes select peers with the objective of minimizing their average distance to a designated subset of nodes in the network, and consider the impact of several factors including the peer selection process, degree constraints, and the size of the designated subset. The latter is particularly interesting in the context of blockchain networks as generally only a subset of nodes are the propagation source for content. We first analyze an idealized version of the game where each node has full knowledge of the current network and aims to select the $d$ best connections, and prove the existence of equilibria under various model assumptions. Since in reality nodes only have local knowledge based on their peers' behavior, we also study a greedy protocol which runs in rounds, with each node replacing its worst-performing edge with a new random edge. We exactly characterize stability properties of networks that evolve with this peering rule and derive regimes where stability is possible and even inevitable. We also run extensive simulations with this peering rule examining both how the network evolves and how different network parameters affect the stability properties of the network. Our findings generally show that the only stable networks that arise from greedy peering choices are low-diameter and result in disparate performance for nodes in the network.Open AccessStability of P2P Networks Under Greedy Peering (Full Version)
Major cryptocurrency networks have relied on random peering choice rules for making connections in their peer-to-peer networks. Generally, these choices have good properties, particularly for open, permissionless networks. Random peering choices however do not take into account that some actors may choose to optimize who they connect to such that they are quicker to hear about information being propagated in the network. In this paper, we explore the dynamics of such greedy strategies. We study a model in which nodes select peers with the objective of minimizing their average distance to a designated subset of nodes in the network, and consider the impact of several factors including the peer selection process, degree constraints, and the size of the designated subset. The latter is particularly interesting in the context of blockchain networks as generally only a subset of nodes are the propagation source for content. We first analyze an idealized version of the game where each node has full knowledge of the current network and aims to select the $d$ best connections, and prove the existence of equilibria under various model assumptions. Since in reality nodes only have local knowledge based on their peers' behavior, we also study a greedy protocol which runs in rounds, with each node replacing its worst-performing edge with a new random edge. We exactly characterize stability properties of networks that evolve with this peering rule and derive regimes where stability is possible and even inevitable. We also run extensive simulations with this peering rule examining both how the network evolves and how different network parameters affect the stability properties of the network. Our findings generally show that the only stable networks that arise from greedy peering choices are low-diameter and result in disparate performance for nodes in the network.