按年被提到
20222023 · 1 次2026
系统、数据库与网络›分布式数据与 CRDT·arXiv:2212.13567 · cs.CR

Range-Based Set Reconciliation

Aljoscha Meyer · 2022
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2023-01-23 · 最近 2024-01-17
2不同的人
2活跃月份
2讨论串
1被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Range-based set reconciliation is a simple approach to efficiently computing the union of two sets over a network, based on recursively partitioning the sets and comparing fingerprints of the partitions to probabilistically detect whether a partition requires further work. Whereas prior presentations of this approach focus on specific fingerprinting schemes for specific use-cases, we give a more generic description and analysis in the broader context of set reconciliation. Precisely capturing the design space for fingerprinting schemes allows us to survey for cryptographically secure schemes. Furthermore, we reduce the time complexity of local computations by a logarithmic factor compared to previous publications.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论rklaehn · 2024-01

“iroh developer here. willow was not developed in a vacuum. the willow folks have worked with us while we have implemented many ideas from willow, starting with range based set reconciliation ( https://arxiv.org/abs/2212.13567 ) they have been open to removing parts that have turned out to add too much complexity to implementations.”

Willow Protocol原评论 ↗
被提交为 story · 1 次