Most byzantine fault-tolerant protocol distributed storage protocol use replication,but if the block is very huge,replication requires network width and many spaces, so its efficiency is low. Employing erasure coding makes the data block coded into fragments of the same length, then store the according fragment on corresponding node. This can save spaces and network width. Byzantine fault-tolerant erasure coded distributed storage usually requires much overhead, extra servers and versioned storage for the consistency of the data fragments. The paper optimizes for the common cases, employs novel mechanism and introduces homomorphic fingerprints. The protocol reaches the real overhead, because it requires minimal servers, least extra computation and minimal communication rounds. Furthermore, it can make timestamp no-skipping