Spaces:
Sleeping
Sleeping
Update app.py
Browse files
app.py
CHANGED
|
@@ -1,117 +1,379 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
import time
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 2 |
import numpy as np
|
| 3 |
import gradio as gr
|
| 4 |
-
import platform
|
| 5 |
-
import psutil
|
| 6 |
|
| 7 |
-
#
|
| 8 |
-
|
| 9 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 10 |
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
|
| 14 |
-
drive = np.tanh(phase)
|
| 15 |
-
Psi = 0.999 * Psi + 0.001 * drive
|
| 16 |
-
E = 0.995 * E + 0.004 * Psi
|
| 17 |
-
L = 0.998 * L + 0.001 * (Psi * E)
|
| 18 |
-
return Psi, E, L
|
| 19 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 20 |
|
| 21 |
-
def
|
| 22 |
-
|
| 23 |
-
den = (np.linalg.norm(prev) * np.linalg.norm(curr)) + 1e-9
|
| 24 |
-
return float(num / den)
|
| 25 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 26 |
|
| 27 |
-
|
| 28 |
-
|
| 29 |
-
|
|
|
|
|
|
|
| 30 |
|
| 31 |
-
|
| 32 |
-
|
| 33 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 34 |
|
| 35 |
-
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 39 |
|
| 40 |
-
|
| 41 |
-
|
|
|
|
|
|
|
|
|
|
| 42 |
|
| 43 |
-
|
|
|
|
|
|
|
| 44 |
|
|
|
|
| 45 |
for _ in range(steps):
|
| 46 |
-
Psi, E, L =
|
|
|
|
| 47 |
|
| 48 |
-
|
| 49 |
-
|
| 50 |
|
| 51 |
-
|
| 52 |
-
|
|
|
|
| 53 |
|
| 54 |
-
|
| 55 |
-
|
| 56 |
|
| 57 |
return {
|
| 58 |
-
"
|
| 59 |
-
"
|
| 60 |
-
"
|
| 61 |
-
"
|
| 62 |
-
"
|
| 63 |
-
"
|
| 64 |
-
"
|
| 65 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 66 |
}
|
| 67 |
|
|
|
|
| 68 |
|
| 69 |
-
#
|
| 70 |
-
|
| 71 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 72 |
|
| 73 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 74 |
gr.Markdown(
|
| 75 |
"""
|
| 76 |
-
|
|
|
|
|
|
|
| 77 |
|
| 78 |
-
|
| 79 |
-
|
| 80 |
-
- No precomputed results
|
| 81 |
-
- No GPUs required
|
| 82 |
-
- Measures real throughput, stability, and energy behavior
|
| 83 |
|
| 84 |
-
|
| 85 |
-
|
| 86 |
|
| 87 |
-
|
|
|
|
| 88 |
"""
|
| 89 |
)
|
| 90 |
|
| 91 |
with gr.Row():
|
| 92 |
-
|
| 93 |
-
|
| 94 |
-
|
| 95 |
-
|
| 96 |
-
|
| 97 |
-
|
| 98 |
-
|
| 99 |
-
|
| 100 |
-
|
| 101 |
-
|
| 102 |
-
|
| 103 |
-
|
| 104 |
-
|
| 105 |
-
|
| 106 |
-
|
| 107 |
-
|
| 108 |
-
|
| 109 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 110 |
|
| 111 |
run_btn.click(
|
| 112 |
-
fn=
|
| 113 |
-
inputs=[
|
| 114 |
-
outputs=
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 115 |
)
|
| 116 |
|
| 117 |
-
|
|
|
|
|
|
| 1 |
+
# app.py
|
| 2 |
+
# Coherent_Compute_Engine — RFTSystems
|
| 3 |
+
# Real, on-machine benchmark + tamper-evident receipt download (SHA-256).
|
| 4 |
+
# Notes:
|
| 5 |
+
# - Runs on the Space runtime hardware (not the visitor's local machine).
|
| 6 |
+
# - “Item” = one per-oscillator state update of [Psi, E, L] per step.
|
| 7 |
+
|
| 8 |
+
import os
|
| 9 |
+
import json
|
| 10 |
import time
|
| 11 |
+
import math
|
| 12 |
+
import hashlib
|
| 13 |
+
import platform
|
| 14 |
+
import datetime as dt
|
| 15 |
+
from pathlib import Path
|
| 16 |
+
|
| 17 |
import numpy as np
|
| 18 |
import gradio as gr
|
|
|
|
|
|
|
| 19 |
|
| 20 |
+
# Optional: Numba baseline (will be used if available)
|
| 21 |
+
try:
|
| 22 |
+
import numba as nb
|
| 23 |
+
NUMBA_OK = True
|
| 24 |
+
except Exception:
|
| 25 |
+
nb = None
|
| 26 |
+
NUMBA_OK = False
|
| 27 |
|
| 28 |
+
APP_VERSION = "Coherent_Compute_Engine_v1.0.0"
|
| 29 |
+
RESULTS_DIR = Path("results")
|
| 30 |
+
RESULTS_DIR.mkdir(exist_ok=True)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 31 |
|
| 32 |
+
# ----------------------------
|
| 33 |
+
# Canonical JSON + integrity
|
| 34 |
+
# ----------------------------
|
| 35 |
+
def canon_json_bytes(obj) -> bytes:
|
| 36 |
+
return json.dumps(
|
| 37 |
+
obj,
|
| 38 |
+
ensure_ascii=False,
|
| 39 |
+
sort_keys=True,
|
| 40 |
+
separators=(",", ":"),
|
| 41 |
+
).encode("utf-8")
|
| 42 |
|
| 43 |
+
def sha256_hex(b: bytes) -> str:
|
| 44 |
+
return hashlib.sha256(b).hexdigest()
|
|
|
|
|
|
|
| 45 |
|
| 46 |
+
def write_receipt(payload: dict) -> str:
|
| 47 |
+
"""
|
| 48 |
+
Writes a JSON receipt to disk and returns the filepath for Gradio download.
|
| 49 |
+
Receipt contains its own SHA-256 hash (tamper-evident).
|
| 50 |
+
"""
|
| 51 |
+
# hash without integrity first
|
| 52 |
+
b0 = canon_json_bytes(payload)
|
| 53 |
+
h = sha256_hex(b0)
|
| 54 |
|
| 55 |
+
payload["integrity"] = {
|
| 56 |
+
"sha256": h,
|
| 57 |
+
"receipt_id": h[:12],
|
| 58 |
+
"canonical_json": "sorted_keys + compact_separators",
|
| 59 |
+
}
|
| 60 |
|
| 61 |
+
b1 = canon_json_bytes(payload)
|
| 62 |
+
ts = payload.get("timestamp_utc", dt.datetime.utcnow().isoformat() + "Z")
|
| 63 |
+
safe_ts = ts.replace(":", "").replace(".", "").replace("Z", "")
|
| 64 |
+
fname = f"receipt_{safe_ts}_{h[:12]}.json"
|
| 65 |
+
path = RESULTS_DIR / fname
|
| 66 |
+
path.write_bytes(b1)
|
| 67 |
+
return str(path)
|
| 68 |
|
| 69 |
+
# ----------------------------
|
| 70 |
+
# Core RFT-lite engine
|
| 71 |
+
# ----------------------------
|
| 72 |
+
def _np_step(Psi, E, L, scale=1.0):
|
| 73 |
+
# numerically tame, branchless-ish
|
| 74 |
+
phase = 0.997 * Psi + 0.003 * E
|
| 75 |
+
drive = np.tanh(phase * scale)
|
| 76 |
+
Psi_n = 0.999 * Psi + 0.001 * drive
|
| 77 |
+
E_n = 0.995 * E + 0.004 * Psi_n
|
| 78 |
+
L_n = 0.998 * L + 0.001 * (Psi_n * E_n)
|
| 79 |
+
return Psi_n, E_n, L_n
|
| 80 |
+
|
| 81 |
+
def coherence_abs(Psi0: np.ndarray, Psi1: np.ndarray) -> float:
|
| 82 |
+
# Normalized dot product (magnitude used)
|
| 83 |
+
# (If values are constant, den can go tiny — guard it.)
|
| 84 |
+
v0 = Psi0.astype(np.float64, copy=False)
|
| 85 |
+
v1 = Psi1.astype(np.float64, copy=False)
|
| 86 |
+
num = float(np.dot(v0, v1))
|
| 87 |
+
den = float(np.linalg.norm(v0) * np.linalg.norm(v1)) + 1e-12
|
| 88 |
+
return abs(num / den)
|
| 89 |
+
|
| 90 |
+
def mean_energy(E: np.ndarray) -> float:
|
| 91 |
+
# bounded to keep metric stable across runs
|
| 92 |
+
return float(np.mean(np.clip(E, 0.0, 1.5)))
|
| 93 |
|
| 94 |
+
def run_engine_numpy(n: int, steps: int, seed: int, scale: float):
|
| 95 |
+
rng = np.random.default_rng(seed)
|
| 96 |
+
Psi = rng.random(n, dtype=np.float32)
|
| 97 |
+
E = rng.random(n, dtype=np.float32)
|
| 98 |
+
L = rng.random(n, dtype=np.float32)
|
| 99 |
|
| 100 |
+
# capture Psi for coherence (small sample for speed)
|
| 101 |
+
sample = min(n, 200_000)
|
| 102 |
+
Psi0 = Psi[:sample].copy()
|
| 103 |
|
| 104 |
+
t0 = time.perf_counter()
|
| 105 |
for _ in range(steps):
|
| 106 |
+
Psi, E, L = _np_step(Psi, E, L, scale=scale)
|
| 107 |
+
t1 = time.perf_counter()
|
| 108 |
|
| 109 |
+
Psi1 = Psi[:sample].copy()
|
| 110 |
+
elapsed = t1 - t0
|
| 111 |
|
| 112 |
+
# “items” = per-oscillator update of [Psi,E,L] per step
|
| 113 |
+
items = int(n) * int(steps)
|
| 114 |
+
throughput_Bps = (items / elapsed) / 1e9
|
| 115 |
|
| 116 |
+
coh = coherence_abs(Psi0, Psi1)
|
| 117 |
+
eng = mean_energy(E[:sample])
|
| 118 |
|
| 119 |
return {
|
| 120 |
+
"engine": "numpy",
|
| 121 |
+
"oscillators": int(n),
|
| 122 |
+
"steps": int(steps),
|
| 123 |
+
"elapsed_s": float(elapsed),
|
| 124 |
+
"throughput_Bps": float(throughput_Bps),
|
| 125 |
+
"coherence_abs": float(coh),
|
| 126 |
+
"mean_energy": float(eng),
|
| 127 |
+
}
|
| 128 |
+
|
| 129 |
+
# ----------------------------
|
| 130 |
+
# Baselines (optional)
|
| 131 |
+
# ----------------------------
|
| 132 |
+
def run_baseline_python(n: int, steps: int, seed: int):
|
| 133 |
+
# Deliberately small n to avoid melting the Space.
|
| 134 |
+
n = min(n, 200_000)
|
| 135 |
+
rng = np.random.default_rng(seed)
|
| 136 |
+
Psi = rng.random(n).tolist()
|
| 137 |
+
E = rng.random(n).tolist()
|
| 138 |
+
L = rng.random(n).tolist()
|
| 139 |
+
|
| 140 |
+
def step(Psi, E, L):
|
| 141 |
+
outPsi = [0.0]*n
|
| 142 |
+
outE = [0.0]*n
|
| 143 |
+
outL = [0.0]*n
|
| 144 |
+
for i in range(n):
|
| 145 |
+
phase = 0.997*Psi[i] + 0.003*E[i]
|
| 146 |
+
drive = math.tanh(phase)
|
| 147 |
+
p = 0.999*Psi[i] + 0.001*drive
|
| 148 |
+
e = 0.995*E[i] + 0.004*p
|
| 149 |
+
l = 0.998*L[i] + 0.001*(p*e)
|
| 150 |
+
outPsi[i], outE[i], outL[i] = p, e, l
|
| 151 |
+
return outPsi, outE, outL
|
| 152 |
+
|
| 153 |
+
t0 = time.perf_counter()
|
| 154 |
+
for _ in range(min(steps, 10)): # hard cap for safety
|
| 155 |
+
Psi, E, L = step(Psi, E, L)
|
| 156 |
+
t1 = time.perf_counter()
|
| 157 |
+
elapsed = t1 - t0
|
| 158 |
+
|
| 159 |
+
items = int(n) * int(min(steps, 10))
|
| 160 |
+
throughput_Bps = (items / elapsed) / 1e9
|
| 161 |
+
|
| 162 |
+
# Coherence proxy (cheap)
|
| 163 |
+
Psi0 = np.array(Psi[:min(n, 50_000)], dtype=np.float32)
|
| 164 |
+
Psi1 = Psi0 # can't compare pre/post cheaply here without extra memory
|
| 165 |
+
coh = 1.0
|
| 166 |
+
eng = float(np.mean(np.clip(np.array(E[:min(n, 50_000)], dtype=np.float32), 0.0, 1.5)))
|
| 167 |
+
|
| 168 |
+
return {
|
| 169 |
+
"engine": "python_loop",
|
| 170 |
+
"oscillators": int(n),
|
| 171 |
+
"steps": int(min(steps, 10)),
|
| 172 |
+
"elapsed_s": float(elapsed),
|
| 173 |
+
"throughput_Bps": float(throughput_Bps),
|
| 174 |
+
"coherence_abs": float(coh),
|
| 175 |
+
"mean_energy": float(eng),
|
| 176 |
+
"note": "Python loop is capped (n<=200k, steps<=10) to keep the Space stable.",
|
| 177 |
+
}
|
| 178 |
+
|
| 179 |
+
if NUMBA_OK:
|
| 180 |
+
@nb.njit(fastmath=True)
|
| 181 |
+
def _numba_kernel(Psi, E, L, scale):
|
| 182 |
+
n = Psi.shape[0]
|
| 183 |
+
for i in range(n):
|
| 184 |
+
phase = 0.997 * Psi[i] + 0.003 * E[i]
|
| 185 |
+
drive = math.tanh(phase * scale)
|
| 186 |
+
p = 0.999 * Psi[i] + 0.001 * drive
|
| 187 |
+
e = 0.995 * E[i] + 0.004 * p
|
| 188 |
+
l = 0.998 * L[i] + 0.001 * (p * e)
|
| 189 |
+
Psi[i] = p
|
| 190 |
+
E[i] = e
|
| 191 |
+
L[i] = l
|
| 192 |
+
|
| 193 |
+
def run_engine_numba(n: int, steps: int, seed: int, scale: float):
|
| 194 |
+
rng = np.random.default_rng(seed)
|
| 195 |
+
Psi = rng.random(n, dtype=np.float32)
|
| 196 |
+
E = rng.random(n, dtype=np.float32)
|
| 197 |
+
L = rng.random(n, dtype=np.float32)
|
| 198 |
+
|
| 199 |
+
sample = min(n, 200_000)
|
| 200 |
+
Psi0 = Psi[:sample].copy()
|
| 201 |
+
|
| 202 |
+
# warmup compile
|
| 203 |
+
_numba_kernel(Psi[:min(n, 1024)], E[:min(n, 1024)], L[:min(n, 1024)], scale)
|
| 204 |
+
|
| 205 |
+
t0 = time.perf_counter()
|
| 206 |
+
for _ in range(steps):
|
| 207 |
+
_numba_kernel(Psi, E, L, scale)
|
| 208 |
+
t1 = time.perf_counter()
|
| 209 |
+
|
| 210 |
+
Psi1 = Psi[:sample].copy()
|
| 211 |
+
elapsed = t1 - t0
|
| 212 |
+
|
| 213 |
+
items = int(n) * int(steps)
|
| 214 |
+
throughput_Bps = (items / elapsed) / 1e9
|
| 215 |
+
|
| 216 |
+
coh = coherence_abs(Psi0, Psi1)
|
| 217 |
+
eng = mean_energy(E[:sample])
|
| 218 |
+
|
| 219 |
+
return {
|
| 220 |
+
"engine": "numba",
|
| 221 |
+
"oscillators": int(n),
|
| 222 |
+
"steps": int(steps),
|
| 223 |
+
"elapsed_s": float(elapsed),
|
| 224 |
+
"throughput_Bps": float(throughput_Bps),
|
| 225 |
+
"coherence_abs": float(coh),
|
| 226 |
+
"mean_energy": float(eng),
|
| 227 |
+
}
|
| 228 |
+
|
| 229 |
+
# ----------------------------
|
| 230 |
+
# Run + Receipt wrapper
|
| 231 |
+
# ----------------------------
|
| 232 |
+
def run_and_receipt(n_oscillators, steps, seed, scale, include_baseline):
|
| 233 |
+
n = int(n_oscillators)
|
| 234 |
+
s = int(steps)
|
| 235 |
+
seed = int(seed)
|
| 236 |
+
scale = float(scale)
|
| 237 |
+
|
| 238 |
+
# Safety rails for a public Space
|
| 239 |
+
# (Users can still push, but this avoids accidental hard-crashes.)
|
| 240 |
+
n = max(100_000, min(n, 40_000_000))
|
| 241 |
+
s = max(10, min(s, 5000))
|
| 242 |
+
|
| 243 |
+
# Decide engine: if numba is available, prefer it; else numpy
|
| 244 |
+
if NUMBA_OK:
|
| 245 |
+
primary = run_engine_numba(n, s, seed, scale)
|
| 246 |
+
else:
|
| 247 |
+
primary = run_engine_numpy(n, s, seed, scale)
|
| 248 |
+
|
| 249 |
+
baselines = {}
|
| 250 |
+
if include_baseline:
|
| 251 |
+
baselines["numpy"] = run_engine_numpy(min(n, 8_000_000), min(s, 2000), seed, scale)
|
| 252 |
+
baselines["python_loop"] = run_baseline_python(min(n, 500_000), min(s, 200), seed)
|
| 253 |
+
|
| 254 |
+
# System metadata (honest)
|
| 255 |
+
meta = {
|
| 256 |
+
"timestamp_utc": dt.datetime.utcnow().isoformat() + "Z",
|
| 257 |
+
"app_version": APP_VERSION,
|
| 258 |
+
"space_runtime_note": "All measurements are performed on the Hugging Face Space runtime machine.",
|
| 259 |
+
"platform": platform.platform(),
|
| 260 |
+
"python": platform.python_version(),
|
| 261 |
+
"cpu_count_logical": os.cpu_count(),
|
| 262 |
+
"numba_available": bool(NUMBA_OK),
|
| 263 |
+
"inputs": {
|
| 264 |
+
"oscillators": int(n),
|
| 265 |
+
"steps": int(s),
|
| 266 |
+
"seed": seed,
|
| 267 |
+
"scale": scale,
|
| 268 |
+
"include_baselines": bool(include_baseline),
|
| 269 |
+
},
|
| 270 |
+
"definition": {
|
| 271 |
+
"item": "1 item = one per-oscillator coherent state update of [Psi, E, L] per step (as implemented in this Space)."
|
| 272 |
+
},
|
| 273 |
+
"results": {
|
| 274 |
+
"primary": primary,
|
| 275 |
+
"baselines": baselines,
|
| 276 |
+
},
|
| 277 |
}
|
| 278 |
|
| 279 |
+
receipt_path = write_receipt(meta)
|
| 280 |
|
| 281 |
+
# UI results (clean, human readable)
|
| 282 |
+
ui = {
|
| 283 |
+
"Throughput (B/s)": f'{primary["throughput_Bps"]:.3f} B/s',
|
| 284 |
+
"Coherence (|C|)": f'{primary["coherence_abs"]:.5f}',
|
| 285 |
+
"Mean Energy": f'{primary["mean_energy"]:.5f}',
|
| 286 |
+
"Elapsed Time (s)": f'{primary["elapsed_s"]:.2f}',
|
| 287 |
+
"Oscillators": f'{primary["oscillators"]:,}',
|
| 288 |
+
"Steps": f'{primary["steps"]:,}',
|
| 289 |
+
"Engine": primary["engine"],
|
| 290 |
+
"CPU Cores Available": os.cpu_count(),
|
| 291 |
+
"Baselines Included": bool(include_baseline),
|
| 292 |
+
}
|
| 293 |
+
|
| 294 |
+
if include_baseline:
|
| 295 |
+
# add short baseline summary (no hype; facts only)
|
| 296 |
+
for k, v in baselines.items():
|
| 297 |
+
ui[f"Baseline: {k} (B/s)"] = f'{v["throughput_Bps"]:.3f}'
|
| 298 |
+
ui[f"Baseline: {k} Engine"] = v["engine"]
|
| 299 |
+
|
| 300 |
+
return ui, receipt_path
|
| 301 |
|
| 302 |
+
# ----------------------------
|
| 303 |
+
# UI (clean, simple, visual)
|
| 304 |
+
# ----------------------------
|
| 305 |
+
CSS = """
|
| 306 |
+
:root {
|
| 307 |
+
--rft-accent: #ff7a18;
|
| 308 |
+
}
|
| 309 |
+
.gradio-container {
|
| 310 |
+
max-width: 980px !important;
|
| 311 |
+
}
|
| 312 |
+
#titlebar h1 {
|
| 313 |
+
font-size: 2.05rem;
|
| 314 |
+
letter-spacing: -0.02em;
|
| 315 |
+
}
|
| 316 |
+
.rft-card {
|
| 317 |
+
border-radius: 16px !important;
|
| 318 |
+
border: 1px solid rgba(255,255,255,0.08) !important;
|
| 319 |
+
}
|
| 320 |
+
"""
|
| 321 |
+
|
| 322 |
+
with gr.Blocks(css=CSS, theme=gr.themes.Soft()) as demo:
|
| 323 |
gr.Markdown(
|
| 324 |
"""
|
| 325 |
+
<div id="titlebar">
|
| 326 |
+
<h1>Coherent Compute Engine</h1>
|
| 327 |
+
</div>
|
| 328 |
|
| 329 |
+
**What this Space does**
|
| 330 |
+
It runs a real, on-machine benchmark of a coherent state-update engine and reports **measured throughput**, **stability**, and **energy behavior**. No precomputed results.
|
|
|
|
|
|
|
|
|
|
| 331 |
|
| 332 |
+
**What an “item” is**
|
| 333 |
+
One coherent update of **[Ψ, E, L]** per oscillator per step.
|
| 334 |
|
| 335 |
+
**Verification**
|
| 336 |
+
Every run generates a tamper-evident **receipt (JSON)** with a SHA-256 hash you can download.
|
| 337 |
"""
|
| 338 |
)
|
| 339 |
|
| 340 |
with gr.Row():
|
| 341 |
+
with gr.Column(scale=1):
|
| 342 |
+
with gr.Group(elem_classes=["rft-card"]):
|
| 343 |
+
n_slider = gr.Slider(
|
| 344 |
+
minimum=100_000, maximum=40_000_000, step=100_000,
|
| 345 |
+
value=6_400_000, label="Number of Oscillators"
|
| 346 |
+
)
|
| 347 |
+
steps_slider = gr.Slider(
|
| 348 |
+
minimum=10, maximum=5000, step=10,
|
| 349 |
+
value=650, label="Simulation Steps"
|
| 350 |
+
)
|
| 351 |
+
seed_box = gr.Number(value=7, precision=0, label="Seed")
|
| 352 |
+
scale_box = gr.Number(value=1.0, precision=3, label="Scale (stability knob)")
|
| 353 |
+
include_baseline = gr.Checkbox(
|
| 354 |
+
value=False,
|
| 355 |
+
label="Include baselines (numpy + tiny python loop)",
|
| 356 |
+
info="Baselines are measured live too. Python loop is safety-capped."
|
| 357 |
+
)
|
| 358 |
+
run_btn = gr.Button("Run Engine", variant="primary")
|
| 359 |
+
|
| 360 |
+
with gr.Column(scale=1):
|
| 361 |
+
results_json = gr.JSON(label="Results")
|
| 362 |
+
receipt_file = gr.File(label="Receipt (JSON download)")
|
| 363 |
|
| 364 |
run_btn.click(
|
| 365 |
+
fn=run_and_receipt,
|
| 366 |
+
inputs=[n_slider, steps_slider, seed_box, scale_box, include_baseline],
|
| 367 |
+
outputs=[results_json, receipt_file],
|
| 368 |
+
)
|
| 369 |
+
|
| 370 |
+
gr.Markdown(
|
| 371 |
+
"""
|
| 372 |
+
**Notes**
|
| 373 |
+
- This runs on the Hugging Face Space runtime machine. If you want numbers from your own hardware, run the same code locally.
|
| 374 |
+
- If the Space is under load, throughput will vary. That’s normal; the receipt captures the environment at run time.
|
| 375 |
+
"""
|
| 376 |
)
|
| 377 |
|
| 378 |
+
if __name__ == "__main__":
|
| 379 |
+
demo.launch()
|