State and time - Test

It loads only the tick arrays the price can move through, and every other array stays out of the transaction

It can move the price across the whole range in one transaction

It no longer needs the pool account

Swaps in the same pool can run in parallel

One Merkle root plus the top levels of the tree, while the NFT data lives with indexers

A hash of each NFT, one per leaf

The full metadata of every NFT in a zero-copy array

A list of the owners only

The client finds the position off-chain and sends it, and the program checks only the two neighbors

The book is small enough to walk within the compute limit

Orders are stored in price order, so the position is the price

The program caches the last insertion point

An attacker opens positions until the loop exceeds the compute limit, and the instruction fails for everyone

The loop reads stale data

The instruction becomes too cheap to deter spam

Positions opened by the attacker are counted twice

They simulate the transaction and send it only when the simulation shows a win

They change the slot hash

They send the bet twice

They front-run the oracle

The person whose outcome it decides

The oracle that produces the random value

The maker who fills the order

A keeper paid to send it

The transaction's recent blockhash expires in about a minute, and the signature dies with it

Solana does not allow servers to submit transactions

The order would need the user's private key on the server

A signed transaction cannot contain a price

A PDA of the program, through invoke_signed

The keeper who sent the execute transaction

The user, who must be online to co-sign

The target program

It marks the order as filled and records what is owed, and a later settlement with the maker's accounts pays it

It transfers the tokens to the maker in the same transaction

It asks the maker to sign the payout

It queues the payout for the protocol's server

As a claim that cannot be spent until it is settled

As part of the maker's balance, available for new orders

As collateral for the maker's other positions

As already transferred

A total applied twice is the same total, and an old total is below the paid amount and pays nothing

Totals are smaller to sign

Daily rewards would need a timestamp

The oracle cannot compute daily rewards

It executes automatically

It can be cancelled, but not approved or executed

It can be approved by the new signers

It is deleted

Any two transactions, swapped, land on the same final state

Every transaction carries a nonce

The program stores the id of the last message

No transaction can fail

The minimum output they accept, and the swap fails if the result drops below it

The exact output of 150, and the swap fails if the result differs

The expected price, which the program then enforces

Nothing about the output, since the price is decided at execution