funman300
571c5f9261
Task A, static phase. Ghidra 12.1.2 headless via the repo's own pyghidra harness
over CardsDLL_Win64_retail.dll (13,382 functions). Queries and raw decompiler
output committed under docs/evidence/market-sold-re-2026-08-17/.
RECOVERED FROM THE BINARY
1. No sold token, now EXHAUSTIVELY: both vocabularies dumped to their sentinels
rather than sampled. tradeState is exactly 4 rows; itemState is exactly 12
(invalid/free/WAITING_FOR_GAME/inGame/forSale/offered/activeBadge/
activeHomeKit/activeAwayKit/activeBall/activeStadium/active=255). A sold row
MUST therefore be a combination of existing atoms.
2. What closed does, complete, from the auctionInfo deserializer 0x18013e410:
IS_GLOW = (tradeState==closed) ? bidState != none
: bidState in {outbid, buyNow}
INBOX = bidState in {highest, buyNow}
3. The full record -> Flash map from the publisher 0x1801bf030, superseding the
partial list. The prize: record +0xbf is published as COINS_AWARDED, fed by the
coinsProcessed atom 0x2f4. The corpus had recorded that atom's type and noted
its consumer was never found; it is now traced. DURATION also renders the
localised FUT_AUCTION_EXPIRED when expires underflows.
4. highest vs buyNow on a closed row is UNDECIDABLE from CardsDLL, by proof: both
yield IS_GLOW=1/INBOX=1, bit-identical. But bidState is ALSO published verbatim
as YOURBID alongside STATE and COINS_AWARDED, so the movie does receive the raw
values - the discrimination exists and lives entirely in unread ActionScript.
This retires the question as a static target, and it contradicts the
third-party lore that a seller's sold row is closed+buyNow (the corpus's own
lifecycle table says closed+highest and assigns buyNow to the buyer).
5. The clear-sold verb EXISTS. Builder 0x1801647c0 emits "/sold" when the tradeId
field is zero and "/%lld" otherwise, on route base ut/delete/%s/trade, response
class RS4 FutISRemoveTradeServerResponse. Confirmed by the client's own
request-name table entry RemoveAllSoldFromTradePile. A BULK clear-sold verb only
makes sense if sold rows PERSIST in the seller's pile until cleared, which is
incompatible with our Fix A invariant - so the sold path will require revisiting
it under live validation.
6. The seller's SOLD counter is real, proven end to end with no inference: the hub
tradePile sub-deserializer 0x18013ead0 writes atom sold 0x2c9 to +0x1d8, and the
tile publisher 0x1800b1dc0 renders +0x1d8 as Flash TEXT3 under the localised
caption FUT_TF_SOLD. Siblings: selling -> +0x1d2 -> FUT_TF_SELLING,
count -> +0x1d4 -> FUT_UC_ITEMS, plus FUT_TF_WINNING/FUT_TF_OUTBID on the
Transfer Targets tile. We and the Python oracle both hardcode sold:0, so that
bucket can never fill.
7. Reusable method: an atom id is the INDEX into the alphabetical atom-name pointer
table at base 0x1802d2760. Validated 12/12 against the known auctionInfo atoms
and cross-checked against fifa17-recon/docs/fut_atoms.tsv. Documented gotcha:
resolve a name by the pointer slot INSIDE the table, never by the first matching
string in the binary, or you get confident nonsense.
8. An auction-outcome vocabulary exists (auctionSoldBid 0x39, auctionSoldBuyNow
0x3a, auctionWon*/auctionLost*) but NO deserializer consumes it - every
candidate function was checked for the value-SKIP/atom-loop signature and none
qualifies. Server-side or telemetry only; it does not carry sold state here.
TASK B IS UNDECIDABLE FROM THE CLIENT, and this is a proof of absence: no 0.95 or
0.05 constant of either width, no tax/fee/net/proceeds caption, and no fee
arithmetic anywhere. The client never computes or displays a net, so no experiment
against our own server can measure the rounding - whatever we credit is what it
displays, and there is no oracle. Only an original EA-era seller-balance capture
could settle it. The rule stays an explicit CHOICE (floor the fee, so
fee + proceeds == gross exactly) and is now pinned at the requested boundaries
100/101/119/120/149/150/151/199/200 plus 15,000 and i64::MAX.
Settlement NOT promoted. No production process, port or database was touched.
69 lines
2.3 KiB
Python
69 lines
2.3 KiB
Python
"""Q3 — full route table, the itemState/tradeState enum tables, and the pointer
|
|
arrays that reference the auctionSold* vocabulary and the bare 'sold' string.
|
|
"""
|
|
import struct
|
|
|
|
print("=" * 78)
|
|
print("== route table continued from 0x18021e0f8 until it stops looking like one")
|
|
print("=" * 78)
|
|
a = 0x18021E100
|
|
misses = 0
|
|
while a < 0x18021E400 and misses < 6:
|
|
p = qword(a)
|
|
s = rd_str(p, 120) if 0x180000000 < p < 0x180400000 else ""
|
|
if s and s.isprintable():
|
|
print(f" 0x{a:x} -> 0x{p:x} {s!r}")
|
|
misses = 0
|
|
else:
|
|
misses += 1
|
|
a += 8
|
|
|
|
print()
|
|
print("=" * 78)
|
|
print("== itemState table 0x180229cc0 (prior work: 12 rows) — dump generously")
|
|
print("=" * 78)
|
|
for i in range(20):
|
|
ea = 0x180229CC0 + i * 16
|
|
p, v = qword(ea), dword(ea + 8)
|
|
s = rd_str(p, 40) if 0x180000000 < p < 0x180400000 else ""
|
|
print(f" [{i:2d}] 0x{ea:x} str=0x{p:x} {s!r:24s} val={v} (0x{v:x})")
|
|
|
|
print()
|
|
print("=" * 78)
|
|
print("== tradeState table 0x180229e40 — dump generously")
|
|
print("=" * 78)
|
|
for i in range(12):
|
|
ea = 0x180229E40 + i * 16
|
|
p, v = qword(ea), dword(ea + 8)
|
|
s = rd_str(p, 40) if 0x180000000 < p < 0x180400000 else ""
|
|
print(f" [{i:2d}] 0x{ea:x} str=0x{p:x} {s!r:24s} val={v} (0x{v:x})")
|
|
|
|
print()
|
|
print("=" * 78)
|
|
print("== pointer arrays containing the sold vocabulary")
|
|
print("=" * 78)
|
|
for label, target in (("auctionSoldBid", 0x1802302C8),
|
|
("auctionSoldBuyNow", 0x1802302D8),
|
|
("auctionWonBuyNow", 0x180230300),
|
|
("sold@22f524", 0x18022F524),
|
|
("sold@228bed", 0x180228BED),
|
|
("SoldFromTradePile", 0x1801EFAF1),
|
|
("SOLD@20a0c7", 0x18020A0C7)):
|
|
pat = struct.pack("<Q", target)
|
|
hits = find_all(pat, blocks=(".rdata", ".data", ".text"))
|
|
print(f" {label:20s} pointer found at: {[hex(h) for h in hits] or 'NOWHERE'}")
|
|
|
|
print()
|
|
print("=" * 78)
|
|
print("== the .data array around 0x1802d3da8 (the one DATA xref to 'sold')")
|
|
print("=" * 78)
|
|
for i in range(-8, 12):
|
|
ea = 0x1802D3DA8 + i * 8
|
|
try:
|
|
p = qword(ea)
|
|
except Exception:
|
|
continue
|
|
s = rd_str(p, 50) if 0x180000000 < p < 0x180400000 else ""
|
|
mark = " <<<" if i == 0 else ""
|
|
print(f" 0x{ea:x} -> 0x{p:x} {s!r}{mark}")
|