Small decisions. Interesting possibilities.Submit contentSubmit

Writing one character at a time

i made an llm from first principles with Jev 29 yes/no questions per character: should the next key be a–z, space, comma, or period? highest probability gets append to it, then fed the updated text back in & repeat an autoregressive loop made out of a classifier

Added to Jevfast

How it uses Jev

The system asks 29 yes-or-no questions per character to decide whether the next character is a letter, space, comma, or period. It appends the highest-probability candidate and feeds the updated text back into the autoregressive loop.

App workflow

  1. Ask character questions

    For each character, 29 yes-or-no questions evaluate candidate next keys: a–z, space, comma, or period.

  2. Select a candidate

    The system chooses the candidate with the highest probability.

  3. Append and repeat

    It appends the character, feeds the updated text back in, and repeats.

Why it is interesting

It constructs text through repeated binary judgments over next-character candidates, with the evolving text becoming context for the following character.