Vitalik Buterin: 激励用例： https://t.co/fD4GM2GNqb 引用@VitalikButerin 的推文： @domothy 通过使 32 字节块一对一映射到 F_p 元素，一个真正有效的解决方案实际上可以显着简化以太坊中的 Verkle 树、纠删码和许多其他结构。

Quoted tweet from @VitalikButerin:

@domothy A really efficient solution could actually significantly simplify Verkle trees, erasure codes and many other constructions in ethereum, by making 32-byte chunks one-to-one mappable to F_p elements.