This PR adds a benchmark for the solve function for MatZq.
As we are currently in the process of evaluating the matrix access, we expect there to be a difference in runtime especially for the solve function.
As the solve function is also one of our main concerns regarding runtime besides the sampling algorithms, it seems necessary to establish a baseline for our current runtime of solve, which is added with this PR.
The benchmark was created as described in the corresponding comment.
Checklist:
[x] I have performed a self-review of my own code
[x] The code provides good readability and maintainability s.t. it fulfills best practices like talking code, modularity, ...
[x] The chosen implementation is not more complex than it has to be
[x] My code should work as intended and no side effects occur (e.g. memory leaks)
Description
This PR adds a benchmark for the solve function for MatZq. As we are currently in the process of evaluating the matrix access, we expect there to be a difference in runtime especially for the solve function. As the solve function is also one of our main concerns regarding runtime besides the sampling algorithms, it seems necessary to establish a baseline for our current runtime of solve, which is added with this PR.
The benchmark was created as described in the corresponding comment.
Checklist: