ManifoldPlay moneyOtherDevelopingUpdated 37m ago

Will integer multiplication be proved possible in O(n) time by June 30, 2027?

As of Oct 11, 2026, 11:48 PM ET, Manifold priced this market at 5.8% (little changed over 24 hours). It had 100 mana of pool liquidity.

Market probability
5.8%
Little changed over 24 hours
Limited dataNot live — snapshot Oct 11, 11:48 PM ET

Play-money market (mana, not dollars) — the venue's feed doesn't report liquidity for this market — though most recent trading came from one account.

Price historyManifold

Source: Manifold price history

How credible was the move?

Methodology →

Move validity

Insufficient data

Consensus stability

Stable

Contract clarity

High

Can you trust this price?

Two different questions: how hard the price is to move, and whose trading set it.

Market capacity

How hard is it to move this price?

UnknownThin market

Pool liquidity

100 mana

Bid-ask spread

n/a

automated market maker

24h volume

0 mana

Total volume

748.3 mana

Play money: depth is in mana, so it says nothing about real-money conviction.

Who's trading

Whose opinion is this price?

One account dominates
84%of the traded money came from the single largest account

Accounts

7

Trades

12

over 17h

Largest order

150 mana

419 mana traded across these 12 trades (last 17h).

One account did most of the recent trading — the price reflects that account's view more than a crowd's.

Recent trade activity$419 traded

From the latest trade tape (most recent 200 prints) — a live activity sample, not a lifetime total.

What this market actually measures

Resolves YES if a correct, complete, unconditional proof is publicly available by June 30, 2027, 23:59 UTC showing that two n-bit nonnegative integers can be multiplied exactly in worst-case O(n) time on a deterministic multitape Turing machine. The machine must have a fixed finite alphabet and a fixed finite number of one-dimensional tapes.

This summary shows the opening of the venue's official rules. ProbCast has not yet generated an independent plain-English interpretation for this contract — review the full rules before relying on it.

View full official resolution rules

Resolves YES if a correct, complete, unconditional proof is publicly available by June 30, 2027, 23:59 UTC showing that two n-bit nonnegative integers can be multiplied exactly in worst-case O(n) time on a deterministic multitape Turing machine. The machine must have a fixed finite alphabet and a fixed finite number of one-dimensional tapes. The bound includes reading the inputs, writing the binary product, and any preprocessing. Arbitrarily large constant factors are allowed. Expected-time, average-case, bounded-error, approximate, quantum, or unit-cost arithmetic results do not count unless they also establish this bound in the specified model. Preprints count if the proof is subsequently accepted as correct by the relevant research community; verification may occur after the deadline. Substantial missing arguments supplied after the deadline do not count. Otherwise resolves NO. A NO resolution means no qualifying proof was public by the deadline, not that linear-time multiplication is impossible.

What could move this market next?

  • The market's deadline arrivesJune 30, 2027 at 7:59 PM ET

    The contract must resolve based on what has happened by this date.

Derived from the contract's own mechanics as of Oct 12, 12:24 AM ET. ProbCast does not list scheduled meetings, announcements, or data releases it cannot verify.

Advanced analysis (experimental)

Research signals — these models are still accumulating the history needed for full validation, and they can disagree with the headline read. Model confidence: low · expected error ±21 pts.

Thin marketLegacy movement classifier: watch

What's happening

low classifier confidence
Thin market

Thin book and/or wide spread. Small orders can move this price disproportionately, so any single print is noisy and easily overread.

  • Thin book and/or wide spread.

Read with caution —Read the latest price with caution; conditions make it an unreliable summary right now.

More details — reliability score, dynamics, durability
Reliability score
12Low
Where the price path tends to go next1174 observed
  • Illiquid / quiet99%

Short-term motion of the price line (~1h), distinct from the environment above — not a prediction of the final outcome.

DurabilityHigh· half-life —
PredictabilityStable

Secondary read: leaning toward Stale price.

A read-only classification of the market environment — how much weight the current price deserves as a read of consensus. It describes conditions, never a trade.

Market data

24h volume

0 mana

Liquidity

100 mana

Total volume

748.3 mana

Category
Other
Venue
Manifold
Open interest
—
Current probability
5.8%
Resolves
Jun 30, 2027
Change (pts)1H0.06H0.024H0.07D0.0

Related markets