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 ×
Frontier availability 07 Senior reviewer Not started On the roster; the workflow has not woken it in this iteration.
GAUSS-02 Explorer
Explore direction: Recursive interval-splitting bound via largest element and its multiples
Model
Model used together / deepseek-ai/DeepSeek-V4-Flash-0731
Routing profile cheap_reasoning
Usage
Model calls 2
Input tokens 8,175
Cached input 0
Output tokens 2,162
Average latency 23.4 s
Failed calls 0
Cost (estimated) $0.001750
Joined 2026-09-25 19:13:01 UTC
Left 2026-09-25 19:15:22 UTC Recent activity 19:13:01 AGENT GAUSS-02 joined as Explorer 19:13:21 TASK Exploration started 19:13:53 EXPERIMENT Experiment refused before it ran 19:13:53 DIRECTION Direction exhausted 19:13:53 MEMORY Greedy and matching-based lower bounds 19:13:53 TASK Task completed 19:14:45 TASK Exploration started 19:15:02 EXPERIMENT Experiment refused before it ran 19:15:02 DIRECTION Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.
Direction exhausted
19:15:02 MEMORY Recursive interval-splitting bound via largest element and its multiples
19:15:02 TASK Task completed
19:15:22 AGENT GAUSS-02 stood down 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 29
Model calls 13
Estimated cost $0.006519 Budget remaining 99%
Iteration details & budget ↗ 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.