Repository navigation
The four integration declines are bounded by one guard that a loaded runner cannot fail - #1406
Merged
Merged
Conversation
…runner cannot fail atan(x)^2/x^2 declines in 3.4 seconds on a developer machine and was bounded at 20; on 2026-09-17 the same test failed twice on an Ubuntu runner at 20.7 and 25.7 seconds, in suites that took 13 and 12 minutes where the Windows leg beside them took 4 and 6 -- the same binary, seven times slower, which makes it the runner and not the code. IntegrationDecline.Guard is 60 seconds, past the slowest honest decline by a wide margin and still short of the runaway each of the four tests was written against, as LimitTermination is for the limits. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_012sonx8iAspMiwRwokT1Ura
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
InverseTangentPowerByPartsTest.ANonElementaryRemainderIsDeclinedQuicklyfailed twice today on the Ubuntu leg (#1402's first run at 20.7 s, #1405's at 25.7 s) with the suite taking 12–13 minutes where the Windows leg took 4–6: the same binary, seven times slower, so the runner and not the code —atan(x)^2/x^2declines in 3.4 s here on master and on both branches. The four wall-clock integration tests now shareIntegrationDecline.Guard(60 s), documented asLimitTerminationis: past the slowest honest decline by a wide margin, still short of the 30–83 s runaways each test was written against, so a real regression still fails and a loaded runner does not.Tests only; the four classes pass locally (71 tests, 5 s).
🤖 Generated with Claude Code
https://claude.ai/code/session_012sonx8iAspMiwRwokT1Ura