Extension of Shamir's Algorithm to GF(2^16)


in our company, we are happy users of the Shamir algorithm implementation from Vault, however, we would need to extend it to use polynomials of higher degree (specifically GF(2^16)) in order to split the secrets to more than 256 shards. We have a POC implementation of the extended algorithm ready. The algorithm is almost identical, except for the fact it is able to split only even-by lengths secrets, and it uses much larger lookup tables (originally 256 bytes per table, now 128 kbytes per table). Are you willing to take this extension of this algorithm to your repository, or is this a change you are not interested in at all?