A Deterministic Runtime for Grok-1: Static Plan Compiler + 100× Reproducibility Test #437
yuer-dsl
started this conversation in
Show and tell
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Hi everyone 👋
I’ve been experimenting with ways to make multi-step Grok-1 reasoning fully deterministic,
especially for cases where reproducibility, auditing, or long-term replayability matter.
To explore this, I built a small open-source project:
➡ deterministic-grok-runtime
https://github.com/yuer-dsl/deterministic-grok-runtime
🔒 What it does
This project compiles a YAML reasoning chain into a static, deterministic execution plan:
temperature = 0top_p = 1.0The goal is simple:
It’s a minimal demonstration of how probabilistic LLM behavior can be wrapped inside a deterministic layer.
🧩 Features
.yaml → .compiled.yaml)Everything is framework-neutral; the runtime currently uses a small stub but can be connected to:
🧪 What the reproducibility test does
The script runs the same compiled plan 100 times:
Beta Was this translation helpful? Give feedback.
All reactions