// the roman verdict, on a trading screen
LIQUET
NON LIQUET
A pump.fun terminal where every number says what kind of claim it is — decoded from the chain, derived from figures that were, handed over by someone else, or chosen by you. The ones it could not establish say non liquet instead of appearing anyway.
beware of the number with no source. the whole screen is built so that one cannot appear — not by policy, by a type that refuses to be constructed without one
// live board
waiting…
hatched, because none of it is a reading. the real ladder is to the right, and every rung on it carries a verdict
the ladder is not a picture of the product
It is the product, rendered here with a live pool — EYE on pumpswap, read from DexScreener a moment ago. Every rung is what it would cost to move that pool to that price, derived from k = S·T.
a screenshot would age the day the design changed — and a terminal whose whole claim is provenance does not get to advertise itself with a mock-up of its own output
not a volume profile. each bar is what it would COST to move this pool to that price — derived from the reserves, exact, and comparable only within this one pool
// read when you loaded this page
THE CLAIMS ARE MEASUREMENTS
78
pump.fun pools found
across 4 of 4 searches, deduped — and 54 of them are below the cut, which the board says out loud
2 of 4
programs one key can replace
the upgrade authority of every program a trade here routes through, read from the chain just now
0
programs of our own
LIQUET deploys nothing, holds nothing and signs nothing — the only version of “we cannot touch your funds” that needs no qualification
// the standard
WHY IT HOLDS UP
// a verdict on every number
Read, derived, assumed or reported — each drawn differently, and the difference enforced by a type rather than by good intentions. A figure with no source cannot be constructed, let alone rendered.
// a ladder that is arithmetic
No volume profile. Nobody can honestly say how much traded at a price on a pool four minutes old. This shows what it would cost to move the pool to each price — exact, from two numbers.
// who can replace the code
Every rival writes “non-custodial”. It is almost always a claim about today’s bytecode. This reads the upgrade authority of every program your trade touches and prints it beside the claim.
// no score to trade on
No 0–100 risk number with unpublished weights and no accuracy record. The inputs a score would have eaten are shown instead — age, liquidity, how one-sided the last five minutes were.
// the cut is never silent
The board keeps the loudest pools by five-minute volume and prints how many fell below the line. A list showing 24 of 82 without saying so has answered a different question than you asked.
// contagion, on purpose
One murky input makes everything derived from it murky, inheriting the reason rather than inventing one. A derived figure takes the oldest slot of its inputs — the newest would launder stale ones.
// the two words
A REFUSAL IS A VERDICT
A Roman judge satisfied by a case returned liquet — “it is clear”. One who was not returned non liquet, and the case was adjourned rather than decided. The refusal had a name.
LIQUET
It is clear, and it says where it came from. Four marks, four different claims:
- ·readdecoded from an account, at a stated slot
- =derivedarithmetic on read figures, no free parameters
- *assumeda number you chose — your fee, your risk
- ~reportedhanded over; we cannot show our working
NON LIQUET
Not a gap — a verdict. The cell is hatched, names what is missing, and shows no number at all.
Never a dash and never a zero. A dash reads as zero, and zero is a quantity — a zero fee and an unknown fee lead to opposite decisions.
// the claim nobody qualifies
“NON-CUSTODIAL” IS ABOUT TODAY’S BYTECODE
2 of 4
programs your trade routes through that one private key can replace
// one transaction, no notice
A program under the upgradeable loader can be swapped by whoever holds its authority. No vote, no timelock, no announcement.
// a key in daily use is worse
A dormant authority and one that signs every day are different risks. An operational key lives on a server, and the program is only as safe as that server.
// and ours, on the same terms
LIQUET deploys no program, so there is no bytecode of ours to replace. The day that changes, it gains a row in the same table.
// the refusals
WHAT IT WILL NOT DO
// the loop
HOW TO READ IT
01
take the mark first
· read = derived * assumed ~ reported. The mark tells you what kind of claim you are looking at before you have read a single digit.
02
read the ladder as a cost
A long bar is a price that is expensive to reach — which is what resistance means on an automated market maker. Comparable within one pool, never between two.
03
check who holds the keys
Before the size, before the stop. A program one key can replace is a rule that can be rewritten while your position is open.
// roadmap
WHAT IS NOT BUILT YET
that middle paragraph is a limitation, and it is on the landing page rather than in a footnote — a terminal whose entire claim is provenance does not get to be vague about its own
liquet reads and derives — it settles nothing, takes no custody, and is not advice