entity · derived
Impossibility results
Derived node: assembled mechanically from the claims carrying impossibility-results. A roster, not an adjudicated definition.
Every claim under this term
- 3125827-001 : No single, fixed, entirely algorithmic policing solution can completely prevent independent nodes in a distributed system from gaming block production to advantage some parties over others. Any consen
- 3782203-008 : Impossibility results establish that no static set of rules can eternally sustain a DAO, which is why DAOs must be set up to run with a dynamic set of rules from the very beginning.
- 3782203-009 : Condorcet's paradox demonstrates that it is impossible to construct any democratic voting method that will faithfully discover the will of a group, because cyclic preferences can leave no clear winner
- 3782203-027 : Finding a correct by construction algorithm that incorporates all possible or even all practical assumptions about network status is not possible, because for any set of assumptions about network beha
- 3782203-029 : The authors hold that the Bitcoin proof of work algorithm is ultimately flawed, that every consensus algorithm is flawed, and that it is not possible to create an algorithm that is not flawed.
- 3782214-003 : Every governance process ever implemented is flawed, and no perfect governance system is possible even under very minimal assumptions such as non dictatorship; the goal must therefore be practical and
- 3782220-028 : The drift into static power relationships is a universal temptation because centralization is efficient, yet centralized governance is provably flawed.