Peer-to-peer networks are composed of multiple nodes that interact with each other, enabling a decentralized system of communication and data exchange. The effective discovery and lookup of nodes are crucial elements that facilitate seamless interaction within this network. Traditionally, the discoverability problem could be addressed by maintaining a central directory, where nodes register themselves and query to find peers’ addresses. However, this method, while solving the discoverability issue, introduces a central point of failure and deviates from the decentralized ethos by requiring the directory to be accessible at all times.