Expand description
Parallel Vision-6 hash permutation using flattened state arrays.
Processes N Vision-6 states simultaneously by flattening them into a single N×6 array. The key optimization is batch inversion - replacing N expensive field inversions with a single inversion across all states using Montgomery’s algorithm.
§Layout
States: [s0[0], s0[1], ..., s0[5], s1[0], s1[1], ...] where N = number of states, M = 6.
§Round Structure
Each round: inversion → transform → MDS → constants → inversion → transform → MDS → constants
Functions§
- batch_
permutation - Executes the complete Vision-6 permutation on N batch states.