feat: kzg commitments over rs encoded grids

[dndll]

Description

Introduces a KZG erasure commitment scheme over 2D reed-solomon codes with perfect squares. Commits to each row in the matrix, ready for disseminating (fields, proofs) to DAS nodes. Sampling these DAS nodes, we can easily verify the proof provided and determine if the DAS node is colluding quite quickly.

With the provided interface, we can quickly drop in new schemes, such as a Homormorphic Hash based commitment scheme. This is required when we consider DAS requirements on the network.

We should, in the future, abstract away the erasure coding, as we don't always need an MDS code for efficient schemes.

I will utilise this for da-client in another PR, which also requires deciding on a trusted setup and how to commit the root to L1. We can probably get away with one root commitment, compressing the point and posting that, but needs more investigation. I've also removed the point compression as Lambdaworks might implement point compression and endianness serialization soon. Related work https://github.com/lambdaclass/lambdaworks/blob/main/crypto/src/commitments/kzg.rs#L52 & lambdaclass/lambdaworks#323

Other:

• makes blob store compile at test time
• style and formatting
• workspace dependencies for most crates

Bumps major version due to:

• blob contract optimisations
• erasure commitments