Addendum to "Low-Overhead Byzantine Fault-Tolerant Storage"
------

This page describes typos and omissions from my SOSP 2007 paper titled
"Low-Overhead Byzantine Fault-Tolerant Storage."  These were missed by 
several proofreaders because they are of minor importance, and I will 
fix them in my thesis.  If you find a typo or mistake, please send me 
an email: jimi+web@cs.cmu.edu.  Feel free to mail me if you have any 
questions or comments.

     - James


1) Section 3.1.1, top of page 4, first complete sentence:
  "Hence, encoding 2f+1 fragments requires computing f+1 values, whereas
  encoding 4f+1 fragments (as in PASIS) requires computing 3f+1 values."
Should read:
  "Hence, encoding 2f+1 fragments requires computing f values, whereas
  encoding 4f+1 fragments (as in PASIS) requires computing 3f values."

2) Garbage collection for when a writer sends a fragment to a storage 
node that assigns a higher timestamp but does not return a timely
response is not described.  (This is a rare case.)

3) Section 3.5.  Both subheadings have typos and inadequate descriptions.
Sorry.  Because  I expect that this section is of marginal interest, I 
do not expect to publish corrections until my thesis.