# Minting

`kaal:entity:minting`

**Status.** derived

This node is assembled mechanically from the 8 claims that carry the concept tag `minting`. 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

8 claims across 5 works, 2019 to 2025.

**2019**

- [3396522-022](https://wulfkaal.github.io/claims/3396522-022) [failure/argued] *(failure mode)* -- Capping token supply, the dominant design choice in early cryptocurrency projects, is self defeating: fixing supply removes the core policy tool, minting additional tokens, that would otherwise address overvaluation, excessive speculation, market frenzy, and irrational exuberance.
  > In fact, fixing token supply removes the core policy tool, minting of additional tokens to increase supply, intended to address overvaluation, speculation, market frenzy and irrational exuberance.
  Craig Calcaterra, Wulf A. Kaal, Vadhindran K. Rao, Stable Cryptocurrencies (2019). SSRN: https://ssrn.com/abstract=3396522
- [3402701-008](https://wulfkaal.github.io/claims/3402701-008) [mechanism/argued] -- Under the quantity theory of money, minting twice as much currency halves its price and burning half of the existing currency doubles it, which is the mechanism by which a supply rule can theoretically stabilize price.
  > QTM dictates that minting twice as much currency will halve its price, and burning half of the existing currency will double its price
  Craig Calcaterra, Wulf A. Kaal, Vadhindran K. Rao, Stable Cryptocurrencies - First Order Principles (2019). SSRN: https://ssrn.com/abstract=3402701
- [3402701-009](https://wulfkaal.github.io/claims/3402701-009) [condition/argued] *(failure mode)* -- The quantity theory calculations behind minting and burning hold only in the ideal case; in practice the success of a stabilization scheme depends on how the money is actually printed, distributed or burned.
  > Such calculations are only valid in the ideal. In practice, the scheme's success depends on how the money is printed and distributed or burned
  Craig Calcaterra, Wulf A. Kaal, Vadhindran K. Rao, Stable Cryptocurrencies - First Order Principles (2019). SSRN: https://ssrn.com/abstract=3402701
- [3402701-010](https://wulfkaal.github.io/claims/3402701-010) [failure/argued] *(failure mode)* -- Distributing newly minted coins to shareholders, as Basis planned, is exploitable: shareholders can collude to hold their new money and drive the price up, which triggers further minting that benefits the colluders.
  > However, it is possible the shareholders would collude to drive the price up by holding their new money
  Craig Calcaterra, Wulf A. Kaal, Vadhindran K. Rao, Stable Cryptocurrencies - First Order Principles (2019). SSRN: https://ssrn.com/abstract=3402701

**2021**

- [3782217-028](https://wulfkaal.github.io/claims/3782217-028) [design/argued] -- Reputation in a news DAO must be anchored in fungible currency: new reputation should be minted only when articles connect to profitable endeavors such as advertising, paid analyses, or protocols relied upon for decentralized business contracts.
  > articles must have a foun- dational meaning in fungible currency. New reputation should only be minted when the articles are connected to profitable endeavors—advertising, paid analyses, new protocols that are relied upon for decentralized business contracts.
  Craig Calcaterra, Wulf A. Kaal, The Importance of History In Decentralization (2021). SSRN: https://ssrn.com/abstract=3782217

**2024**

- [4685567-011](https://wulfkaal.github.io/claims/4685567-011) [mechanism/argued] -- In an impact certificate system the rules of the game are set by demand: altruists define what counts by deciding which minted certificates they are willing to pay for.
  > By deciding which certificates they are willing to pay for, altruists using the system define the rules of the 37 game.
  Wulf A. Kaal, Impact Investing Innovation - From Impact 1.0 to 3.0 (2024). SSRN: https://ssrn.com/abstract=4685567

**2025**

- [5887242-010](https://wulfkaal.github.io/claims/5887242-010) [mechanism/argued] -- In the UDLC DAO, REP holders stake non-fungible reputation on predicted outcomes in Validation Pools; correct predictions mint fractional REP and integrate the new vertex with its weighted citation edges into the canonical Codex, while incorrect predictions trigger partial slashing and redistribution.
  > REP token holders stake their non-fungible reputation on predicted outcomes in Validation Pools. Correct predictions mint fractional REP and integrate the new vertex and its weighted citation edges into the canonical Codex. Incorrect predictions result in partial slashing and redistribution.
  Wulf A. Kaal, The UDLC DAO Operationalizing a Continuously Evolving Universal Digital Law Codex Through Weighted (2025). SSRN: https://ssrn.com/abstract=5887242
- [5887242-020](https://wulfkaal.github.io/claims/5887242-020) [mechanism/argued] -- Tight coupling creates an exponential penalty for contrarian positions, since a participant staking ten percent of reputation against consensus risks total loss of that stake while correct majority stakers receive newly minted fractional REP proportional to their contribution.
  > This creates an exponential penalty for contrarian positions: a participant staking 10% of their reputation against consensus risks total loss of that stake, while correct majority stakers receive newly minted fractional REP proportional to their contribution to the winning side.
  Wulf A. Kaal, The UDLC DAO Operationalizing a Continuously Evolving Universal Digital Law Codex Through Weighted (2025). SSRN: https://ssrn.com/abstract=5887242

## 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/minting.md | sha256sum

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