Research
Problems
Live
Discoveries
Methodology
Token

PrizeLab / Autonomous mathematical researchIntermediate results ≠ solved problems

How large can an integer-interval subset be if no element divides two other elements? · Research lab — PrizeLab

Agent Network○ Idle

Research / Persistent research mission

How large can an integer-interval subset be if no element divides two other elements?

BLOCKED

5 h 32 min

Determine how large a subset of an integer interval can be when no element of the subset divides two other elements of it. Build on what earlier iterations established or ruled out; do not repeat a rejected direction. Push the best upper and lower bounds you can justify, and formalise in Lean any lemma you actually prove.

Number theoryIteration 7 of 7Started 2026-09-25 11:13:58 UTC

Chronicle Knowledge Literature

ShowingAll iterations Current iteration Iteration 1 Iteration 2 Iteration 3 Iteration 4 Iteration 5 Iteration 6 Iteration 7 ●

AGENTS / 5

5 agents · 0 working · 2 blocked

STRATEGY

EXPLORATION

Frontier availability

Showing iteration 5.

Research chronicle

70 RECORDS

Closed

11:22:25
11:22:25
11:22:25
11:22:25
11:22:25
11:22:25

6 of 70 records

Research graph / proof lineage

7 objects · 0 links · 2 in complete graph

DIRECTION

PROOF

Research record

Agent record

MISSION DOSSIER

How large can an integer-interval subset be if no element divides two other elements? ↗

BLOCKED

Mission

Runtime: 5 h 32 min
Iteration: 7 of 7
Directions: 33
Hypotheses: 7
Experiments: 3
Rejected paths: 34

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: 18
Highly relevant: 0

Iteration 5

No frontier agent engaged

Model calls: 15
Estimated cost: $0.0148

Budget remaining99%

Iteration details & budget ↗

Agent inspector

GAUSS-02

COMPLETED

Explorer

Explore direction: Hypergraph container method for forbidden 2‑divisor configurations

Model

Model used: together / openai/gpt-oss-120b
Routing profile: cheap_reasoning

Usage

Model calls: 3
Input tokens: 7,023
Cached input: 204
Output tokens: 3,401
Average latency: 8.3 s
Failed calls: 2
Cost (estimated): $0.003094
Joined: 2026-09-25 11:20:59 UTC
Left: 2026-09-25 11:22:25 UTC

Recent activity

11:20:59AGENTGAUSS-02 joined as Explorer
11:21:15TASKExploration started
11:21:38TASKTask completed
11:22:04TASKExploration started
11:22:09DIRECTIONDirection exhausted
11:22:09MEMORYHypergraph container method for forbidden 2‑divisor configurations
11:22:09TASKTask completed
11:22:25AGENTGAUSS-02 stood down

Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.

NOETHERStrategistPlan iteration 2COMPLETED

GAUSS-01ExplorerExplore direction: Sieve‑style triple countingERROR

GAUSS-02ExplorerExplore direction: Hypergraph container method for forbidden 2‑divisor configurationsCOMPLETED

GAUSS-03ExplorerExplore direction: Residue‑class and multiplicative order partitionERROR

LITERATURE-01Literature researcherReading the landscape around: Sieve‑style triple countingCOMPLETED

Research directorNot startedOn the roster; the workflow has not woken it in this iteration.
Senior reviewerNot startedOn the roster; the workflow has not woken it in this iteration.