← Back to radar

Observation record / Hacker News

The recently proposed o(n log n) integer multiplication algorithm [pdf]

First seen 10/22, 10:45 · Last observed 10/22, 12:05 · Source data is current

Read the original source ↗

Title-based outlineThe recently proposed o(n log n) integer multiplication algorithm [pdf]

Why it mattersA discussion on this source’s current list. Verify details in the original; rank does not establish reliability.

Published 10/22, 10:30

30 minutesRank movement—

Building history

1 hourRank movement+1

Baseline observed 10/22, 11:05

24 hoursRank movement—

Building history

Source rank history

9 observations

Momentum 33/100 = max(0, 1h rank gain) ÷ baseline rank × 100. Platform metrics are not combined.

21010/22, 10:45 · 10 places10/22, 10:55 · 4 places10/22, 11:05 · 3 places10/22, 11:15 · 3 places10/22, 11:25 · 2 places10/22, 11:35 · 2 places10/22, 11:45 · 2 places10/22, 11:55 · 3 places10/22, 12:05 · 2 places10/22, 10:4510/22, 12:05
Official public API · linked titles only· Author craigcitro
View original observation times and ranks
Observation time (Beijing)Source position
10/22, 12:052
10/22, 11:553
10/22, 11:452
10/22, 11:352
10/22, 11:252
10/22, 11:153
10/22, 11:053
10/22, 10:554
10/22, 10:4510
Daily aggregate history
日期Best daily positionLast daily positionObservations
2026-10-22229