This session presents a new algorithm for efficient set reconciliation that operates in O(n log n) time relative to the set difference, not the total set size. By combining erasure codes and fountain codes, the algorithm enables replica repair over future content, where distributed systems can reconcile sets before all items exist. We'll explore applications including replica repair, improved gossip protocols, genome comparison, and distributed systems, concluding with audience discussion of additional use cases.