Repository navigation
ci: the benchmarks of a pull request held to those of its base - #13
Closed
gudoshnikovn wants to merge 0 commit into
Closed
gudoshnikovn wants to merge 0 commit into
gudoshnikovn wants to merge 0 commit into
Conversation
gudoshnikovn
force-pushed
the
feature/bench-gate
branch
2 times, most recently
from
October 13, 2026 23:56
4a01852 to
92635dc
Compare
gudoshnikovn
force-pushed
the
feature/bench-gate
branch
from
October 14, 2026 00:39
92635dc to
1915d17
Compare
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
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.
bench.yml runs the overhead and memory blocks of the base and of the head in one
job, and benchmarks/gate.py compares them. Memory is held exactly: tracemalloc's
peak of each load within 1 KiB of the base's, so a new copy in Python fails, and
the peak resident rise of a batch within 1.1 times libphash's estimate. Time is
held relatively, since a shared runner's speed varies: each cell over the C cell
of its table, against the base's ratio. A growth past 15 % for a call whose C
cell is under 10 us, or 5 % for a whole load or hash, is a warning for now;
--fail-timing fails past 25 % or 10 % once the noise of the runners is known.
Parallelism and process pools are published, not gated.
🤖 Generated with Claude Code