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.
70 lines
2.6 KiB
Python
70 lines
2.6 KiB
Python
"""Task B — does FIFA17.exe itself compute the transfer fee / net proceeds?
|
|
|
|
If the list-item confirmation screen shows "you will receive N", the rounding rule
|
|
is IN THE BINARY and needs no live measurement. Look for:
|
|
* localisation keys mentioning tax/fee/net/receive
|
|
* float constants 0.95 / 0.05
|
|
* integer 95 or 5 used with 100 in the same function
|
|
"""
|
|
import struct
|
|
|
|
print("=" * 78)
|
|
print("== localisation / string keys about tax, fee, net proceeds")
|
|
print("=" * 78)
|
|
for needle in (b"TAX", b"tax", b"Tax", b"FEE", b"_FEE", b"fee", b"NET", b"_NET",
|
|
b"RECEIVE", b"Receive", b"PROCEEDS", b"COMMISSION", b"EA_TAX",
|
|
b"FUT_TF_", b"AFTER_TAX", b"earnings", b"Earnings"):
|
|
hits = find_all(needle, blocks=(".rdata", ".data"))
|
|
shown = 0
|
|
for h in hits:
|
|
s = rd_str(h, 70)
|
|
if s and len(s) > 2 and s.isprintable():
|
|
print(f" {needle.decode():10s} 0x{h:x} {s!r}")
|
|
shown += 1
|
|
if shown >= 12:
|
|
break
|
|
if not shown:
|
|
print(f" {needle.decode():10s} (no printable hits)")
|
|
|
|
print()
|
|
print("=" * 78)
|
|
print("== float constants 0.95 / 0.05 / 0.95f / 0.05f")
|
|
print("=" * 78)
|
|
for label, pat in (("double 0.95", struct.pack("<d", 0.95)),
|
|
("double 0.05", struct.pack("<d", 0.05)),
|
|
("float 0.95f", struct.pack("<f", 0.95)),
|
|
("float 0.05f", struct.pack("<f", 0.05))):
|
|
hits = find_all(pat, blocks=(".rdata", ".data"))
|
|
print(f" {label:12s} {[hex(h) for h in hits[:10]] or 'ABSENT'}")
|
|
for h in hits[:6]:
|
|
xs = xrefs_to(h)
|
|
for x in xs[:4]:
|
|
print(f" used at 0x{x[0]:x} in {x[2]} (entry 0x{x[3]:x})")
|
|
|
|
print()
|
|
print("=" * 78)
|
|
print("== functions using BOTH 95 (or 5) and 100 as immediates — integer fee math")
|
|
print("=" * 78)
|
|
found = []
|
|
for f in fm.getFunctions(True):
|
|
ent = int(f.getEntryPoint().getOffset())
|
|
vals = set()
|
|
it = listing.getInstructions(f.getBody(), True)
|
|
while it.hasNext():
|
|
ins = it.next()
|
|
if ins.getMnemonicString() not in ("IMUL", "MOV", "CMP", "ADD", "SUB", "LEA", "SHL"):
|
|
continue
|
|
for i in range(ins.getNumOperands()):
|
|
for o in ins.getOpObjects(i):
|
|
try:
|
|
v = int(o.getValue())
|
|
except Exception:
|
|
continue
|
|
if v in (95, 100, 5, 20):
|
|
vals.add(v)
|
|
if 100 in vals and (95 in vals or 5 in vals):
|
|
found.append((ent, f.getName(), sorted(vals)))
|
|
print(f" {len(found)} candidate(s)")
|
|
for ent, nm, vals in found[:40]:
|
|
print(f" 0x{ent:x} {nm:26s} immediates {vals}")
|