Function run_promote 

pub async fn run_promote<Q, S>(
    fork: &Q,
    primary: &Q,
    primary_tx: &S,
    patterns: &[PromotePattern],
) -> Result<PromoteReport>
where
    Q: ForkQueryHost + ?Sized,
    S: ForkPromoteSink + ?Sized,

Scan a fork session for matches per pattern, then bulk-insert the matched vertices on primary (deduplicated by content-derived UID) and edges (deduplicated by (src_uid, dst_uid, edge_type)).

Edges whose endpoints don’t exist on primary by UID are skipped and counted in edges_skipped_no_endpoint — promote the missing vertices first via a vertex pattern, then re-run.

If the call contains no edge patterns, incidental edges on the fork are counted in edges_skipped and a tracing warning is emitted.