Prefix Scoring: Definitions, Methods, and Applications

• Prefix scoring is the evaluation of an initial sequence segment to estimate, rank, constrain, or optimize subsequent behavior, with uses ranging from binary-word analysis and jumbled pattern matching to SQL prediction and language-model reasoning.
• In combinatorics on words, prefix scores are compared with the maximum score of same-length factors, defining prefix-normal words and forms that compactly encode substring bounds and support constant-time binary jumbled-pattern queries after preprocessing.
• In forecasting and AI systems, prefix scores guide threshold decisions, early translation, reasoning-trace selection, safety detection, adaptive multimodal weighting, and retrieval beam retention, but they serve as heuristics or objective-specific signals rather than universal guarantees of correctness.

Prefix scoring is the evaluation of a sequence, partial sequence, or sequence position by a quantity associated with its prefix. Across research areas, the term denotes several related operations: comparing a prefix score with the best score of same-length substrings; evaluating nested threshold events; measuring how early an intended output becomes identifiable; weighting or selecting partial generation trajectories; or determining whether an intermediate representation should receive task-specific information. The common principle is that information available in an initial segment is used to estimate, constrain, rank, or optimize subsequent behavior.

1. Formal foundations in binary words

In combinatorics on words, prefix scoring is defined over a binary word $w=w_1w_2\cdots w_n\in\{0,1\}^n$ using the number of occurrences of $1$. The prefix-ones score is

$p_w(i)=|\operatorname{pref}_i(w)|_1,$

where $\operatorname{pref}_i(w)$ is the prefix of length $i$. The corresponding maximum-factor score is

$f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$

where $\operatorname{Fact}_i(w)$ is the set of contiguous factors of length $i$. The prefix is optimal at length $i$ precisely when $p_w(i)=f_w(i)$.

A binary word is prefix normal with respect to $1$0 if

$1$1

for every $1$2. Equivalently, no factor of length $1$3 contains more $1$4s than the prefix of that length. Prefix normality with respect to $1$5 is defined analogously by exchanging the roles of $1$6 and $1$7.

For example, in $1$8, the length-three prefix is $1$9, containing one $p_w(i)=|\operatorname{pref}_i(w)|_1,$0, whereas the factor $p_w(i)=|\operatorname{pref}_i(w)|_1,$1 contains two. Consequently,

$p_w(i)=|\operatorname{pref}_i(w)|_1,$2

and the word is not prefix normal. The factor $p_w(i)=|\operatorname{pref}_i(w)|_1,$3 is responsible for the violation. A prefix-normal example is $p_w(i)=|\operatorname{pref}_i(w)|_1,$4, for which

$p_w(i)=|\operatorname{pref}_i(w)|_1,$5

The difference

$p_w(i)=|\operatorname{pref}_i(w)|_1,$6

measures the failure of prefix optimality at length $p_w(i)=|\operatorname{pref}_i(w)|_1,$7. Full prefix normality is equivalent to $p_w(i)=|\operatorname{pref}_i(w)|_1,$8. This supplies a direct formal model for binary prefix scoring: $p_w(i)=|\operatorname{pref}_i(w)|_1,$9 is the designated prefix score, while $\operatorname{pref}_i(w)$0 is the best score attainable by any same-length window (Burcsi et al., 2014, Adamson et al., 27 Aug 2025).

Run-length characterization

Suppose a positive-density binary word begins with $\operatorname{pref}_i(w)$1 and is represented as

$\operatorname{pref}_i(w)$2

where $\operatorname{pref}_i(w)$3 are distances between consecutive $\operatorname{pref}_i(w)$4s. Prefix normality is equivalent to requiring that, for every number $\operatorname{pref}_i(w)$5 of $\operatorname{pref}_i(w)$6s, one of the shortest factors containing exactly $\operatorname{pref}_i(w)$7 $\operatorname{pref}_i(w)$8s is a prefix. In run-length form, this requires

$\operatorname{pref}_i(w)$9

for every admissible $i$0 and $i$1.

Thus, the prefix must accumulate any specified number of $i$2s no later than every other region of the word. This characterization converts a window-scoring condition into inequalities over distances between successive score-bearing symbols.

Prefix normal forms

For a word $i$3, define two words to be prefix-normal equivalent with respect to $i$4 if they have identical maximum-factor scores at every length. Every equivalence class has a unique prefix-normal representative, the prefix normal form $i$5. It satisfies

$i$6

where $i$7 is the number of $i$8s in the prefix of length $i$9, and $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$0 is the maximum number of $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$1s in any factor of length $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$2.

The $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$3th bit of the prefix normal form is

$f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$4

Consequently, the entire sequence of optimal same-length substring scores is encoded as a single binary word. The zero-oriented form $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$5 is defined analogously and represents the lower boundary of the corresponding Parikh set.

2. Prefix scoring and jumbled pattern matching

Binary jumbled pattern matching asks whether a word contains a factor with prescribed numbers of $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$6s and $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$7s, without regard to their order. For a fixed length $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$8, the set of achievable numbers of $f_w(i)=\max_{u\in\operatorname{Fact}_i(w)}|u|_1,$9s has the interval property: if two length-$\operatorname{Fact}_i(w)$0 factors contain $\operatorname{Fact}_i(w)$1 and $\operatorname{Fact}_i(w)$2 ones with $\operatorname{Fact}_i(w)$3, then every intermediate value is also realized.

Therefore, the Parikh set can be represented by its minimum and maximum number of $\operatorname{Fact}_i(w)$4s for each length:

$\operatorname{Fact}_i(w)$5

The upper boundary is encoded by $\operatorname{Fact}_i(w)$6, while the lower boundary can be obtained from $\operatorname{Fact}_i(w)$7 because maximizing the number of $\operatorname{Fact}_i(w)$8s is equivalent to minimizing the number of $\operatorname{Fact}_i(w)$9s.

A binary jumbled-pattern query asking whether a length-$i$0 factor contains exactly $i$1 ones can consequently be answered by checking

$i$2

The prefix normal form is therefore a linear-size index for all length-dependent extremal substring scores. Earlier work cited in the literature establishes that, once the relevant form is known, binary jumbled pattern matching queries can be answered in $i$3 time. Direct computation of all factor maxima requires quadratic time in general, motivating efficient algorithms for testing and constructing prefix normal forms (Burcsi et al., 2014, Adamson et al., 27 Aug 2025).

The structural status of prefix-normal words includes several established properties. Every prefix of a prefix-normal word is prefix normal, and appending $i$4 preserves prefix normality. Prefix-normal words form a bubble language, are pre-necklaces, and are not context-free. A Gray-code generation algorithm has amortized $i$5 time per generated word, while a closed-form counting formula and general generating function remain unknown (Adamson et al., 27 Aug 2025).

The number $i$6 of prefix-normal binary words of length $i$7 satisfies the bounds

$i$8

for some $i$9, and

$i$0

Thus, prefix-normal words are exponentially numerous but form a vanishing fraction of all binary words. The stronger asymptotic form

$i$1

is reported as known in later work, whereas conjectures concerning extension-critical words and related enumeration behavior remain explicitly conjectural in the earlier study (Burcsi et al., 2014, Adamson et al., 27 Aug 2025).

3. Testing, witnesses, and generation

Prefix-normality can be tested directly by computing the prefix score and maximum same-length factor score for every length. With prefix sums for constant-time window counts, ordinary window enumeration gives an $i$2 test. The procedure can terminate as soon as a length $i$3 is found for which

$i$4

A more specialized swap-sequence algorithm begins with the density-sorted word

$i$5

and repeatedly moves the next $i$6 toward its position in the target word. The resulting sequence is

$i$7

A lemma states that $i$8 is prefix normal if and only if every intermediate $i$9 is prefix normal. Each transition has the form

$p_w(i)=f_w(i)$0

The relevant test can be reduced to a critical length $p_w(i)=f_w(i)$1, and the worst-case running time remains $p_w(i)=f_w(i)$2. An iterated-prefix variant tests prefixes of lengths

$p_w(i)=f_w(i)$3

so that a short violating prefix can establish failure early. Its worst-case complexity is also $p_w(i)=f_w(i)$4.

Linear-time filters provide inexpensive rejection conditions. A prefix-normal word must have its longest run of $p_w(i)=f_w(i)$5s at the beginning. A second filter uses maximal blocks of the form $p_w(i)=f_w(i)$6 and rejects a word when a short combination of consecutive blocks contains more $p_w(i)=f_w(i)$7s than the critical prefix. The resulting tester, called $p_w(i)=f_w(i)$8, applies linear filters before the quadratic test. Its average $p_w(i)=f_w(i)$9 behavior is presented as empirical or conjectural rather than as a proven worst-case guarantee (Burcsi et al., 2014).

Minimal violation structure

If a factor $1$00 of minimum length violates prefix normality, then $1$01 begins and ends in $1$02. Removing a leading or trailing $1$03 would preserve its number of $1$04s while shortening it. Such a shortest witness satisfies

$1$05

A difference of two or more would allow the final symbol to be removed while retaining a violation. A responsible factor also cannot begin inside the initial block of $1$06s, because shifting it toward the beginning cannot decrease its score relative to the corresponding prefix.

These results restrict the candidate windows that need to be examined. The number of all factor occurrences is at most

$1$07

whereas the number of factor occurrences whose endpoints are both $1$08 is reported as

$1$09

The later word-chain framework uses these structural facts to relate prefix-normal words that differ at a single position.

Word chains

For fixed length $1$10, consider the graph whose vertices are all binary words and whose edges connect words at Hamming distance one. A word-chain generator is an ordering of positions that changes one $1$11 to $1$12 at each step, producing a chain from $1$13 to $1$14. If $1$15 is a permutation of $1$16, the chain is generated recursively by

$1$17

A prefix-normal word chain is one in which every member is prefix normal. Its generator must satisfy

$1$18

and

$1$19

If two adjacent generator entries form an increasing pair, swapping them always preserves prefix normality. For a decreasing pair, preservation depends on the existence of a factor satisfying positional, length, and score conditions relative to the intermediate word. The resulting swap test examines candidate factors and has a worst-case triangular bound stated as

$1$20

This establishes a fixed-length perspective on enumeration: one generator describes many words, while admissible adjacent swaps describe local relationships among such descriptions (Adamson et al., 27 Aug 2025).

4. Nested-threshold and categorical prefix scores

In ordered categorical forecasting, prefix scoring is applied to nested threshold events rather than binary-string positions. Let thresholds satisfy

$1$21

They define ordered categories $1$22 and nested exceedance events

$1$23

The FIRM framework scores an issued category by decomposing it into binary decisions at every threshold. For threshold $1$24, the event is

$1$25

The elementary asymmetric score is

$1$26

The multicategory score is the weighted sum

$1$27

where $1$28 determines the importance of threshold $1$29, and $1$30 controls the miss-to-false-alarm ratio. The associated fixed event probability is $1$31. A threshold should be exceeded when

$1$32

For forecast category $1$33 and observed category $1$34, the score is

$1$35

A categorical error accumulates penalties over every threshold crossed. Under-prediction and over-prediction can have different costs, while distinct thresholds can receive different weights.

The framework is prefix-decomposable because the issued category implies a nested binary forecast:

$1$36

The realized score is therefore a weighted sum of asymmetric penalties over nested prefixes. However, basic FIRM does not directly score a vector of cumulative probabilities. Cumulative probabilities enter the optimal category-selection directive, whereas the realized score compares the issued category and observation.

The near-miss extension replaces threshold-crossing penalties by capped distance-weighted penalties:

$1$37

At $1$38, the score is fully distance-weighted. The associated point functional changes from an $1$39-quantile at $1$40 to a Huber quantile for finite $1$41, and to an $1$42-expectile at $1$43. At $1$44 and $1$45, the functional is the mean. The near-miss score requires real-valued observations and generally cannot be represented by a category-only scoring matrix (Taggart et al., 2021).

FIRM differs from Brier, logarithmic, and ranked probability scores because its basic form evaluates a categorical decision rather than a full probability vector. Its principal theoretical result is consistency for the fixed-risk quantile directive under positive threshold weights. It does not establish universal calibration or universal ranking superiority over alternative scores.

5. Prefixes in interactive generation and simultaneous translation

In prefix-to-SQL generation, the prefix is an incomplete natural-language question. Given a database schema $1$46 and a question prefix $1$47, the system generates or retrieves a ranked list of SQL suggestions. A prefix can correspond to multiple complete questions and therefore multiple gold SQL queries.

The principal prefix-oriented metric is Save@K, which measures how much of the complete question need not be typed before a correct SQL query appears among the top-$1$48 suggestions. If the earliest successful prediction occurs after $1$49 tokens of a complete question of length $1$50, then

$1$51

If no correct SQL query is produced at any prefix, Save is zero. A correct prediction only at the complete question also yields zero saving. Save differs from Recall, which measures coverage of gold SQL alternatives, and MRR, which measures the rank of the first correct SQL query. It is an interaction-cost metric based on the earliest successful prefix (Deng et al., 2021).

The PAGSAS benchmark contains approximately $1$52 question-prefix examples from Advising, ATIS, GeoQuery, Scholar, and Spider. Prefix-to-SQL difficulty is strongly related to omitted-token count: more omitted tokens generally imply lower Recall. The benchmark evaluates generative and retrieval models, including T5, Pf-S2S variants, QAC-S2S, Emb-Rtr, and Cls-Rtr. Curriculum learning exposes models first to nearly complete questions and progressively introduces more incomplete prefixes. The reported improvements are substantial on several subtasks, including approximately nine percentage points of Recall on SQL-query-split GeoQuery in the reported comparison, although gains are not universal.

Prefix-to-prefix translation

In simultaneous machine translation, the model must generate target tokens while only a source prefix is available. Prefix-to-prefix training can be problematic when source and target word orders differ. A target token may appear early in the reference even though the source information supporting it occurs later, creating an incentive for premature prediction and hallucination.

CBSiMT computes probabilities for multiple source-prefix lengths and target positions. The resulting confidence matrix contains

$1$53

where $1$54 is the amount of source read and $1$55 is the target position. Upper-right positions, with small $1$56 and large $1$57, correspond to anticipation; lower-left positions correspond to excessive latency.

The token-level weight is

$1$58

where

$1$59

The sentence-level weight $1$60 reduces the influence of sentence pairs whose confidence pattern indicates substantial reordering. The weighted loss is

$1$61

Thus, prefix scoring is used to identify whether a target prediction is both probable and appropriately aligned with the amount of source context available. The method does not treat every low-confidence token as semantically hallucinated; confidence is used as a proxy for prefix support. Experiments on MuST-C English-to-Chinese and WMT15 German-to-English report improvements of up to approximately two BLEU points in low-latency regimes and lower hallucination ratios at comparable latency (Liu et al., 2023).

6. Prefix scoring for language-model reasoning and safety

For autoregressive LLMs, a prefix is the prompt together with the response tokens generated so far. Prefix scoring can estimate future success, rank partial trajectories, or determine whether a candidate should be continued.

Prefix-confidence selection

Prefix-confidence scaling samples several reasoning prefixes, scores them using the model’s own token probabilities, retains the highest-confidence prefix, and continues only that prefix. For a prefix $1$62,

$1$63

With candidate prefixes $1$64, the selected prefix is

$1$65

The main experiments use $1$66 tokens and $1$67. Unlike Best-of-$1$68, which generates and scores complete responses, prefix-confidence scaling evaluates multiple short prefixes and performs only one full continuation. Equal prefix lengths reduce direct variation in sequence length and therefore reduce susceptibility to the length bias affecting full-sequence likelihood selection.

On GSM8K, MATH500, AMC23, AIME24, and AIME25, prefix-confidence scaling improves the accuracy-compute trade-off relative to majority voting and Best-of-$1$69. For example, PC@16 with self-confidence reaches average accuracy $1$70 at $1$71 seconds, whereas majority voting with eight full attempts reaches $1$72 at $1$73 seconds. These results support prefix confidence as a ranking heuristic, not as a calibrated correctness certificate (Otth et al., 24 Jul 2025).

Prefix values and temporal differences

IPVRM directly estimates the eventual success probability of a partial reasoning state:

$1$74

This differs from an implicit token reward, whose token-level decomposition is only indirectly constrained by a terminal label. The local reinforcement-learning signal is the temporal difference

$1$75

for nonterminal steps with $1$76. A positive difference means that appending the token increases predicted prospects of eventual correctness; a negative difference means that the prefix becomes less promising.

The value $1$77 is a state-level prediction, not a guarantee that the immediately preceding reasoning step is locally correct. The paper reports weak correlation between one-step TD and final outcome, with Pearson correlation $1$78, while accumulated prefix values achieve AUC-ROC $1$79. This supports interpreting TD as a local optimization signal rather than a direct long-horizon correctness estimate.

IPVRM supplies prefix scores for ProcessBench step verification, Best-of-$1$80 reranking, candidate-token selection, and Distribution-Level RL. DistRL evaluates sampled tokens and high-probability alternative tokens using prefix-value differences, providing counterfactual updates without completing a separate rollout for every candidate. On Qwen3-0.6B, IPVRM achieves average ProcessBench F1 of $1$81, compared with approximately $1$82 for DPO-RM and Implicit PRM. DistRL combined with IPVRM reaches average downstream performance $1$83, compared with $1$84 for PRIME and $1$85 for SPRO (Gao et al., 14 Apr 2026).

Prefix gain and utility

The Prefix Utility Model evaluates a prefix by its marginal effect on solve probability rather than by local step correctness. For student model $1$86,

$1$87

where $1$88 is the probability that the student solves problem $1$89 after receiving prefix $1$90, and $1$91 is its no-prefix solve probability.

The main scalar target averages normalized gains across six lightweight student models:

$1$92

PUM is trained with a Bradley–Terry-style pairwise ranking loss over prefixes from the same problem. It can score partial trajectories, complete responses, beam-search states, and nested prefixes for reinforcement-learning credit assignment.

In beam search, PUM scores each partial trajectory by $1$93 and retains the highest-scoring unfinished prefixes. Reported results show increasing advantages over PRM, PQM, and CRM as candidate pools grow. At beam-search budget $1$94, PUM reaches $1$95 on MATH500 with Qwen2.5-3B and $1$96 with Llama-3.1-8B. In reinforcement learning, PUM+GRPO reaches average accuracy $1$97, compared with $1$98 for vanilla GRPO.

Prefix gain is not identical to correctness or value. It estimates the marginal improvement induced by conditioning on a prefix. This distinction permits a locally nonstandard or incomplete prefix to receive a high score if it improves downstream solvability, while a locally correct but strategically unhelpful step can receive a lower utility score (Zhou et al., 5 Jun 2026).

Prefix probing for safety detection

Prefix Probing uses a target LLM’s conditional probabilities for two classes of response openings: agreement or execution prefixes $1$99, and refusal or safety prefixes $p_w(i)=|\operatorname{pref}_i(w)|_1,$00. For a prompt $p_w(i)=|\operatorname{pref}_i(w)|_1,$01, the refusal and agreement scores are average per-token log-probabilities:

$p_w(i)=|\operatorname{pref}_i(w)|_1,$02

$p_w(i)=|\operatorname{pref}_i(w)|_1,$03

The harmfulness score is

$p_w(i)=|\operatorname{pref}_i(w)|_1,$04

and classification uses

$p_w(i)=|\operatorname{pref}_i(w)|_1,$05

Prefix discovery is performed offline with a beam search over token sequences, selecting prefixes that maximize the absolute benign-versus-harmful probability separation. Prefix caching reuses the key-value states of the base prompt, reducing the additional computation required to evaluate probe prefixes.

Across eight open-source models and five harmful-content datasets, Prefix Probing achieves F1 between $p_w(i)=|\operatorname{pref}_i(w)|_1,$06 and $p_w(i)=|\operatorname{pref}_i(w)|_1,$07 in the reported model averages and exceeds $p_w(i)=|\operatorname{pref}_i(w)|_1,$08 of the prompt-based upper bound for every evaluated model. Cached probe overheads range from approximately $p_w(i)=|\operatorname{pref}_i(w)|_1,$09 to $p_w(i)=|\operatorname{pref}_i(w)|_1,$10 seconds. The method detects risk but does not enforce a safe response: the paper reports that approximately $p_w(i)=|\operatorname{pref}_i(w)|_1,$11 of harmful prompts in a supplementary experiment were recognized as harmful while still producing toxic responses during unconstrained generation (Yang et al., 18 Dec 2025).

7. Prefix weighting and retention in multimodal systems

Prefix scoring also governs how task-specific information is allocated across input tokens in vision-LLMs. Dynamic Prefix Weighting assigns token-, head-, prefix-, and layer-dependent weights to task-specific prefixes and adapters.

Reparameterized Prefix Attention computes prefix scores directly from an input token $p_w(i)=|\operatorname{pref}_i(w)|_1,$12:

$p_w(i)=|\operatorname{pref}_i(w)|_1,$13

For input token $p_w(i)=|\operatorname{pref}_i(w)|_1,$14, attention head $p_w(i)=|\operatorname{pref}_i(w)|_1,$15, and prefix $p_w(i)=|\operatorname{pref}_i(w)|_1,$16, the score is $p_w(i)=|\operatorname{pref}_i(w)|_1,$17. Conditional Activation converts these scores into nonnegative weights. If $p_w(i)=|\operatorname{pref}_i(w)|_1,$18 denotes sigmoid activation, the conditional normalization is

$p_w(i)=|\operatorname{pref}_i(w)|_1,$19

Thus,

$p_w(i)=|\operatorname{pref}_i(w)|_1,$20

Weak contributions can be removed by adaptive filtering. The residual weighting mechanism assigns excess raw activation to an adapter:

$p_w(i)=|\operatorname{pref}_i(w)|_1,$21

The prefix output and adapter output are then combined as

$p_w(i)=|\operatorname{pref}_i(w)|_1,$22

$p_w(i)=|\operatorname{pref}_i(w)|_1,$23

$p_w(i)=|\operatorname{pref}_i(w)|_1,$24

The prefix contribution is bounded, while the adapter is activated only when raw prefix activation exceeds one. This distinguishes DPW from fixed-sum softmax weighting, which forces every token to receive the same total prefix mass. Reported experiments on domain-class incremental learning with CLIP ViT-B/16 show improvements in transfer and continual-learning metrics. On MTIL Order I, the full model obtains Transfer $p_w(i)=|\operatorname{pref}_i(w)|_1,$25, Avg. $p_w(i)=|\operatorname{pref}_i(w)|_1,$26, Last $p_w(i)=|\operatorname{pref}_i(w)|_1,$27, and Mean $p_w(i)=|\operatorname{pref}_i(w)|_1,$28; on ODCL-CIL Order I, it obtains Transfer $p_w(i)=|\operatorname{pref}_i(w)|_1,$29, Avg. $p_w(i)=|\operatorname{pref}_i(w)|_1,$30, Last $p_w(i)=|\operatorname{pref}_i(w)|_1,$31, and Mean $p_w(i)=|\operatorname{pref}_i(w)|_1,$32 (Jang et al., 20 Apr 2026).

A different prefix-retention problem arises in multimodal generative retrieval. Items receive residual-quantization identifiers $p_w(i)=|\operatorname{pref}_i(w)|_1,$33, which are decoded by trie-constrained beam search. A complete identifier can have good reconstruction quality while an intermediate prefix receives a low score and is irreversibly pruned. Prefix Retention Optimization addresses this indexing-decoding gap through three mechanisms:

1. Prefix ranking distillation aligns quantized partial-reconstruction rankings with rankings induced by pre-quantization embeddings.
2. Vocabulary scheduling uses smaller shallow codebooks and larger deeper codebooks to increase the teacher margin against competing early prefixes.
3. Geometric score fusion adds query–codeword compatibility to decoder log-probabilities during beam search.

The survival condition is expressed using ranking divergence $p_w(i)=|\operatorname{pref}_i(w)|_1,$34, teacher margin $p_w(i)=|\operatorname{pref}_i(w)|_1,$35, and decoder mismatch $p_w(i)=|\operatorname{pref}_i(w)|_1,$36. If, at every level,

$p_w(i)=|\operatorname{pref}_i(w)|_1,$37

the target prefix remains in the beam through all levels.

The fused child score is

$p_w(i)=|\operatorname{pref}_i(w)|_1,$38

where $p_w(i)=|\operatorname{pref}_i(w)|_1,$39 is the decoding residual. The geometric term measures the reduction in squared distance to the query caused by appending codeword $p_w(i)=|\operatorname{pref}_i(w)|_1,$40.

On nine multimodal retrieval tasks, PRO improves over GENIUS on every task. On COCO text-to-image, Recall@1 rises from $p_w(i)=|\operatorname{pref}_i(w)|_1,$41 for GENIUS to $p_w(i)=|\operatorname{pref}_i(w)|_1,$42 for PRO, and Recall@5 from $p_w(i)=|\operatorname{pref}_i(w)|_1,$43 to $p_w(i)=|\operatorname{pref}_i(w)|_1,$44. On Flickr30k text-to-image, Recall@1 rises from $p_w(i)=|\operatorname{pref}_i(w)|_1,$45 to $p_w(i)=|\operatorname{pref}_i(w)|_1,$46, and Recall@5 from $p_w(i)=|\operatorname{pref}_i(w)|_1,$47 to $p_w(i)=|\operatorname{pref}_i(w)|_1,$48. The reported results support the interpretation that prefix discriminability must be optimized during both indexing and decoding, because later identifier information cannot repair an identifier prefix that has already been pruned (Chen et al., 8 Jun 2026).

Across these applications, prefix scoring has a consistent systems-level role: it determines whether an initial segment is sufficiently informative, useful, aligned, safe, or discriminative to justify continued computation. The particular score may be a count, a window maximum, a risk-weighted threshold penalty, a likelihood gap, a future-success value, a counterfactual solve-rate gain, a token-dependent adaptation weight, or a query-conditioned geometric score. The shared methodological issue is the relationship between local prefix evidence and downstream objective quality.