# Condorcet paradox

`kaal:entity:condorcet-paradox`

**Status.** derived

This node is assembled mechanically from the 2 claims that carry the concept tag `condorcet-paradox`. It is a roster of what the corpus says under this term. It is **not** an adjudicated definition: no single statement here has been ruled canonical, and no first-appearance call has been made. Read the claims and judge for yourself.

## Every claim under this term

2 claims across 1 works, 2021 to 2021.

**2021**

- [3782203-009](https://wulfkaal.github.io/claims/3782203-009) [failure/evidenced] *(failure mode)* -- 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.
  > Condorcet's paradox5 demonstrates it is impossible to construct any method that will faithfully discover the will of a group, with any type of democratic voting system.
  Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021). SSRN: https://ssrn.com/abstract=3782203
- [3782203-010](https://wulfkaal.github.io/claims/3782203-010) [mechanism/argued] *(failure mode)* -- Because a group sometimes genuinely has no consensus to be discovered, network forking is at times inevitable rather than a governance failure that better rules could prevent.
  > First, that is a major problem for democracy. Sometimes there is no consensus to be had. This leads to the second conclusion that sometimes network forking is inevitable.
  Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021). SSRN: https://ssrn.com/abstract=3782203

## Verify

Every claim above resolves to a record carrying a verbatim source quote, the sha256 of the source PDF, and a preformatted citation. Nothing here asks to be taken on trust.

    curl -s https://wulfkaal.github.io/entities/condorcet-paradox.md | sha256sum

**Canonical form.** This markdown file is the canonical hashed representation of this entity node. Its sha256 is the content hash.