βοΈopML
Securing AI/ML Inference through Optimistic Fraud Proof Technology
Optimistic Machine Learning (opML)
Optimistic machine learning is another solution to decentralizing AI inference, with βoptimisticβ referring to the idea of optimistically trusting the results of an inference unless (or until) someone challenges the result.
In the event of a challenge, the challenger first puts up a financial stake and a verification game is played, where a bisection protocol is used to locate the disputed step that caused the divergence in computation. The arbitrator contract resolves the challenge, heavily slashing the inference computer or the challenger depending on the success or failure of the challenge respectively.
This optimistic security model comes with both pros and cons compared to zkML. The biggest advantage is the lower time/computational cost that comes with adopting a model that doesnβt generate a proof on every inference, which is significantly lower especially with larger models where both the inference and proof generation can be extremely expensive. However, the biggest disadvantage is the lack of the immediate cryptographic security that zkML offers that high-stakes use-cases may require.
Last updated