Boom Whitepaper
  • About Boom
    • What is GamerBoom
    • GamerBoom in A Nutshell
    • The Future of Gaming
  • Explore the Ecosystem
    • The Portal for Data Mining
    • The Hub for Data Aggregation
    • The Ecology for Gaming Data
  • Architecture & Innovation
    • Architecture Overview
    • AI Driven Data Layer
    • AI Agent As A Service
    • Bonding Curve 101
    • Open Curation Network
  • Tokenomics
    • Token Utilities
  • Roadmap
  • Wager Game Rules
  • Canary Testing Guide
  • Guide For Gamers
  • Official Links
Powered by GitBook
On this page
  1. Architecture & Innovation

Bonding Curve 101

The Bonding Curve is a powerful mathematical concept that has gained popularity in the world of decentralized finance (DeFi) and blockchain-based networks. The Liquidity-driven Curation Mechanism offers a secure, transparent, and traceable guarantee by tokenizing untradable and intangible virtual assets such as data, IPs, AI Agents, influence, and MEMEs.

Bonding Curve 101

Let R be the current reserve of the parent currency(say, $BOOM); Let P be the price of BLP Tokens(the share token of Bonding Pool) ; Let S be the current circulating supply of BLP Tokens. So we have the reserve ratio K:

K=RPSK=\frac{R}{PS}K=PSR​

When a user buys an infinitesimal amount of BLP tokens dS (selling simply means dS < 0), we have:

PdS=dR=K(SdP+PdS)PdS=dR=K(SdP+PdS)PdS=dR=K(SdP+PdS)

After performing the integral, we have(C is arbitrary constant for a given K):

P=eCS1K−1P={e^C}{S^{\frac{1}{K}-1}} P=eCSK1​−1
R=eCKS1KR=e^CKS^{\frac{1}{K}}R=eCKSK1​

If the total supply of BLP token increases from S_0 to S, then the price increases from P_0 to P. The relationship between the two can be expressed as:

PP0=(SS0)1K−1\frac {P} {P_0} = (\frac {S} {S_0})^{\frac {1}{K}-1}P0​P​=(S0​S​)K1​−1

If a user buys a total of N BLP tokens, bringing the total supply from S_0 to S_0+N , the total paid amount of parent currency A is:

A=∫S0S0+NPdS=∫S0S0+NP0(SS0)1K−1dSA=\int^{S_0+N}_{S_0}{PdS}=\int{^{S_0+N}_{S_0}{P_0}(\frac{S}{S_0})^{\frac {1}{K}-1}}dSA=∫S0​S0​+N​PdS=∫S0​S0​+N​P0​(S0​S​)K1​−1dS

then, we have:

A=R0((1+NS0)1K−1)A=R_0\bigg((1+\frac{N}{S_0})^{\frac{1}{K}}-1\bigg)A=R0​((1+S0​N​)K1​−1)
N=S0((1+AR0)K−1)N=S_0\bigg((1+\frac{A}{R_0})^{K}-1\bigg)N=S0​((1+R0​A​)K−1)

Let's simplify the bonding curve function mentioned in the previous section. Let

eC=me^C=meC=m
1K−1=n\frac{1}{K}-1=nK1​−1=n

Thus, we have:

P=mSnP=mS^{n}P=mSn

R=mKSn+1R=mKS^{n+1}R=mKSn+1
PreviousAI Agent As A ServiceNextOpen Curation Network

Last updated 22 days ago