Changes between Initial Version and Version 1 of Ticket #2386


Ignore:
Timestamp:
2015-02-17T20:54:37Z (9 years ago)
Author:
warner
Comment:

add link to transverse-block-hash-tree ticket #2387

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #2386 – Description

    initial v1  
    3838* if `modify()` cannot find all N shares, perform a repair first (to get N shares), then try again
    3939* if `modify()` cannot find all N shares, download the entire file, re-encode the missing blocks, and rebuild the block-hash-trees for all shares
    40 * switch to a new encoding scheme that rotates the transverse trees (new ticket to be added describing this)
     40* switch to a new encoding scheme that rotates the transverse trees (#2387)
    4141
    4242For now, we will probably just add a precondition that asserts we've seen block-hash-tree data from all N shares during modify, so that modifying an unhealthy file will throw a sensible error. Our concern is that the code might assume it has N leaves when it actually has fewer, and could produce corrupt share-hash-trees or something unpleasant.