Module parallel_permutation 

Parallel Vision-4 hash permutation using flattened state arrays.

Processes N Vision-4 states simultaneously by flattening them into a single N×4 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[2], s0[3], s1[0], s1[1], ...] where N = number of states, M = 4.

Round Structure

Each round: inversion → transform → MDS → constants → inversion → transform → MDS → constants

Functions

batch_permutation

Executes the complete Vision-4 permutation on N parallel states.