Open
Description
Let's represent the described protocol as a simplified finite state machine (FSM). Here are the states and transitions:
-
State 1: Initial
- Initial state where the conversation begins.
- Transition: Triggered by the Prover's input, moves to State 2.
-
State 2: LLM Token Generation
- LLM continuously generates tokens based on the predefined grammar.
- Transition: Triggered by the Prover issuing a "stop" command, moves to State 3.
-
State 3: Prover's Input
- Prover provides input or "proof" for the LLM's generated tokens.
- Transition: Moves back to State 2 for the LLM to continue generating, or if conversation ends, moves to State 4.
-
State 4: End
- Conversation ends.
This FSM captures the cyclic nature of the conversation, with the Prover initiating and stopping the LLM's token generation. It repeats until a conclusive end state.