Protocol Labs Research
2020.10.13 / News, Grants
Meet the latest Protocol Labs Research Grant recipients

In January of 2020, the Resilient Networks Lab (ResNetLab) launched two RFPs (Requests for Proposals) to address pressing open problems faced by IPFS and libp2p, namely, Routing at Scale and PubSub at Scale.

We received a total of ten applications and elected to fund four of the ten. Below you’ll find an overview of each RFP and profiles of the awardees. We are extremely excited to work on these hard problems with an incredible representation of researchers from across the globe, all of whom have extensive experience and a proven track record in their respective fields.

RFP 7: Multi-Level DHT Design and Evaluation

RFP-7 solicited approaches that target Distributed Hash Table-based architectures and proposed enhanced designs that use multiple DHT layers. We were looking for novel designs that are resilient to high churn, provide low look-up time, and scale to tens of millions of users. Despite the fact that Multi-Layer DHTs (ML-DHTs) have been a hot research topic in the past, we have been looking for fresh ideas that go beyond traditional designs to address permissionless, decentralized peer-to-peer (P2P) networks, where testing and evaluation can take place in testbed environments, rather than be restricted to simulation results only. You can find the full RFP description here.

We received some truly exceptional proposals for this RFP, ultimately selecting three for funding:

Athens University of Economics and Business

Our first awardees were George Polyzos, Spyros Voulgaris, Nikos Fotiou, and Yiannis Thomas from the Athens University of Economics and Business (AUEB). This team is part of AUEB’s Mobile Multimedia Laboratory (MMlab), which is actively involved in researching networks of the future. MMlab’s expertise lies in Internet architecture and protocols, mobile and wireless networks, security, authentication and authorization, business models and incentive mechanisms. Prof. Polyzos’ team has expertise and experience in areas at the heart of this RFP, having designed ML-DHT systems in the past and having been part of flagship collaborative research projects in the area.

This proposal aims to leverage the group’s experience in designing Hierarchical Pastry (H-Pastry), a ML-DHT system, and in developing and extensively using PeerSim to design and evaluate a structured DHT adapted for libp2p and IPFS.

NOVA University of Lisbon

The second RFP-7 awardee is João Leitão, Assistant Professor in the Informatics Department at the Faculdade de Ciências e Tecnologia of the Universidade Nova de Lisboa and an Integrated Member of the NOVA Laboratory for Computer Science and Informatics (NOVA LINCS). João is the author of high-impact papers such as ChainReaction: a causal+ consistent datastore based on chain replication (2013), HyParView: A membership protocol for reliable gossip-based broadcast (2007), and Epidemic broadcast trees (2007). His current research focuses on the scalability and dependability of large-scale distributed systems.

His proposal seeks to devise a novel design for a hierarchical overlay network capable of supporting unprecedented scale routing through logical names.

Tokyo University of Technology, Waseda University, Waseda Research Institute for Science and Engineering, and Tokyo University of Information Science

The final RFP-7 grant recipients are Hidehiro Kanemitsu (Team Lead, Tokyo University of Technology), Hidenori Nakazato (Collaborator, Waseda University), Kenji Kanai (Collaborator, Waseda Research Institute for Science and Engineering), and Masaki Hanada (Advisor, Tokyo University of Information Science). The expertise of this team ranges from distributed computing and P2P networks, to Service Function Chaining (SFC), Information-Centric Networks (ICN), and performance optimization for pubsub.

Their proposal seeks to develop a DHT-based routing scheme with underlay-aware lookup optimization for large-scale overlay networks. The primary foci are lookup optimization, novel content-naming schemes, and churn resilience.

RFP 8: Scalability Bounds of P2P PubSub

This RFP called for approaches that explore the scalability bounds of the existing pubsub algorithms within libp2p. Libp2p’s pubsub solution—GossipSub—powers IPFS, Filecoin, and Ethereum 2.0. Within IPFS, it is used to propagate name-records for the InterPlanetary Naming System (IPNS). As the network grows from hundreds of thousands of daily users to multiple millions, the IPNS system and the underlying pubsub protocol are expected to be stressed to their limits. Either a thorough evaluation of the scalability performance of existing protocols or the redesign of these protocols is essential before they are deployed at these larger scales. You can read the full RFP description here.

We are currently funding one proposal for RFP-8, with collaborators from two U.S. universities:

The Ohio State University and the University of Washington

The team collaborating on RFP-8 is composed of Shaileshh Bojja Venkatakrishnan from the Ohio State University and Sreeram Kannan from the University of Washington - Seattle. The team has made significant contributions in the area of high-throughput cryptocurrency routing and pubsub for permissionless blockchain networks, as well as network-layer anonymity, publishing in top-tier venues including Usenix NSDI and ACM HotNets.

Their proposal aims to use an action-reward learning algorithm to optimize the behavior of nodes in a P2P network. This algorithm will then be tested using simulations to evaluate message propagation latency, node churn, bandwidth and CPU utilization, and number of nodes in the network. Finally, the team will build a prototype implementation for validation.

RFP-0: Proofs of Geolocation

In addition to the ResNetLab grants, we are also funding a research effort from Ari Juels, Deepak Maram, and Iddo Bentov at Cornell Tech on “Proofs of Geolocation,” which explores cryptographically verifying geolocation of a node in a permissionless network. This funding is dispersed as part of our open call (RFP-0).

We are extremely excited about all of these collaborations, and we look forward to working with so many impressive researchers.

You can learn more about some of the current open problems ResNetLab is exploring here and monitor active RFPs at We’ll also be announcing future RFPs in our newsletter, so make sure to scroll down and sign up at the bottom of this page.