Tether tests decentralized P2P search engine using Wikipedia archive

Tether, the issuer of the USDT stablecoin, demonstrated a working prototype of its decentralized peer‑to‑peer (P2P) search engine by distributing the entire Wikipedia archive across 100 nodes. The test showed that the data remained searchable and resilient to node failures.

Test setup and results

The company’s P2P team loaded the full Wikipedia dataset onto a network of 100 separate nodes. A search interface connected to the network returned results while displaying information about participating nodes. CEO Paolo Ardoino described the performance as “insane” and highlighted the use of fault‑tolerant structures to keep data available and resistant to censorship.

Technical architecture

The engine builds on Hypersearch, first disclosed in April, and relies on distributed hash table (DHT) technology from the Holepunch stack, including HyperDHT, Hyperswarm, Hypercore, Hyperbee, Hyperdrive and UDX. These components enable peers to locate each other, exchange data directly, and organize information without a central index.

Scalability and resilience

According to Ardoino, the design is intended to scale horizontally across thousands of nodes while maintaining high availability when individual participants leave or become unreachable. Fault‑tolerant structures and conflict‑free replicated data types (CRDTs) are used to let data self‑organize across the network, aiming to make the service resistant to censorship and single‑point failures.

Broader P2P initiatives at Tether

The search project extends Tether’s ongoing work on peer‑to‑peer software, which includes the encrypted communication app Keet, open‑source mining tools, and the QVAC AI toolkit. All these projects share the same Holepunch‑based distributed infrastructure.

Next steps

Tether has not announced a public release date for the search engine or detailed how it will handle web crawling, ranking, spam mitigation, or open‑network governance. The company is actively recruiting engineers with experience in distributed databases, DHT systems, CRDTs, and search architecture to continue development.