protocol visuals / dedicated components
site-native motion system
Visual explanations without leaving the canonical whitepaper aesthetic.
The direction is not to turn Pumpologia into a Magic UI demo. The direction is to keep the current terminal-literary interface and add precise animated diagrams where they clarify the protocol.
Bitcoin evidence enters. The indexer replays. Recognition changes. Every animation below explains one protocol consequence.
active thesis
Bitcoin orders, Pumpologia remembers
The protocol reads Bitcoin evidence, derives market recognition, then exposes consequences that markets can price.
00
block
01
message
02
replay
03
state
04
market
05
next tx
btc possession
1000 sats
recognized capacity
1400
proof / claim
claim 400
btc possession
1000 sats
recognized capacity
600
deficit / memory
deficit 400
Bitcoin
orders inputs, outputs, OP_RETURN, finality
Pumpologia
replays lineage and derives recognized memory
Market
prices clean capacity, claims, deficits, routes
Mobile layout is a first-class protocol surface
Every circuit collapses into a phone-readable left rail with no right-side border, no clipping, and no horizontal scroll.
mobile rule
one column first
code
scrolls, never clips
rail
left only
btc possession
1000 sats
recognized capacity
1400
proof / claim
claim 400
btc possession
1000 sats
recognized capacity
600
deficit / memory
deficit 400
problem
desktop circuit overflow
protocol rule
stacked left rail
result
readable phone proof
Three layers of authority
Bitcoin gives order, Pumpologia gives recognition, and the market gives price; each lane stays inside its authority.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Bitcoin
orders inputs, outputs, OP_RETURN, finality
Pumpologia
replays lineage and derives recognized memory
Market
prices clean capacity, claims, deficits, routes
problem
Bitcoin asked to trade
protocol rule
Bitcoin only orders
result
market prices memory
Recognition, not custody
BTC possession can remain unchanged while protocol recognition, claim power, and deficit memory change.
00
block
01
message
02
replay
03
state
04
market
05
next tx
btc possession
1000 sats
recognized capacity
1400
proof / claim
claim 400
btc possession
1000 sats
recognized capacity
600
deficit / memory
deficit 400
Minimal OP_RETURN grammar
Tiny public messages become rich state only through lineage, block order, and canonical replay.
00
block
01
message
02
replay
03
state
04
market
05
next tx
No semantic economic IDs
The user spends lineage and publishes intent. Handles are forged after replay, not supplied at the protocol edge.
00
block
01
message
02
replay
03
state
04
market
05
next tx
problem
spoofed economic pointer
protocol rule
spend lineage only
result
derive handle
Long and short are directional deltas
A larger opposite delta closes the current exposure, realizes PnL, and opens the residual side without a close opcode.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Alice long meets Bob short — replayed as trade state
active replay
open long 1000 @ 65k
Alice: open long 1000 @ 65k
oracle: price discovery while lot stays open
market: unrealized pnl accumulates
Bob: short 1200 @ 66k crosses Alice
protocol: close 1000, open residual short 200
indexer: mint claim 400 and deficit 400
Alice PnL
+400
Bob PnL
-400
residual
short 200
state
claim
Alice btc
1000 sats
Alice proof
claim 400
Bob btc
1000 sats
Bob memory
deficit 400
Alice long meets Bob short — replayed as trade state
active replay
open long 1000 @ 65k
Alice: open long 1000 @ 65k
oracle: price discovery while lot stays open
market: unrealized pnl accumulates
Bob: short 1200 @ 66k crosses Alice
protocol: close 1000, open residual short 200
indexer: mint claim 400 and deficit 400
Alice PnL
+400
Bob PnL
-400
residual
short 200
state
claim
realized consequence
+400
Alice proof-backed claim
Bob deficit mirrors the claim
FIFO lots without user targeting
The user expresses direction and amount; the protocol consumes canonical lots attached to the spent lineage.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Incoming `short 700` consumes the oldest lot first, then partially consumes the next one. The user never supplies a lot id.
Market now, limit under lock
Market intents execute at deterministic inclusion-block price; limit intents travel through a lock window until trigger or expiry.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Limit intent locks only when the market touches the rule
active replay
sell claim 300 if price >= 65k
Alice: sell claim 300 if price >= 65k
market: price moves but does not execute
protocol: no custody and no hidden state
protocol: limit remains explicit
market: limit price touched; lock starts
indexer: availability window becomes tradable
intent
sell 300
limit
65k
lock
144 blocks
route
derived
Paired consequences
Realized PnL creates a proof-backed claim for the winner and mirrored deficit or reduced recognition for the loser.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Alice long meets Bob short — replayed as trade state
active replay
open long 1000 @ 65k
Alice: open long 1000 @ 65k
oracle: price discovery while lot stays open
market: unrealized pnl accumulates
Bob: short 1200 @ 66k crosses Alice
protocol: close 1000, open residual short 200
indexer: mint claim 400 and deficit 400
Alice PnL
+400
Bob PnL
-400
residual
short 200
state
claim
realized consequence
+400
Alice proof-backed claim
Bob deficit mirrors the claim
btc possession
1000 sats
recognized capacity
1400
proof / claim
claim 400
btc possession
1000 sats
recognized capacity
600
deficit / memory
deficit 400
Settlement by derived route
A settle message pays the canonical route derived from deficits, claims, and Bitcoin outputs; no creditor negotiation is needed.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Settlement route pays down proof claim
active replay
Alice claim 400 / Bob deficit 400
ledger: Alice claim 400 / Bob deficit 400
Bob: derive Alice settlement handle
Bob: broadcast settle 250 output
indexer: output matches derived route
protocol: claim and deficit reduce together
ledger: Bob capacity restored to 850
claim
400 → 150
deficit
400 → 150
settled
250
capacity
600 → 850
Alice claim
400
Bob deficit
400
Bob capacity
600
Alice claim
150
Bob deficit
150
Bob capacity
850
problem
stale competing settlement
protocol rule
Bitcoin order updates frontier
result
recompute or fail
Competing settlements resolve by Bitcoin order
A compact visual card for the race condition: the first valid settlement changes the frontier; later attempts must recompute.
tx A
first
tx B
recheck
Publish availability, do not ask for liquidity
A holder exposes proof or claim availability under a lock window; the market reads the signal without a custody pool.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Recovery rule, not mutable feed
At constant profile, honest indexers recover the same price from the same block, scaling rules, and finality policy.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Bitcoin
orders inputs, outputs, OP_RETURN, finality
Pumpologia
replays lineage and derives recognized memory
Market
prices clean capacity, claims, deficits, routes
Exponent is positive backing power
The exponent compresses beneficial backing from surplus proof, overcollateralized sats, restoration, and explicit risk-gated future claims.
00
block
01
message
02
replay
03
state
04
market
05
next tx
clean base
e=0
recognized backing
e=+2
deficit / degraded
separate risk
Positive exponent states come from backing power. Loser degradation is not encoded as a better exponent.
Bitcoin transaction interpreted as ITX
An ITX is the protocol interpretation of Bitcoin inputs, outputs, OP_RETURN, and block order, not another transaction layer.
00
block
01
message
02
replay
03
state
04
market
05
next tx
continue recognized lineage
allocate without multiplying rights
consolidate without erasing debt
isolate clean from dirty
invalid allocation blocked
reduce debt and restore
repair spent lineage
problem
tx is just bytes
protocol rule
interpret inputs/outputs/order
result
ITX-SETTLE
Outputs can split, rights cannot multiply
More Bitcoin outputs cannot manufacture more recognized rights; debt is conserved or the lineage locks.
00
block
01
message
02
replay
03
state
04
market
05
next tx
problem
dust griefing
protocol rule
bounded allocation or lock
result
no new rights
Same replay, same state root
Independent indexers converge because they replay the same evidence with deterministic ordering, math, and serialization.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Consensus inputs stay explicit
The mobile reader should see immediately which inputs are consensus relevant and which local sources are rejected.
Markets form around recognition
Clean lineage, claims, restoration, proof surplus, capacity scarcity, and reputation become connected recognition markets.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Attack surfaces become sterile
Canonical replay routes spoofing, washing, stale routes, double payment, oracle ambiguity, and drift into no-recognition or recomputation.
00
block
01
message
02
replay
03
state
04
market
05
next tx
semantic ids
removed
actor ambiguity
lineage
utxo washing
locked
double payment
route
stale route
recheck
dust split
conserved
oracle drift
profile
root drift
serialization
problem
semantic ID spoofing
protocol rule
no user IDs
result
sterile
problem
double pay route
protocol rule
frontier after Bitcoin order
result
recompute/fail
problem
state-root drift
protocol rule
canonical serialization
result
same root
Readable thesis, strict appendices
The body explains inevitability; appendices prove determinism with validation, fixtures, test vectors, and state roots.
00
block
01
message
02
replay
03
state
04
market
05
next tx
Only evidence, replay, recognition
The complete loop remains simple: long, short, settle, sell, recover; no hidden custody, no mutable history.
00
block
01
message
02
replay
03
state
04
market
05
next tx
btc possession
1000 sats
recognized capacity
1150
proof / claim
claim 150
btc possession
1000 sats
recognized capacity
850
deficit / memory
deficit 150
Bitcoin
orders inputs, outputs, OP_RETURN, finality
Pumpologia
replays lineage and derives recognized memory
Market
prices clean capacity, claims, deficits, routes
ordered evidence
candidate +4
intent band
clean
6,633 intents
~44 min
candidate +3
claim band
sell
7,001 intents
~33 min
candidate +2
settle band
route
4,533 intents
~22 min
candidate +1
recover band
repair
3,934 intents
~11 min
952362
0.03 BTC
ordered txs
finality clock
952361
0.03 BTC
ordered txs
finality clock
952360
0.03 BTC
ordered txs
finality clock
952359
0.03 BTC
ordered txs
finality clock
no recognition
0
admit lineage
1
route urgency
2
repair priority
3
minimum
intent
queued
104k
usage
263MB
evidence
Bitcoin order
inputs / outputs / OP_RETURN
replay
same rules
integer math / finality
recognition
market power
claims / capacity / routes
evidence
inputs, outputs, OP_RETURN, height, finality
recognition
lineage, deltas, claims, deficits, routes
memory
clean premium, claim liquidity, restoration demand
Bitcoin possession can remain flat while protocol recognition reprices the lineage.
before
1000
wins 400
1400 + claim
before
1000
loses 400
600 + deficit
The coins are not seized by the protocol. The public memory changes what the lineage is recognized as able to do.
Alice claim
+400
Bob deficit
400
Alice recognized capacity
1400
Bob recognized capacity
600
long 1000positive delta / append or fresh lotno position_idshort 400negative delta / consume opposite lotsno trade_idsettle 400pay canonical debt frontierno deficit_idsell 300 lock 144publish claim/proof availabilityno claim_idrecoverrepair lineage being spentno actor_id00 / bitcoin block
height 873145
txid 2f71...settle
output: Alice route 250
01 / protocol replay
actor: Bob lineage
op: settle 250
route handle derived
02 / state transition
claim 400 → 150
deficit 400 → 150
capacity 600 → 850
single debt object
output a
bounded debt
output b
bounded debt
output c
bounded debt
dust tail
locked
same block
certified extraction profile
integer scaling
finality policy
immutable replay
split into dust
rights conserved
merge with clean
debt survives
invalid allocation
lineage lock
double claim payment
frontier recheck
neutral Bitcoin
no custody, no consensus change
public memory
replayable by independent indexers
market recognition
capacity, claims, deficits become priceable
simple edge
long / short / settle / sell / recover