Drop-Copy Lag & Phantom Residual Slippage Playbook

2026-03-15 · finance

Drop-Copy Lag & Phantom Residual Slippage Playbook

Why this matters

Some execution stacks treat drop-copy as the source of truth for fills/positions during live slicing. When drop-copy lags (or arrives out of order), the router can hallucinate residual quantity that is already filled, then submit extra child orders.

That creates a hidden slippage loop:

  1. perceived underfill ->
  2. unnecessary catch-up aggression ->
  3. overfill unwind / hedge churn ->
  4. extra spread + impact + fee drag.

This is not classic market impact. It is a state-consistency tax.


Failure pattern (execution branch view)

At each decision point for parent order P:

If delta > 0, strategy believes it is underfilled and over-trades.

Expected incremental cost from hallucinated residual:

E[ExtraCost] = E[ delta * (spread + impact + urgency_penalty) ] + E[unwind_cost]

The worst tails appear near deadlines (close, auction cutoff, schedule end), where urgency multipliers are steep.


Core metrics

1) Drop-Copy Delay Quantile (DCDQ)

DCDQ_p95 = p95( t_dropcopy_fill - t_true_fill )

Track by venue, symbol-liquidity bucket, and time-of-day regime.

2) Phantom Residual Ratio (PRR)

PRR = sum(max(Q_seen - Q_true, 0)) / sum(parent_qty)

Measures how much parent size was falsely considered "remaining".

3) Catch-up Overshoot Ratio (COR)

COR = sum(overfill_qty_due_to_state_lag) / sum(parent_qty)

Quantifies over-trading induced by stale execution state.

4) Reconciliation Shock Cost (RSC)

RSC = unwind_cost + forced_hedge_adjustment_cost

Use arrival-to-unwind and markout-adjusted accounting.

5) State Divergence Half-life (SDH)

Median time from divergence detection (Q_seen != Q_true) to restored consistency.


Modeling framework

A) Two-layer state model

Model P(divergence | latency, venue, load, message_rate, reconnect_state) and E[cost | divergence].

B) Tail-first objective

Do not optimize only mean bps.

Use:

J = E[slippage] + lambda1 * q95(slippage) + lambda2 * RSC

Because divergence events are sparse but expensive.

C) Deadline interaction term

Include time_to_deadline interaction:

cost ~ divergence * f(time_to_deadline)

This captures convex urgency tax when stale state persists late.


Execution controller (state machine)

STATE 1: SYNCED

Criteria:

Policy:

STATE 2: UNCERTAIN

Criteria:

Policy:

STATE 3: DEGRADED

Criteria:

Policy:

STATE 4: SAFE_RECONCILE

Criteria:

Policy:


Practical guardrails

  1. Confidence-weighted residual

    • Use Q_effective = w * Q_seen + (1-w) * Q_conservative
    • Decrease w as DCDQ/PRR worsens.
  2. Dual-feed sanity checks

    • Compare gateway-native execution view vs drop-copy view.
    • Trigger degraded state if disagreement persists beyond tolerance.
  3. Reconciliation cadence by regime

    • Tighten cadence around open/close/auction windows.
  4. Replayable incident packet

    • Persist event timeline: send, ACK, fill, drop-copy arrival, decision.
    • Needed for root-cause attribution and model recalibration.
  5. No blind urgency under uncertainty

    • If state confidence falls, urgency multiplier must saturate (hard cap).

Validation plan

Offline

Shadow live

Canary


Operator checklist


Bottom line

When fill state is delayed, execution can pay a phantom residual tax that looks like random market noise. Treat drop-copy lag as a first-class risk factor, model it explicitly, and bind urgency to state confidence.

That is how you reduce tail slippage without sacrificing completion discipline.