Unverified
2026
Levin-Bit Prompt Scoring
Rank candidate prompts, demonstrations, critiques, or system instructions by how many bits of reproduction cost they save for a specified artifact distribution. Replace raw prompt-token heuristics with a paired score that rewards both higher success probability and lower generation computation, then train or retrieve prompts maximizing this score under a token budget.
Paper: The Value of a Prompt: An LLM-Relative Kolmogorov-Complexity Approach
arXiv:2608.16438