The hash is merely a CRC32; exactly this one (polynomial 0x77073096, code is wrong)
https://web.mit.edu/freebsd/head/sys/libkern/crc32.c
(The decoded ints in the post are the constants in this CRC32).
Knowing it's a CRC32 and knowing the polynomial allows inverting the answers in log time instead of exponential time by exploiting the modular math of the polynomial rings.
Thanks! I didn't clock that - should have looked at the decrypted values!
Binwalk claims to recognize crc polynomial tables i wonder if it could find this one.
Also someone needs to integrate binwalk & ghidra, they synergize too much.
Do you have any tips on knowing how the value is a result of CRC32 and/or the polynomial/initial value used?
I know some of these words!