Skip to main content

Antitoken: A Prediction Framework for Continuous Outcomes

Author: sshmatrix | Antitoken | quant/acc | q/acc

Ping: [email protected]

This is a living document and will be updated in real time to match the development of the actual product.

Abstract​

The Antitoken Collider Protocol introduces a quantum-inspired tokenomics framework designed to advance decentralised market-making and decision-making systems. By utilising a pair of entangled tokens, $ANTI and $PRO , the protocol incorporates the Collider contract, which transforms these inputs into emission ( $BARYON ) and radiation ( $PHOTON ) tokens. This innovative mechanism integrates deterministic and probabilistic behaviours, allowing markets to reflect both stable and uncertain dynamics. The protocol’s dual-token architecture, rooted in quantum-like operations, is positioned to address challenges in prediction markets, decentralised science (DeSci), and other domains requiring nuanced representations of dualities such as trust vs. uncertainty or risk vs. reward.

1. Introduction​

Blockchain-based decentralised systems have transformed finance and governance, offering novel mechanisms for automated market-making and resource allocation. However, traditional continuous automated market makers (AMMs) often fall short in applications where dualities, uncertainty, or non-linear outcomes are inherent. For instance, prediction markets and DeSci initiatives require tokenomics models capable of encoding probabilistic outcomes and balancing deterministic stability with dynamic adaptability.

The Antitoken Collider Protocol introduces a groundbreaking approach to these challenges by leveraging a dual-token architecture of $ANTI and $PRO tokens, which interact within a bespoke Collider contract. Inspired by principles of quantum mechanics, the Collider utilises tunable operations to emit $BARYON and $PHOTON tokens, representing predictable (deterministic) and uncertain (probabilistic) market dynamics, respectively. These emitted tokens facilitate a range of applications, from incentivising accurate predictions in market ecosystems to supporting decentralised research funding and distributed resource sharing.

This yellow paper presents the theoretical underpinnings, mathematical models, and practical applications of the Antitoken Collider Protocol. By introducing structured uncertainty, entangled token interactions, and reversible operations, this framework reimagines decentralised markets and offers a robust foundation for innovation across a variety of domains. The following sections delve into the protocol's design principles, operational mechanics, and potential use cases, setting the stage for broader adoption and adaptation in decentralised systems.

2. Core Mechanics​

The protocol operates on a dual-token system where participants can deposit two types of tokens, $ANTI and $PRO , represented as 𝛼 and 𝛽 respectively. For any given market, the protocol calculates two fundamental values:

  1. The $BARYON value (ΞΌ):

ΞΌ = NBARYON = 0, if NANTI + NPRO = 𝛼 + 𝛽 < 1

ΞΌ = NBARYON = |NANTI - NPRO| = |𝛼 - 𝛽| otherwise

i.e.

ΞΌ = 0, if 𝛼 + 𝛽 < 1

ΞΌ = |𝛼 - 𝛽| otherwise

  1. The $PHOTON value (Οƒ):

Οƒ = NPHOTON = 0, if NANTI + NPRO < 1 or |NANTI - NPRO| = NANTI + NPRO

Οƒ = NPHOTON = NANTI + NPRO, if 0 = NANTI + NPRO < 1 or |NANTI - NPRO| = NANTI + NPRO

Οƒ = NPHOTON = (NANTI + NPRO)/|NANTI - NPRO|, otherwise

i.e.

Οƒ = 0, if 𝛼 + 𝛽 < 1 or |𝛼 - 𝛽| = 𝛼 + 𝛽

Οƒ = 𝛼 + 𝛽, if 0 = 𝛼 + 𝛽 < 1 or |𝛼 - 𝛽| = 𝛼 + 𝛽

Οƒ = (𝛼 + 𝛽)/|𝛼 - 𝛽|, otherwise

In this formulation, ΞΌ captures the magnitude or size, while Οƒ captures the confidence or certainty, of a user's prediction. This process is referred to as a 'collision'.

Collider Visualiser

Mean (ΞΌ) (Prediction Strength): 20.00

Variance (Οƒ2) (Uncertainty): 25.00

0246810121416182022242628303234363840424446485052545658606264666870727476788082848688909294969810000.250.50.751

3. Closeness to Outcome​

The overlap function πœͺ plays central role in token redistribution following a prediction's finality. The overlap function is a measure of closeness of the prediction to any given truth. The overlap function is derived as follows:

πœͺ(πž…u, πž…T) =γ€ˆπž…u(𝛾)Β·πž…T(𝛾)〉

where, πž…u is a user's prediction and πž…T is the truth distribution with mean TΞΌ and variance TΟƒ2; γ€ˆ 〉 represents a finite integral over the entire range of possible outcomes. Lastly, the range of πœͺ satifies πœͺ ∈ [0, 1] .

Equaliser Visualiser

0246810121416182022242628303234363840424446485052545658606264666870727476788082848688909294969810000.250.50.751

Overlap (πœͺ): 0.0024

3.1 Binary Outcomes​

If the truth is binary (a strict Yes or No ), then πž…T becomes a dirac-delta function, i.e. πž…T = 𝞭(𝛾T). Consequently, the overlap function reduces to:

πœͺb(πž…u, πž…T) =γ€ˆπž…u(𝛾)·𝞭(𝛾T)d𝛾 = πž…u(𝛾T)〉

In explicit form, the overlap calculation for each position to the closest binary outcome (a Yes or No outcome) is defined as:

πœͺb(NBARYON, NPHOTON) = e-log10(SANTI + SPRO - NBARYON)2/2𝞻2(NPHOTON)

i.e.

πœͺb(ΞΌ, Οƒ) = e-log10(2.109 - ΞΌ)2/2𝞻2(Οƒ)

In order to avoid very small numbers, πœͺb(ΞΌ, Οƒ) is transformed such that:

πœͺ(ΞΌ, Οƒ) = 0, if πœͺb(ΞΌ, Οƒ) = 0,

πœͺ(ΞΌ, Οƒ) = 1, if πœͺb(ΞΌ, Οƒ) = 1,

πœͺ(ΞΌ, Οƒ) = |loge(πœͺb(ΞΌ, Οƒ))|-1, if 1 > πœͺb(ΞΌ, Οƒ) > 0, and

πœͺ(ΞΌ, Οƒ) = 1 - |loge(πœͺb(ΞΌ, Οƒ))|-1, if πœͺb(ΞΌ, Οƒ) < 0.

where:

  • SANTI, SPRO are the total supplies of $ANTI and $PRO respectively,
  • 𝞻(Οƒ) = 1 + log10(Οƒ) for Οƒ > 1, and 1 otherwise, and
  • πž… are normal distributions.

4. Token Redistribution​

The token redistribution process based on the final outcome is called equalisation, using truth distribution with mean TΞΌ and standard deviation TΟƒ. The equalisation function utilises a binning mechanism using the values calculated by the overlap function πœͺ(πž…u, πž…T) for each user prediction πž…u. For a set of predictions, the entire range of overlap πœͺ is binned into N bins. These bins, indexed by i , are then filled with the total tokens in the prediction pool, as some function Ξ€(πœͺi); in the alpha version, this dependence is simply linear in i , i.e.

Ξ€(πœͺi)[𝛼, 𝛽] = i/N Γ— [𝛼TOTAL, 𝛽TOTAL]

The overlap distribution is then given by:

Ξ“[𝛼, 𝛽]IN = [Ξ€(πœͺ1), ..., Ξ€(πœͺN)][𝛼, 𝛽].

Once the bins are filled, each prediction is dropped into its corresponding bin based on its overlap value πœͺ(ΞΌ, Οƒ) . At the end of this process, each i bin now additionally contains ki members among which Ξ€(πœͺi) tokens will be redistributed. If ki = 0 or 1 , redistribution is trivial. If ki > 1, then tokens in that bin are redistributed in the same proportion as they were originally deposited by the user, i.e. 𝛼r/Ξ£ki𝛼r and 𝛽r/Ξ£ki𝛽r for r = [1, ..., ki]. At the end of this procedure, each user's deposit is rebalanced according to their closeness to the true outcome. The redistributed tokens indexed by i are then described by:

Ξ“[𝛼, 𝛽]OUT = [[Ξ“(πœͺ1, 1), ..., Ξ“(πœͺk1, 1)], ..., [Ξ“(πœͺ1, i), ..., Ξ“(πœͺki, i)], ..., [Ξ“(πœͺ1, N), ..., Ξ“(πœͺkN, N)]][𝛼, 𝛽].

Each element of this vector is given by:

Ξ“(πœͺr, i)[𝛼, 𝛽] = Ξ€(πœͺi)[𝛼, 𝛽] Γ— [𝛼r/Ξ£ki𝛼r, 𝛽r/Ξ£ki𝛽r].

where

Ξ€(πœͺi) = i/N, and i = ⌊πœͺ(ΞΌ, Οƒ)/[πœͺ(ΞΌ, Οƒ)]max.

Note that ⌊ is the floor-to-nearest-integer operator.

4.1 Binary Case​

In the binary case, we simply set πœͺ = πœͺ(ΞΌ, Οƒ) as prescribed in section 3.1.

5. Reward System​

The net gain or loss ( 𝚫 ) is calculated as the difference between the redistributed tokens and the initial deposit:

𝚫[𝛼, 𝛽] = Ξ“(πœͺr, i)[𝛼, 𝛽] - [𝛼, 𝛽] = i/N Γ— [𝛼r·𝛼TOTAL/Ξ£ki𝛼r, 𝛽r·𝛽TOTAL/Ξ£ki𝛽r] - [𝛼r, 𝛽r].

In more succinct form,

𝚫[𝛼, 𝛽] = Ξ“(πœͺr, i)[𝛼, 𝛽] - [𝛼, 𝛽] = i/N Γ— [𝛼·𝛼TOTAL/Ξ£i𝛼i, 𝛽·𝛽TOTAL/Ξ£i𝛽i] - [𝛼, 𝛽].

with

i = ⌊πœͺ(ΞΌ, Οƒ)/[πœͺ(ΞΌ, Οƒ)]max.

6. Remarks​

The Antitoken Collider Protocol presents a novel approach to binary outcome markets, introducing mathematical rigor through its $BARYON - $PHOTON mechanics and equalisation function. Future development could explore multi-outcome markets and dynamic truth value adjustment mechanisms.