Searcharxiv⌕ Search

arXiv subjects

Leonhard Balduf

Publications and source records attributed to Leonhard Balduf.

9 recordsLinked to original sources

An Alternative to Crawlers: Scalable P2P Network Monitoring Using the Network Scale-Up Method

\Ac{p2p} networks have remained an active area of research and development for decades. Originally used for data dissemination, they have later become instrumental to decentralized payment systems, blockchains, and Web3 applications. Since decentralization is a crucial property of these networks, they are continuously monitored to track attributes such as the geographical distribution of nodes, which serve as indicators of infrastructure concentration and resilience. However, monitoring typically relies on network crawls to derive accurate snapshots, which requires substantial computational and network resources. In contrast, \ac{nsum} is a statistical tool that estimates the prevalence of subpopulations based on responses to questions such as \enquote{How many people do you know in a specific group?} This work leverages the information embedded in Kademlia routing tables to develop a lightweight \ac{nsum}-based measurement and estimation framework that infers global network attribute distributions from a small set of nodes, offering an alternative to full-network crawls. As a case study, we evaluate our approach on \ac{ipfs}, a well-researched and widely used Web3 data storage and retrieval network. This is the first application of \ac{nsum} to decentralized network measurement. We evaluate our methodology on two datasets: the first comprises 360 full-network crawls collected over one month to assess our measurement-estimation approach across multiple simulated measurement scenarios, while the second dataset was collected through a deployment of the proposed lightweight measurement framework during May 2026. The results show that local Kademlia routing views, with only 10 nodes, preserve sufficient information to accurately estimate global attribute distributions, achieving normalized biases below \SI{10}{\percent} and closely tracking temporal changes in network composition.

cs.NI↗

Benchmarking Content-Defined Chunking Algorithms for Data Deduplication

Data deduplication relies on content-defined chunking (CDC) algorithms to decide where data is split. We observe that most CDC algorithms are modular: a base chunking algorithm fixes the byte-level cut-point condition, while high-level techniques (size normalization, min/max thresholds, caching) layer on top. Existing benchmarks conflate the two, obscuring which design choices actually drive performance. We isolate and evaluate eight state-of-the-art base chunking algorithms across four realistic workloads and four metrics: throughput, deduplication ratio, mean chunk size, and chunk-size variance. Further, we derive new formulas relating algorithm parameters to expected chunk size for AE, RAM, and MII. In doing so, we uncover a longstanding error in the widely-used AE parameterization reproduced across multiple papers and evaluation tools that produces chunks 13-39% smaller than intended and inflates AE's reported deduplication. Across our evaluation, AE is the most balanced base chunking algorithm across all four metrics, RAM's similarity to AE does not carry over to low-entropy data, and MII and PCI show limited advantages over simpler alternatives in storage-oriented workloads. We release all implementations, datasets, and analysis scripts as open source.

cs.DB↗

Beyond Single-Tokenomics: How Farcaster's Pluralistic Incentives Reshape Social Networking

This paper presents the first empirical analysis of how diverse token-based reward mechanisms impact platform dynamics and user behaviors. For this, we gather a unique, large-scale dataset from Farcaster. This blockchain-based, decentralized social network incorporates multiple incentive mechanisms spanning platform-native rewards, third-party token programs, and peer-to-peer tipping. Our dataset captures token transactions and social interactions from 574,829 wallet-linked users, representing 64.25% of the platform's user base. Our socioeconomic analyses reveal how different tokenomics design shape varying participation rates (7.6%--70%) and wealth concentration patterns (Gini 0.72--0.94), whereas inter-community tipping is 1.3--2x more frequent among non-following pairs, thereby mitigating echo chambers. Our causal analyses further uncover several critical trade-offs: (1) while most token rewards boost content creation, they often fail to enhance -- sometimes undermining -- content quality; (2) token rewards increase follower acquisition but show neutral or negative effects on outbound following, suggesting potential asymmetric network growth; (3) repeated algorithmic rewards demonstrate strong cumulative effects that may encourage strategic optimization. Our findings advance understanding of cryptocurrency integration in social platforms and highlight challenges in aligning economic incentives with authentic social value.

cs.SI↗

Bootstrapping Social Networks: Lessons from Bluesky Starter Packs

Microblogging is a crucial mode of online communication. However, launching a new microblogging platform remains challenging, largely due to network effects. This has resulted in entrenched (and undesirable) dominance by established players, such as X/Twitter. To overcome these network effects, Bluesky, an emerging microblogging platform, introduced starter packs -- curated lists of accounts that users can follow with a single click. We ask if starter packs have the potential to tackle the critical problem of social bootstrapping in new online social networks? This paper is the first to address this question: we asses whether starter packs have been indeed helpful in supporting Bluesky growth. Our dataset includes $25.05 \times 10^6$ users and $335.42 \times 10^3$ starter packs with $1.73 \times 10^6$ members, covering the entire lifecycle of Bluesky. We study the usage of these starter packs, their ability to drive network and activity growth, and their potential downsides. We also quantify the benefits of starter packs for members and creators on user visibility and activity while identifying potential challenges. By evaluating starter packs' effectiveness and limitations, we contribute to the broader discourse on platform growth strategies and competitive innovation in the social media landscape.

cs.SI↗

Looking AT the Blue Skies of Bluesky

The pitfalls of centralized social networks, such as Facebook and Twitter/X, have led to concerns about control, transparency, and accountability. Decentralized social networks have emerged as a result with the goal of empowering users. These decentralized approaches come with their own tradeoffs, and therefore multiple architectures exist. In this paper, we conduct the first large-scale analysis of Bluesky, a prominent decentralized microblogging platform. In contrast to alternative approaches (e.g. Mastodon), Bluesky decomposes and opens the key functions of the platform into subcomponents that can be provided by third party stakeholders. We collect a comprehensive dataset covering all the key elements of Bluesky, study user activity and assess the diversity of providers for each sub-components.

cs.NI↗

A Thorough Investigation of Content-Defined Chunking Algorithms for Data Deduplication

Data deduplication emerged as a powerful solution for reducing storage and bandwidth costs in cloud settings by eliminating redundancies at the level of chunks. This has spurred the development of numerous Content-Defined Chunking (CDC) algorithms over the past two decades. Despite advancements, the current state-of-the-art remains obscure, as a thorough and impartial analysis and comparison is lacking. We conduct a rigorous theoretical analysis and impartial experimental comparison of several leading CDC algorithms. Using four realistic datasets, we evaluate these algorithms against four key metrics: throughput, deduplication ratio, average chunk size, and chunk-size variance. Our analyses, in many instances, extend the findings of their original publications by reporting new results and putting existing ones into context. Moreover, we highlight limitations that have previously gone unnoticed. Our findings provide valuable insights that inform the selection and optimization of CDC algorithms for practical applications in data deduplication.

cs.DC↗

The Cloud Strikes Back: Investigating the Decentralization of IPFS

Interplanetary Filesystem (IPFS) is one of the largest peer-to-peer filesystems in operation. The network is the default storage layer for Web3 and is being presented as a solution to the centralization of the web. In this paper, we present a large-scale, multi-modal measurement study of the IPFS network. We analyze the topology, the traffic, the content providers and the entry points from the classical Internet. Our measurements show significant centralization in the IPFS network and a high share of nodes hosted in the cloud. We also shed light on the main stakeholders in the ecosystem. We discuss key challenges that might disrupt continuing efforts to decentralize the Web and highlight multiple properties that are creating pressures toward centralization.

cs.NI↗

Dude, where's my NFT? Distributed Infrastructures for Digital Art

We explore issues relating to the storage of digital art, based on an empirical investigation into the storage of audiovisual data referenced by non-fungible tokens (NFTs). We identify current trends in NFT data storage and highlight problems with implemented solutions. We particularly focus our investigation on the use of the Interplanetary Filesystem (IPFS), which emerges as a popular and versatile distributed storage solution for NFTs. Based on the analysis of discovered data storage techniques, we propose a set of best practices to ensure long-term storage survivability of NFT data. While helpful for forming the NFT art market into a legitimate long-term environment for digital art, our recommendations are also directly applicable for improving the availability and integrity of non-NFT digital art.

cs.NI↗

Monitoring Data Requests in Decentralized Data Storage Systems: A Case Study of IPFS

Decentralized data storage systems like the Interplanetary Filesystem (IPFS) are becoming increasingly popular, e. g., as a data layer in blockchain applications and for sharing content in a censorship-resistant manner. In IPFS, data is hosted by an open set of nodes and data requests are broadcast to connected peers in addition to being routed via a distributed hash table (DHT). In this paper, we present a passive monitoring methodology that exploits this design for obtaining data requests from a significant and upscalable portion of nodes. Using an implementation of our approach for the IPFS network and data collected over a period of fifteen months, we demonstrate how our methodology enables profound insights into, among other things: the size of the IPFS network, activity levels and structure, and content popularity distributions. We furthermore present that our methodology can be abused for attacks on users' privacy. For example, we were able to identify and successfully surveil the IPFS nodes corresponding to public IPFS/HTTP gateways.We give a detailed analysis of the mechanics and reasons behind implied privacy threats and discuss possible countermeasures.

cs.NI↗