Character Prefix Conditioning

Introduced and described the algorithm for character prefix conditioning, which enables language models to generate code completions that precisely start with the user's typed characters, addressing the challenge of tokenization boundaries. This algorithm allows sampling from a distribution conditional on a character prefix, rather than a token prefix, by defining a new distribution q(s) = p(s | s starts with P) and outlining the process for autoregressive sampling from this distribution.