# Accelerate OP Fault Proof via EIP-4844-Powered Multi-Section Dispute Game

- Channel: [EthPrague](https://streameth.org/ethprague)
- Date: 2024-06-01
- Duration: 26:10
- Watch: https://streameth.org/watch/665833d3036a981493b0bfb1
- Download: https://vod-cdn.lp-playback.studio/raw/jxf4iblf6wlsyor6526t4tcmtmqa/catalyst-vod-com/hls/223103nmgo34efca/1080p0.mp4

## Description

In this talk, we present an approach to significantly expedite the fault-proof dispute by implementing a multi-section search approach. In contrast to the current bi-section game, which demands log2(N) moves to identify the final disputable step, the K-section game (where K > 2) diminishes the moves to logK(N). However, in the K-section game, each player (defender/attacker) must publish a K-1 VM state hashes on-chain for each move. The introduction of EIP-4844 facilitates a substantial reduction in this cost through the utilization of EIP-4844 Binary Large Object (BLOB), capable of accommodating K=4096 VM hashes per BLOB. Consequently, for an N=2^48 game, the game can be condensed to 4 moves from the original 48 moves. This will significantly decrease the time elapsed for a fault-proof dispute game, from 2-3 days to a couple of hours.