lean4-htt/tests/bench
Paul Reichert 98e4b2882f
refactor: migrate to new ranges (#8841)
This PR migrates usages of `Std.Range` to the new polymorphic ranges.

This PR unfortunately increases the transitive imports for
frequently-used parts of `Init` because the ranges now rely on iterators
in order to provide their functionality for types other than `Nat`.
However, iteration over ranges in compiled code is as efficient as
before in the examples I checked. This is because of a special
`IteratorLoop` implementation provided in the PR for this purpose.

There were two issues that were uncovered during migration:

* In `IndPredBelow.lean`, migrating the last remaining range causes
`compilerTest1.lean` to break. I have minimized the issue and came to
the conclusion it's a compiler bug. Therefore, I have not replaced said
old range usage yet (see #9186).
* In `BRecOn.lean`, we are publicly importing the ranges. Making this
import private should theoretically work, but there seems to be a
problem with the module system, causing the build to panic later in
`Init.Data.Grind.Poly` (see #9185).
* In `FuzzyMatching.lean`, inlining fails with the new ranges, which
would have led to significant slowdown. Therefore, I have not migrated
this file either.
2025-07-07 12:41:53 +00:00
..
inundation refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
mergeSort chore: deprecate List.iota (#6708) 2025-01-21 02:32:35 +00:00
qsort feat: remove runtime bounds checks and partial from qsort (#6241) 2024-12-01 06:26:00 +00:00
.gitignore chore: add .dSYM files (Mac debug symbols) to tests .gitignore files (#8771) 2025-06-13 15:27:46 +00:00
accumulate_profile.py chore: lean --stats gives number of imported bytes (#8725) 2025-06-12 08:29:42 +00:00
arith_eval.ml
big_do.lean test: add a benchmark that is slow to elaborate (#5656) 2024-10-23 08:20:15 +00:00
big_omega.lean test: big_omega benchmark (#5817) 2024-10-24 07:26:29 +00:00
binarytrees.ghc-6.hs
binarytrees.lean test: clean up binarytrees.lean 2023-01-19 14:44:20 +01:00
binarytrees.lean.args
binarytrees.lean.expected.out
binarytrees.ocaml-2.ml
binarytrees.st.hs test: add binarytrees.st benchmark 2023-01-19 14:44:20 +01:00
binarytrees.st.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
binarytrees.st.mlton-2.sml test: add binarytrees.st benchmark 2023-01-19 14:44:20 +01:00
binarytrees.st.sml test: add binarytrees.st benchmark 2023-01-19 14:44:20 +01:00
binarytrees.st.swift test: add binarytrees.st benchmark 2023-01-19 14:44:20 +01:00
binarytrees.swift
binarytrees5.ml test: add binarytrees.st benchmark 2023-01-19 14:44:20 +01:00
binarytrees5_multicore.ml chore: more benchmarking setup 2023-01-17 13:28:05 +01:00
bv_decide_inequality.lean fix: bv_decide benchmarks (#6017) 2024-11-09 11:18:33 +00:00
bv_decide_large_aig.lean perf: add a large AIG benchmark for bv_decide (#7721) 2025-03-29 16:04:25 +00:00
bv_decide_mod.lean fix: bv_decide benchmarks (#6017) 2024-11-09 11:18:33 +00:00
bv_decide_mul.lean feat: add bv_decide benchmarks (#5203) 2024-08-29 12:45:58 +00:00
bv_decide_realworld.lean chore: notation ^^ for Bool.xor (#5332) 2024-09-18 08:59:11 +00:00
bv_decide_rewriter.lean perf: bv_decide rewriting benchmark (#9231) 2025-07-07 10:24:08 +00:00
channel.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
compile.sh feat: LLVM backend (#1837) 2022-12-30 12:45:30 +01:00
const_fold.hs
const_fold.lean
const_fold.lean.args
const_fold.lean.expected.out
const_fold.ml
const_fold.sml
const_fold.swift
cross.yaml chore: fix more typos in comments 2023-10-08 14:37:34 -07:00
dag_hassorry_issue.lean chore: split up & simplify importModules 2023-08-31 15:37:33 -04:00
dag_hassorry_issue.lean.args chore: reduce stack space usage at instantiate_mvars_fn (#4931) 2024-08-06 17:38:59 +00:00
dag_hassorry_issue.lean.expected.out chore: improve test 2023-07-11 19:19:42 -07:00
deriv.hs
deriv.lean
deriv.lean.args
deriv.lean.expected.out
deriv.ml
deriv.sml
deriv.swift
ex-50-50-1.leq
flake.lock chore: update cross-bench setup 2024-04-15 10:59:07 +02:00
flake.nix chore: robustify Nix shell (#8141) 2025-04-28 15:08:32 +00:00
full-stdlib.exec.yaml
ghc-gc.py
identifier_completion.lean feat: language reference links and examples in docstrings (#7240) 2025-03-12 09:17:27 +00:00
identifier_completion_didOpen.log feat: language reference links and examples in docstrings (#7240) 2025-03-12 09:17:27 +00:00
identifier_completion_initialization.log test: identifier completion benchmark (#6796) 2025-01-27 19:31:32 +00:00
identifier_completion_runner.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
ilean_roundtrip.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
iterators.lean chore: create iterator benchmark (#9094) 2025-07-01 11:47:36 +00:00
lean-gc.py
liasolver.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
liasolver.lean.args
liasolver.lean.expected.out
Makefile chore: update cross-bench setup 2024-04-15 10:59:07 +02:00
mlkit-gc.py
nat_repr.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
nat_repr.lean.args chore: Nat.repr microbenchmark (#3888) 2024-04-17 18:10:32 +00:00
nat_repr.lean.expected.out chore: Nat.repr microbenchmark (#3888) 2024-04-17 18:10:32 +00:00
ocaml-gc.py chore: more benchmarking setup 2023-01-17 13:28:05 +01:00
omega_stress.lean perf: optimize sorry detection in unused variables linter (#7129) 2025-02-22 16:43:39 +00:00
parser.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
perf.py chore: update benchmark suite 2022-05-25 18:26:36 +02:00
qsort.hs chore: update benchmark suite 2022-05-25 18:26:36 +02:00
qsort.lean feat: Array.swap takes Nat arguments, with tactic provided proofs (#6194) 2024-11-24 07:59:57 +00:00
qsort.lean.args
qsort.lean.expected.out
qsort.ml test: more fair qsort.ml benchmark 2022-10-12 20:22:55 +02:00
qsort.sml
qsort.swift test: more fair qsort.ml benchmark 2022-10-12 20:22:55 +02:00
rbmap.hs chore: make rbmap.hs more similar to other implementations 2022-09-24 14:16:48 +02:00
rbmap.lean chore: modernize rbmap benchmarks a bit 2022-09-24 14:16:48 +02:00
rbmap.lean.args
rbmap.lean.expected.out
rbmap.ml
rbmap.sml
rbmap.swift
rbmap2.lean
rbmap3.lean
rbmap500k.lean
rbmap_checkpoint.hs chore: make rbmap.hs more similar to other implementations 2022-09-24 14:16:48 +02:00
rbmap_checkpoint.lean chore: modernize rbmap benchmarks a bit 2022-09-24 14:16:48 +02:00
rbmap_checkpoint.lean.args
rbmap_checkpoint.lean.expected.out
rbmap_checkpoint.ml
rbmap_checkpoint.sml
rbmap_checkpoint.swift
rbmap_checkpoint2.lean
rbmap_checkpoint2.sml
rbmap_checkpoint_cpp_lean3.cpp
rbmap_checkpoint_cpp_std.cpp
rbmap_cpp_lean3.cpp
rbmap_cpp_std.cpp
rbmap_fbip.lean feat: add rbmap_fbip benchmark 2022-10-06 17:26:43 -07:00
rbmap_library.lean chore: more RBMap cleanup 2022-10-06 17:26:43 -07:00
README.md chore: update cross-bench setup 2024-04-15 10:59:07 +02:00
reduceMatch.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
report.py chore: safer bench script 2023-07-19 08:31:39 +02:00
riscv-ast.lean chore: add RISC-V ast benchmark (#8035) 2025-04-21 15:46:38 +00:00
run.sh
server_startup.lean fix: make watchdog more resilient against badly behaving clients (#4443) 2024-06-13 13:48:36 +00:00
server_startup.log test: add language server startup benchmark (#3558) 2024-03-04 09:01:51 +00:00
simp_arith1.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
speedcenter.exec.velcom.yaml refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00
speedcenter.yaml chore: try refining some benchmark settings (#8377) 2025-05-16 11:24:11 +00:00
states35.lean
test_single.sh feat: LLVM backend (#1837) 2022-12-30 12:45:30 +01:00
unionfind.lean feat: change Array.get to take a Nat and a proof (#6032) 2024-11-12 03:30:46 +00:00
unionfind.lean.args
unionfind.lean.expected.out
unionfind_clean.lean
workspaceSymbols.lean chore: fix benchmark 2024-06-20 18:18:41 +02:00
workspaceSymbolsNewRanges.lean refactor: migrate to new ranges (#8841) 2025-07-07 12:41:53 +00:00

Lean Benchmark Suites

This folder contains multiple small Lean programs for benchmarking used by two separate benchmark suites based on the temci benchmarking tool:

  • The light-weight "Speedcenter" suite benchmarks the current build of Lean. It can be used for quick comparisons on the cmdline and powers the Lean Speedcenter website.
  • The heavy-weight "Cross" suite benchmarks multiple Lean configurations and other functional compilers against each other and generates CSV and HTML reports from that. It was created for the paper "Counting Immutable Beans - Reference Counting Optimized for Purely Functional Programming" (IFL19).

Speedcenter Suite

Requirements:

  • A local Lean build in ../../build/release. Build at least the bin target.
  • temci. Using Nix, open a nix-shell in the project root directory to add a compatible version to your PATH. Alternatively, try pip3 install git+https://github.com/parttimenerd/temci.git.

To execute the suite and save the results in base.yaml, run (in this folder)

temci exec --config speedcenter.yaml --out base.yaml

Other interesting exec flags:

  • use --runs N to modify the default number of 10 runs per benchmark
  • use --included_blocks fast to excluded slow benchmarks like the stdlib benchmark. You can replace fast with any benchmark name or label in speedcenter.exec.yaml.

If you have multiple saved result files, you can compare them with

temci report --config speedcenter.yaml report1.yaml report2.yaml ...

Cross Suite

We recommend using Nix for building/obtaining all Lean variants and used compilers in a reproducible way. After installing Nix, running the benchmarks is as easy as

nix develop
make

This will record 50 runs for each benchmark configuration (this can be changed with runs in cross.yaml), generate results in report_lean.csv and report_cross.csv, and print them to stdout in a tabulated format. It will also generate HTML reports in report/ comparing the time-based benchmarks.

In order to reduce noise in the benchmarking data, you may instead want to try calling make inside a temci shell:

temci short shell --sudo --preset usable --cpuset_active make

Using root powers, this will temporarily configure your machine similarly to the LLVM benchmarking recommendations and move all your other processes to a single CPU core.