oarust 0.9.0

GPU-first semantic computing engine written in Rust
// @generated by tool/gen/fn/generate.py; DO NOT EDIT.
// schema=cryptography_hash.json schema_version=1 generator_version=64
// schema_sha256=982731ed954c1dddbb0b1430f6561e03cbaf7cb6e7880fae9ba317ad9a1fa87b
// Public field data only. Pinned permutation; OA's explicitly framed field XOF.
import attributes;
import prime31;
import poseidon2;
struct PushConstants {
	uint input_index;
	uint output_index;
	uint count;
	uint input_elements;
	uint output_elements;
};
[[vk::push_constant]] PushConstants push;
[[vk::binding(0, 0)]] RWByteAddressBuffer storage_buffers[];
[kernel_name("poseidon2_koalabear24")]
[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_elements > 0x3fffffffu || push.output_elements == 0u || push.output_elements > 0x3fffffffu) return;
	uint input_extent, output_extent;
	storage_buffers[push.input_index].GetDimensions(input_extent);
	storage_buffers[push.output_index].GetDimensions(output_extent);
	uint input_stride = push.input_elements * 4u;
	uint output_stride = push.output_elements * 4u;
	if ((input_stride != 0u && push.count > input_extent / input_stride) || push.count > output_extent / output_stride) return;
	const uint prime = 2130706433u;
	const uint factor = 2130706431u;
	const uint r2 = 402124772u;
	uint state[24];
	for (uint i = 0u; i < 24u; ++i) state[i] = 0u;
	// Capacity: explicit OA-P2 domain and original field-element length.
	state[16u] = prime31_multiply(0x4f415032u, r2, prime, factor);
	state[17u] = prime31_multiply(push.input_elements, r2, prime, factor);
	uint cursor = 0u;
	for (uint i = 0u; i < push.input_elements; ++i) {
		uint value = storage_buffers[push.input_index].Load(row * input_stride + i * 4u) % prime;
		state[cursor] = prime31_add(state[cursor], prime31_multiply(value, r2, prime, factor), prime);
		if (++cursor == 16u) { poseidon2_koalabear24_permutation(state); cursor = 0u; }
	}
	// A mandatory delimiter block distinguishes every input length, including
	// empty and exact-rate messages. Longer outputs preserve shorter prefixes.
	state[cursor] = prime31_add(state[cursor], 33554430u, prime);
	poseidon2_koalabear24_permutation(state);
	cursor = 0u;
	for (uint i = 0u; i < push.output_elements; ++i) {
		if (cursor == 16u) { poseidon2_koalabear24_permutation(state); cursor = 0u; }
		storage_buffers[push.output_index].Store(row * output_stride + i * 4u, prime31_multiply(state[cursor++], 1u, prime, factor));
	}
}