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:
- The
$BARYON
value (ΞΌ
):
ΞΌ = NBARYON = 0, if NANTI + NPRO = πΌ + π½ < 1
ΞΌ = NBARYON = |NANTI - NPRO| = |πΌ - π½| otherwise
i.e.
ΞΌ = 0, if πΌ + π½ < 1
ΞΌ = |πΌ - π½| otherwise
- 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
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
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
, and1
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.