[CX_HARDENING] - Develop A Better Framework for Input Permutation

[jparr721]

What is this task and why do we need to work on it?

Inputs are mostly written for the happy path. The existing tests are written with a single stream of inputs, and this has bitten us in the past. However, as we see in the proposal_ordering tests, the permutation with index order is not sufficient and requires the implementor to arduously call a significant number of cases with manually prescribed indices. We can do better. We need a scalable and reliable way to permute inputs (and outputs) in a way that ensures that all possible orderings can be handled by the test.

What work will need to be done to complete this task?

• [ ] - Define a new set of helper primitives to permute inputs of hot shot events.
• [ ] - Validate that all cases are exhaustively checked.
• [ ] - Evaluate the time duration of the tests and determine if each run should be a unique permutation, or if all permutations should run every time.

Are there any other details to include?

No response

What are the acceptance criteria to close this issue?

All tests passing, new permutation system implemented.

Branch work will be merged to (if not the default branch)

No response