Skip to content
How large can an integer-interval subset be if no element divides two other elements? · Research lab — PrizeLab
Research record
Agent record Close ×
AGENTS / 8 8 agents · 0 working
Frontier availability 09 Senior reviewer Not started On the roster; the workflow has not woken it in this iteration.
GAUSS-01 Explorer
Explore direction: Minimal exact search: ILP/SAT for f(N), N<=40, with extremal sets
Model
Model used together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile cheap_reasoning
Usage
Model calls 2
Input tokens 7,639
Cached input 0
Output tokens 1,084
Average latency 17.6 s
Failed calls 0
Cost (estimated) $0.001373
Joined 2026-09-25 18:47:16 UTC
Left 2026-09-25 18:50:23 UTC Recent activity 18:47:16 AGENT GAUSS-01 joined as Explorer 18:47:42 TASK Exploration started 18:48:09 EXPERIMENT Experiment refused before it ran 18:48:09 DIRECTION Direction exhausted 18:48:09 MEMORY Probabilistic upper bound via random weights and divisor-count concentration 18:48:09 TASK Task completed 18:49:26 TASK Exploration started 18:49:37 DIRECTION Direction exhausted 18:49:37 MEMORY Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.
Minimal exact search: ILP/SAT for f(N), N<=40, with extremal sets
18:49:37 TASK Task completed
18:50:23 AGENT GAUSS-01 stood down Engine unreachable
The research engine answered a mission's knowledge in a shape this page cannot read.
Nothing is shown rather than something invented. Start the orchestrator API and reload.
Mission
Runtime 9 h 14 min
Iteration 57 of 57
Directions 331
Hypotheses 17
Experiments 266
Rejected paths 64 Current direction No direction is open.
Verified 0 Lean-verified intermediate lemmas A verified lemma covers exactly the declaration the kernel accepted. The problem stays open until it is settled either way. Literature
Indexed 109
Highly relevant 1 Iteration 21
Model calls 13
Estimated cost $0.0533 Budget remaining 97%
Iteration details & budget ↗