WIDE algorithm powering Bluesky

A cutting-edge reconciliation algorithm developed at WIDE is being used by Bluesky, the decentralized social network built on the AT protocol. In a recent research paper detailing Bluesky’s tech stack [1], researchers from Cambridge and Bluesky reveal that the AT protocol harnesses Merkle Search Trees (MST) – an innovative data…

Continue reading

WIDE Seminar 2025 – 1st July 2025

Programme: Tuesday July 1st 2025 09:00 – Arrival 09:05 – Opening (François) 09:10 – Mining in logarithmic space with variable difficulty (Emmanuelle Anceaume, ACM CCS 2026) 09:50 – Naively Sorting Evolving Data (George Giakkoupis, IEEE FOCS 2024) 10:30 – ☕️ Coffee Break 11:10 – Game 1: The past 12:10 –…

Continue reading

Paper accepted at PoPETS 2025

Congratulations to Dimitri Lereverend, Davide Frey, and François Taiani for their work “Low-Cost Privacy-Preserving Decentralized Learning” accepted at PoPETS 2025. The paper explores the use of correlated noise in decentralized learning to achieve an efficient privacy-utility tradeoff. Decentralized learning allows machine learning while keeping individual data local and private, but…

Continue reading

Paper accepted at AAAI 2025

Congratulations to Augustin Godinot, Erwan Le Merrer, and Francois Taiani for their paper entitled “Queries, Representation & Detection: the next 100 model fingerprinting schemes” accepted at AAAI 2025, a flagship conference in artificial intelligence. Comparing learned models is a fundamental task in Machine Learning (ML). In this paper, they studied model…

Continue reading

Paper accepted at NSDI 2025

Congratulations to Brice Ekane, Djob Mvondo, and Yérom-David Bromberg for their paper entitled “DiSC: Backpressure Mitigation In Multi-tier Applications With Distributed Shared Connection” accepted at NSDI 2025, a flagship conference in network and systems. This work targets load reduction on frontend servers by intelligently displacing the load on backend servers…

Continue reading

Paper accepted at FOCS 2024!

George Giakkoupis and Dimitrios Los from the WIDE team, jointly with Marcos Kiwi (Universidad de Chile), had their paper entitled “Naively Sorting Evolving Data is Optimal and Robust” accepted at FOCS 2024, one of the leading conferences in computer science! In this paper, the authors study sorting in the evolving…

Continue reading