TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Distributed consensus revised

116 pointsby kushtiabout 6 years ago

4 comments

cube2222about 6 years ago
If this interests you, check out their previous paper about generalised consensus: <a href="https:&#x2F;&#x2F;blog.acolyer.org&#x2F;2019&#x2F;03&#x2F;08&#x2F;a-generalised-solution-to-distributed-consensus&#x2F;" rel="nofollow">https:&#x2F;&#x2F;blog.acolyer.org&#x2F;2019&#x2F;03&#x2F;08&#x2F;a-generalised-solution-t...</a><p>I really like how understandable it is.
评论 #19854109 未加载
r4umabout 6 years ago
Part 2 <a href="https:&#x2F;&#x2F;blog.acolyer.org&#x2F;2019&#x2F;05&#x2F;08&#x2F;distributed-consensus-revised-part-ii&#x2F;" rel="nofollow">https:&#x2F;&#x2F;blog.acolyer.org&#x2F;2019&#x2F;05&#x2F;08&#x2F;distributed-consensus-re...</a>
pjkundertabout 6 years ago
The Avalanche protocol by Emin Gün Sirer appears to be a breakthrough in this field, apparently even more general in nature than Hashgraph.<p><a href="https:&#x2F;&#x2F;youtu.be&#x2F;AXrrqtFlGow" rel="nofollow">https:&#x2F;&#x2F;youtu.be&#x2F;AXrrqtFlGow</a>
评论 #19853003 未加载
评论 #19856723 未加载
no_identdabout 6 years ago
It&#x27;d almost certainly seem interesting to see whether one might manage to crosspollinate the above paper with this &#x27;recent&#x27; generalization result from parameterized computational social choice theory:<p><a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1711.06030" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1711.06030</a><p>(Published version, closed access: <a href="https:&#x2F;&#x2F;dl.acm.org&#x2F;citation.cfm?id=3278739" rel="nofollow">https:&#x2F;&#x2F;dl.acm.org&#x2F;citation.cfm?id=3278739</a>)<p>Aziz, Haris; Lee, Barton E. – Sub-committee Approval Voting and Generalised Justified Representation Axioms (2017&#x2F;2018)<p>Abstract:<p>&quot;Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called sub-committee voting (SCV) that simultaneously generalizes these settings. We then focus on sub-committee voting with approvals and propose extensions of the justified representation axioms that have been considered for proportional representation in approval-based committee voting. We study the properties and relations of these axioms. For each of the axioms, we analyze whether a representative committee exists and also examine the complexity of computing and verifying such a committee.&quot;<p>Citations: <a href="https:&#x2F;&#x2F;scholar.google.com&#x2F;scholar?cites=5804298394619698922" rel="nofollow">https:&#x2F;&#x2F;scholar.google.com&#x2F;scholar?cites=5804298394619698922</a><p>And then, perhaps, <i>that theorem of infamity by that dude who might have gone by—some name(, like, uh, )—&#x27;Aumann&#x27;</i>
评论 #19855246 未加载