“Why would you think such a blatantly false thing? Some recent developments include: - Schnorr Signatures https://github.com/sipa/bips/blob/bip-schnorr/bip-schnorr.mediawiki - Taproot https://github.com/sipa/bips/blob/bip-schnorr/bip-taproot.mediawiki - Erlay (relay protocol that reduces bandwidth up to 75%) https://arxiv.org/abs/1905.10518 - Dandelion…”
Bandwidth-Efficient Transaction Relay for Bitcoin
Bitcoin is a top-ranked cryptocurrency that has experienced huge growth and survived numerous attacks. The protocols making up Bitcoin must therefore accommodate the growth of the network and ensure security. Security of the Bitcoin network depends on connectivity between the nodes. Higher connectivity yields better security. In this paper we make two observations: (1) current connectivity in the Bitcoin network is too low for optimal security; (2) at the same time, increasing connectivity will substantially increase the bandwidth used by the transaction dissemination protocol, making it prohibitively expensive to operate a Bitcoin node. Half of the total bandwidth needed to operate a Bitcoin node is currently used to just announce transactions. Unlike block relay, transaction dissemination has received little attention in prior work. We propose a new transaction dissemination protocol, Erlay, that not only reduces the bandwidth consumption by 40% assuming current connectivity, but also keeps the bandwidth use almost constant as the connectivity increases. In contrast, the existing protocol increases the bandwidth consumption linearly with the number of connections. By allowing more connections at a small cost, Erlay improves the security of the Bitcoin network. And, as we demonstrate, Erlay also hardens the network against attacks that attempt to learn the origin node of a transaction. Erlay is currently being investigated by the Bitcoin community for future use with the Bitcoin protocol.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“Network coding is very interesting but the maximum gains from the network coding itself are fairly limited... a small constant factor. In attempting to apply network coding I've found that vulnerability to (maliciously) corrupt data significantly limits the utility. If this is an area that interests you, you might also be interested in efficient set reco…”
“It's possible to be dramatically more communication efficient than bloom filters to synchronize sets. Bloom filters require O(my_set_size) bandwidth, with a good constant factor. This work optimizes it somewhat by excluding members that existed at the time of last synchronization, but it still wastes bandwidth when those commits came in from another sour…”
“In what sense? In terms of additional peerings wasting bandwidth proportional to the number of messages? That can be addressed with techniques like erlay ( https://arxiv.org/abs/1905.10518 ) though the erlay paper's settings are tuned for lower latency than something like Bitmessage would want. In terms of the fact that it is just a global broadcast? Not…”
- Bandwidth-Efficient Transaction Relay ↗nullc · 2019-05-28 · 1 分