2026-09-12
Claimed result:
AI / model: Not identified
Reported method
The article proves all square roots can precede all halvings, replaces the halving budget by a penalty w per halving, proves the square-root gain is non-increasing along each chain so a bucketed greedy plus an integer binary search on w suffices; its own version is O(n + H log(H+1)) and nmsy's refinement brings it to O(n + H), where H = max h_i.
Verification
- Source
- Source reviewed
- Theory
- Theory not checked
- Implementation
- Code available
- Prior art
- Prior art not reviewed
The result page was opened and compared with the collection claim. Legacy audit state: audited_public.
The table's AI cell O(n+h) agrees with the article's final O(n + H) bound (h = H = max h_i); the article's own first solution is O(n + H log(H+1)). The baseline cell 认定错题 ("recognised as a flawed problem") is not supported anywhere on the linked page and needs separate evidence from a later node.
Credits
- Result authors
- nmsy
- Published by
- chen_zhe
Independent reproduction: Not yet performed
Prior-art review: Not yet performed