// @generated by tool/gen/fn/generate.py; DO NOT EDIT.
// schema=cryptography_bigint.json schema_version=1 generator_version=64
// schema_sha256=636171eea6d8620d516a7d64ef1143ab03485ef3095474ad2e2c60e9fe0fe9e6
// No OA C++ BigInt donor exists. Arithmetic helpers are independently tested.
// One invocation owns every output limb/status of a complete batch row.
// This public-data baseline has no secret-placement or constant-time contract.
import attributes;
import bigint_words;
import bigint_division;
import wide_u32;
struct PushConstants {
uint left_index;
uint modulus_index;
uint output_index;
uint status_index;
uint count;
uint words;
uint input_words;
uint right_count;
};
[[vk::push_constant]] PushConstants push;
[[vk::binding(0, 0)]] RWByteAddressBuffer storage_buffers[];
[kernel_name("reduce_montgomery")]
[domain("cryptography")]
[variant("generic")]
[dtype("u32")]
[status("experimental")]
[shader("compute")]
[numthreads(32, 1, 1)]
void main(uint3 tid : SV_DispatchThreadID) {
uint row = tid.x;
if (row >= push.count || push.input_words == 0u || push.input_words > 256u || push.words == 0u || push.words > 128u || push.input_words != push.words * 2u) return;
uint left_extent; storage_buffers[push.left_index].GetDimensions(left_extent);
if (push.count > left_extent / (push.input_words * 4u)) return;
uint right_extent; storage_buffers[push.modulus_index].GetDimensions(right_extent);
if ((push.right_count != 1u && push.right_count != push.count) || push.right_count > right_extent / (push.words * 4u)) return;
uint output_extent; uint output_row_bytes = push.words * 4u;
storage_buffers[push.output_index].GetDimensions(output_extent);
if (push.count > output_extent / output_row_bytes) return;
uint status_extent; uint status_row_bytes = 1u * 4u;
storage_buffers[push.status_index].GetDimensions(status_extent);
if (push.count > status_extent / status_row_bytes) return;
uint a[256], modulus[128], result[128];
for (uint i = 0u; i < 256u; ++i) a[i] = 0u;
bigint_zero(modulus);
for (uint i = 0u; i < push.input_words; ++i)
a[i] = storage_buffers[push.left_index].Load(row * push.input_words * 4u + i * 4u);
uint right_base = (push.right_count == 1u ? 0u : row) * push.words * 4u;
for (uint i = 0u; i < push.words; ++i)
modulus[i] = storage_buffers[push.modulus_index].Load(right_base + i * 4u);
bool valid = bigint_montgomery_reduce_wide(a, modulus, push.words, result);
for (uint i = 0u; i < push.words; ++i)
storage_buffers[push.output_index].Store(row * output_row_bytes + i * 4u, result[i]);
storage_buffers[push.status_index].Store(row * 4u, uint(valid));
}