updating unhealthy MDMF files: likely problem #2386

Open
opened 2015-02-17 19:45:53 +00:00 by warner · 1 comment

While studying #2034 at today's meeting, we identified a probable design flaw in the way that optimized MDMF updates are supposed to work. The consequence is that, when updating a single block of large MDMF file, it is necessary to retrieve data from all possible shares. If any shares are unrecoverable, the file cannot be updated correctly.

Ideally, for any mutable file, if you can retrieve 'k' (or more) shares, you should be able to produce new versions of each share that you could retrieve. In addition, the MDMF-specific efficiency goal is you should only need to fetch O(deltasize) bytes from each share (proportional to the size of the modification you're making, quantized by segment size).

But because of this flaw, the updater must either fetch O(filesize) data (e.g. the whole share) from 'k' shares, or it must fetch a small amount (O(log(filesize))) from all 'N' shares.

We haven't confirmed it yet, but the current implementation probably assumes that it has fetched data from all 'N' shares, and thus updating an "unhealthy" file is likely to fail. Note that repairing the file first should fix this, since after repair, all N shares will be available to the updater. But ideally any change to a mutable file will automatically repair it.

Tahoe's Transverse Hash Trees: A Refresher

When encoding files, Tahoe starts by encrypting the file, then breaking it up into "numsegs" segments (typically 128KiB each). Each segment is then erasure-coded into blocks, one for each of the N shares that the encoding settings dictate (so there will be numsegs*N blocks total). All of the blocks for a given share are concatenated together: this makes up the bulk of the share that will be delivered to a server. The rest of the share contains verification data used to detect corruption of those blocks.

For each share, the block hash tree is a Merkle hash tree whose leaves are the hashes of each block. The block-hash-tree has numsegs leaves (padded up to a power of two, as usual for Merkle trees). There is one block-hash-tree per share, and each one is different. Each share has a different block-hash-tree-root. The entire block-hash-tree, including its root, is stored in the share.

The block-hash-tree-roots, one per share, are used as the leaves of the share hash tree. The share-hash-tree has N leaves (padded again). Each share includes the share-hash-tree "Merkle chain", sometimes called the "uncle chain", which is the O(log(N)) subset of hash-tree nodes necessary to validate the leaf (the block-hash-tree-root for that share).

In immutable files, the share-hash-tree-root is included in the "UEB" (URI Extension Block), which is replicated into every share. The hash of the UEB is put into the filecap. With this UEB hash, you can verify every bit of every block of every share, and thus detect file corruption (and use an alternate share). For mutable files, the share-hash-tree-root is included in the RSA-signed block of data (next to the sequence number), providing the same kind of integrity checking. This signed block is replicated into every share.

Imagine the file as a line of data sitting on a table, extending sideways into the X axis. Chop it up into segments. Now erasure-code each segment into blocks, which extend sideways into the Y axis. Each share is a line in the X axis, sitting on the table, paralleling the original file. Each block-hash-tree is a pointy-on-top triangle that lives in the X+Z plane, extending upwards from the blocks that make up the share, culminating in the block-hash-tree-root. The share-hash-tree triangle lives above that in the Y+Z plane: its leaves are the block-hash-tree-roots, and it culminates in the share-hash-tree-root.

Rebuilding the Hash Trees During Update

MDMF encrypts each segment independently, with a new salt. So any modification to the file results in at least one encrypted segment being modified, which means every share has a modified block, which means the uncle chain in every block-hash-tree is changed, and every block-hash-tree-root is changed, so the entire share-hash-tree is changed, finally leading to a new share-hash-tree-root.

MDMF's performance goal is to only require O(deltasize) bandwidth for making file modifications. The main work is to read-decrypt-modify-encrypt-write the handful of segments that cover the plaintext being changed. That part is fine. However, we also have to publish new integrity-checking data that matches the modified blocks.

Given e.g. share number 2. The mutable-modify code can download the entire block-hash-tree from sh2 without retrieving the blocks themselves. For each modified block, it can update the corresponding block-hash-tree leaves, and recompute the tree. This updated tree (which will only differ along the uncle chain) can be published along with the rest of the share. So far, so good.

But to rebuild the share-hash-tree, we need the block-hash-tree-root from all N shares. And since we're modifying a block (in every share), we're recomputing all the block-hash-trees. So, to be specific, we need the block-hash-tree uncle-chain for all N shares. This is N*O(ln(filesize)) data, and meets our performance goals.

But this only works in the ideal case, where we were able to locate all N shares. We want this case anyways, because it means we can probably update all N shares, which gives us maximum redundancy and doesn't leave any old versions lying around (where they might confuse somebody into retrieving stale data).

If the file wasn't completely healthy, we might not be able to get all N shares. Retrieving merely 'k' shares is enough to read the file, and it would be nice if that were also enough to modify the file.

Options

  • if modify() cannot find all N shares, perform a repair first (to get N shares), then try again
  • 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
  • switch to a new encoding scheme that rotates the transverse trees (#2387)

For 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.

Triggering a repair is probably the easiest short-term fix. Downloading the entire file would be a drag, and a significant architectural change. A new encoding scheme would be a lot of work, and would probably only fix this one problems.

While studying #2034 at today's meeting, we identified a probable design flaw in the way that optimized MDMF updates are supposed to work. The consequence is that, when updating a single block of large MDMF file, it is necessary to retrieve data from all possible shares. If any shares are unrecoverable, the file cannot be updated correctly. Ideally, for any mutable file, if you can retrieve 'k' (or more) shares, you should be able to produce new versions of each share that you could retrieve. In addition, the MDMF-specific efficiency goal is you should only need to fetch `O(deltasize)` bytes from each share (proportional to the size of the modification you're making, quantized by segment size). But because of this flaw, the updater must either fetch `O(filesize)` data (e.g. the whole share) from 'k' shares, or it must fetch a small amount (`O(log(filesize))`) from all 'N' shares. We haven't confirmed it yet, but the current implementation probably assumes that it has fetched data from all 'N' shares, and thus updating an "unhealthy" file is likely to fail. Note that repairing the file first should fix this, since after repair, all N shares will be available to the updater. But ideally any change to a mutable file will automatically repair it. ## Tahoe's Transverse Hash Trees: A Refresher When encoding files, Tahoe starts by encrypting the file, then breaking it up into "numsegs" **segments** (typically 128KiB each). Each segment is then erasure-coded into **blocks**, one for each of the N shares that the encoding settings dictate (so there will be `numsegs*N` blocks total). All of the blocks for a given share are concatenated together: this makes up the bulk of the share that will be delivered to a server. The rest of the share contains verification data used to detect corruption of those blocks. For each share, the **block hash tree** is a Merkle hash tree whose leaves are the hashes of each block. The block-hash-tree has `numsegs` leaves (padded up to a power of two, as usual for Merkle trees). There is one block-hash-tree per share, and each one is different. Each share has a different **block-hash-tree-root**. The entire block-hash-tree, including its root, is stored in the share. The block-hash-tree-roots, one per share, are used as the leaves of the **share hash tree**. The share-hash-tree has `N` leaves (padded again). Each share includes the share-hash-tree "Merkle chain", sometimes called the "uncle chain", which is the `O(log(N))` subset of hash-tree nodes necessary to validate the leaf (the block-hash-tree-root for that share). In immutable files, the **share-hash-tree-root** is included in the "UEB" (URI Extension Block), which is replicated into every share. The hash of the UEB is put into the filecap. With this UEB hash, you can verify every bit of every block of every share, and thus detect file corruption (and use an alternate share). For mutable files, the share-hash-tree-root is included in the RSA-signed block of data (next to the sequence number), providing the same kind of integrity checking. This signed block is replicated into every share. Imagine the file as a line of data sitting on a table, extending sideways into the X axis. Chop it up into segments. Now erasure-code each segment into blocks, which extend sideways into the Y axis. Each share is a line in the X axis, sitting on the table, paralleling the original file. Each block-hash-tree is a pointy-on-top triangle that lives in the X+Z plane, extending upwards from the blocks that make up the share, culminating in the block-hash-tree-root. The share-hash-tree triangle lives above that in the Y+Z plane: its leaves are the block-hash-tree-roots, and it culminates in the share-hash-tree-root. ## Rebuilding the Hash Trees During Update MDMF encrypts each segment independently, with a new salt. So any modification to the file results in at least one encrypted segment being modified, which means every share has a modified block, which means the uncle chain in every block-hash-tree is changed, and every block-hash-tree-root is changed, so the entire share-hash-tree is changed, finally leading to a new share-hash-tree-root. MDMF's performance goal is to only require `O(deltasize)` bandwidth for making file modifications. The main work is to read-decrypt-modify-encrypt-write the handful of segments that cover the plaintext being changed. That part is fine. However, we also have to publish new integrity-checking data that matches the modified blocks. Given e.g. share number 2. The mutable-modify code can download the entire block-hash-tree from sh2 without retrieving the blocks themselves. For each modified block, it can update the corresponding block-hash-tree leaves, and recompute the tree. This updated tree (which will only differ along the uncle chain) can be published along with the rest of the share. So far, so good. But to rebuild the share-hash-tree, we need the block-hash-tree-root from *all N shares*. And since we're modifying a block (in every share), we're recomputing all the block-hash-trees. So, to be specific, we need the block-hash-tree uncle-chain for all N shares. This is `N*O(ln(filesize))` data, and meets our performance goals. But this only works in the ideal case, where we were able to locate all N shares. We want this case anyways, because it means we can probably *update* all N shares, which gives us maximum redundancy and doesn't leave any old versions lying around (where they might confuse somebody into retrieving stale data). If the file wasn't completely healthy, we might not be able to get all N shares. Retrieving merely 'k' shares is enough to read the file, and it would be nice if that were also enough to modify the file. ## Options * if `modify()` cannot find all N shares, perform a repair first (to get N shares), then try again * 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 * switch to a new encoding scheme that rotates the transverse trees (#2387) For 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. Triggering a repair is probably the easiest short-term fix. Downloading the entire file would be a drag, and a significant architectural change. A new encoding scheme would be a lot of work, and would probably only fix this one problems.
warner added the
c/code-mutable
p/normal
t/defect
v/1.10.0
labels 2015-02-17 19:45:53 +00:00
warner added this to the undecided milestone 2015-02-17 19:45:53 +00:00
Author

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

add link to transverse-block-hash-tree ticket #2387
Sign in to join this conversation.
No labels
c/code
c/code-dirnodes
c/code-encoding
c/code-frontend
c/code-frontend-cli
c/code-frontend-ftp-sftp
c/code-frontend-magic-folder
c/code-frontend-web
c/code-mutable
c/code-network
c/code-nodeadmin
c/code-peerselection
c/code-storage
c/contrib
c/dev-infrastructure
c/docs
c/operational
c/packaging
c/unknown
c/website
kw:2pc
kw:410
kw:9p
kw:ActivePerl
kw:AttributeError
kw:DataUnavailable
kw:DeadReferenceError
kw:DoS
kw:FileZilla
kw:GetLastError
kw:IFinishableConsumer
kw:K
kw:LeastAuthority
kw:Makefile
kw:RIStorageServer
kw:StringIO
kw:UncoordinatedWriteError
kw:about
kw:access
kw:access-control
kw:accessibility
kw:accounting
kw:accounting-crawler
kw:add-only
kw:aes
kw:aesthetics
kw:alias
kw:aliases
kw:aliens
kw:allmydata
kw:amazon
kw:ambient
kw:annotations
kw:anonymity
kw:anonymous
kw:anti-censorship
kw:api_auth_token
kw:appearance
kw:appname
kw:apport
kw:archive
kw:archlinux
kw:argparse
kw:arm
kw:assertion
kw:attachment
kw:auth
kw:authentication
kw:automation
kw:avahi
kw:availability
kw:aws
kw:azure
kw:backend
kw:backoff
kw:backup
kw:backupdb
kw:backward-compatibility
kw:bandwidth
kw:basedir
kw:bayes
kw:bbfreeze
kw:beta
kw:binaries
kw:binutils
kw:bitcoin
kw:bitrot
kw:blacklist
kw:blocker
kw:blocks-cloud-deployment
kw:blocks-cloud-merge
kw:blocks-magic-folder-merge
kw:blocks-merge
kw:blocks-raic
kw:blocks-release
kw:blog
kw:bom
kw:bonjour
kw:branch
kw:branding
kw:breadcrumbs
kw:brians-opinion-needed
kw:browser
kw:bsd
kw:build
kw:build-helpers
kw:buildbot
kw:builders
kw:buildslave
kw:buildslaves
kw:cache
kw:cap
kw:capleak
kw:captcha
kw:cast
kw:centos
kw:cffi
kw:chacha
kw:charset
kw:check
kw:checker
kw:chroot
kw:ci
kw:clean
kw:cleanup
kw:cli
kw:cloud
kw:cloud-backend
kw:cmdline
kw:code
kw:code-checks
kw:coding-standards
kw:coding-tools
kw:coding_tools
kw:collection
kw:compatibility
kw:completion
kw:compression
kw:confidentiality
kw:config
kw:configuration
kw:configuration.txt
kw:conflict
kw:connection
kw:connectivity
kw:consistency
kw:content
kw:control
kw:control.furl
kw:convergence
kw:coordination
kw:copyright
kw:corruption
kw:cors
kw:cost
kw:coverage
kw:coveralls
kw:coveralls.io
kw:cpu-watcher
kw:cpyext
kw:crash
kw:crawler
kw:crawlers
kw:create-container
kw:cruft
kw:crypto
kw:cryptography
kw:cryptography-lib
kw:cryptopp
kw:csp
kw:curl
kw:cutoff-date
kw:cycle
kw:cygwin
kw:d3
kw:daemon
kw:darcs
kw:darcsver
kw:database
kw:dataloss
kw:db
kw:dead-code
kw:deb
kw:debian
kw:debug
kw:deep-check
kw:defaults
kw:deferred
kw:delete
kw:deletion
kw:denial-of-service
kw:dependency
kw:deployment
kw:deprecation
kw:desert-island
kw:desert-island-build
kw:design
kw:design-review-needed
kw:detection
kw:dev-infrastructure
kw:devpay
kw:directory
kw:directory-page
kw:dirnode
kw:dirnodes
kw:disconnect
kw:discovery
kw:disk
kw:disk-backend
kw:distribute
kw:distutils
kw:dns
kw:do_http
kw:doc-needed
kw:docker
kw:docs
kw:docs-needed
kw:dokan
kw:dos
kw:download
kw:downloader
kw:dragonfly
kw:drop-upload
kw:duplicity
kw:dusty
kw:earth-dragon
kw:easy
kw:ec2
kw:ecdsa
kw:ed25519
kw:egg-needed
kw:eggs
kw:eliot
kw:email
kw:empty
kw:encoding
kw:endpoint
kw:enterprise
kw:enum34
kw:environment
kw:erasure
kw:erasure-coding
kw:error
kw:escaping
kw:etag
kw:etch
kw:evangelism
kw:eventual
kw:example
kw:excess-authority
kw:exec
kw:exocet
kw:expiration
kw:extensibility
kw:extension
kw:failure
kw:fedora
kw:ffp
kw:fhs
kw:figleaf
kw:file
kw:file-descriptor
kw:filename
kw:filesystem
kw:fileutil
kw:fips
kw:firewall
kw:first
kw:floatingpoint
kw:flog
kw:foolscap
kw:forward-compatibility
kw:forward-secrecy
kw:forwarding
kw:free
kw:freebsd
kw:frontend
kw:fsevents
kw:ftp
kw:ftpd
kw:full
kw:furl
kw:fuse
kw:garbage
kw:garbage-collection
kw:gateway
kw:gatherer
kw:gc
kw:gcc
kw:gentoo
kw:get
kw:git
kw:git-annex
kw:github
kw:glacier
kw:globalcaps
kw:glossary
kw:google-cloud-storage
kw:google-drive-backend
kw:gossip
kw:governance
kw:grid
kw:grid-manager
kw:gridid
kw:gridsync
kw:grsec
kw:gsoc
kw:gvfs
kw:hackfest
kw:hacktahoe
kw:hang
kw:hardlink
kw:heartbleed
kw:heisenbug
kw:help
kw:helper
kw:hint
kw:hooks
kw:how
kw:how-to
kw:howto
kw:hp
kw:hp-cloud
kw:html
kw:http
kw:https
kw:i18n
kw:i2p
kw:i2p-collab
kw:illustration
kw:image
kw:immutable
kw:impressions
kw:incentives
kw:incident
kw:init
kw:inlineCallbacks
kw:inotify
kw:install
kw:installer
kw:integration
kw:integration-test
kw:integrity
kw:interactive
kw:interface
kw:interfaces
kw:interoperability
kw:interstellar-exploration
kw:introducer
kw:introduction
kw:iphone
kw:ipkg
kw:iputil
kw:ipv6
kw:irc
kw:jail
kw:javascript
kw:joke
kw:jquery
kw:json
kw:jsui
kw:junk
kw:key-value-store
kw:kfreebsd
kw:known-issue
kw:konqueror
kw:kpreid
kw:kvm
kw:l10n
kw:lae
kw:large
kw:latency
kw:leak
kw:leasedb
kw:leases
kw:libgmp
kw:license
kw:licenss
kw:linecount
kw:link
kw:linux
kw:lit
kw:localhost
kw:location
kw:locking
kw:logging
kw:logo
kw:loopback
kw:lucid
kw:mac
kw:macintosh
kw:magic-folder
kw:manhole
kw:manifest
kw:manual-test-needed
kw:map
kw:mapupdate
kw:max_space
kw:mdmf
kw:memcheck
kw:memory
kw:memory-leak
kw:mesh
kw:metadata
kw:meter
kw:migration
kw:mime
kw:mingw
kw:minimal
kw:misc
kw:miscapture
kw:mlp
kw:mock
kw:more-info-needed
kw:mountain-lion
kw:move
kw:multi-users
kw:multiple
kw:multiuser-gateway
kw:munin
kw:music
kw:mutability
kw:mutable
kw:mystery
kw:names
kw:naming
kw:nas
kw:navigation
kw:needs-review
kw:needs-spawn
kw:netbsd
kw:network
kw:nevow
kw:new-user
kw:newcaps
kw:news
kw:news-done
kw:news-needed
kw:newsletter
kw:newurls
kw:nfc
kw:nginx
kw:nixos
kw:no-clobber
kw:node
kw:node-url
kw:notification
kw:notifyOnDisconnect
kw:nsa310
kw:nsa320
kw:nsa325
kw:numpy
kw:objects
kw:old
kw:openbsd
kw:openitp-packaging
kw:openssl
kw:openstack
kw:opensuse
kw:operation-helpers
kw:operational
kw:operations
kw:ophandle
kw:ophandles
kw:ops
kw:optimization
kw:optional
kw:options
kw:organization
kw:os
kw:os.abort
kw:ostrom
kw:osx
kw:osxfuse
kw:otf-magic-folder-objective1
kw:otf-magic-folder-objective2
kw:otf-magic-folder-objective3
kw:otf-magic-folder-objective4
kw:otf-magic-folder-objective5
kw:otf-magic-folder-objective6
kw:p2p
kw:packaging
kw:partial
kw:password
kw:path
kw:paths
kw:pause
kw:peer-selection
kw:performance
kw:permalink
kw:permissions
kw:persistence
kw:phone
kw:pickle
kw:pip
kw:pipermail
kw:pkg_resources
kw:placement
kw:planning
kw:policy
kw:port
kw:portability
kw:portal
kw:posthook
kw:pratchett
kw:preformance
kw:preservation
kw:privacy
kw:process
kw:profile
kw:profiling
kw:progress
kw:proxy
kw:publish
kw:pyOpenSSL
kw:pyasn1
kw:pycparser
kw:pycrypto
kw:pycrypto-lib
kw:pycryptopp
kw:pyfilesystem
kw:pyflakes
kw:pylint
kw:pypi
kw:pypy
kw:pysqlite
kw:python
kw:python3
kw:pythonpath
kw:pyutil
kw:pywin32
kw:quickstart
kw:quiet
kw:quotas
kw:quoting
kw:raic
kw:rainhill
kw:random
kw:random-access
kw:range
kw:raspberry-pi
kw:reactor
kw:readonly
kw:rebalancing
kw:recovery
kw:recursive
kw:redhat
kw:redirect
kw:redressing
kw:refactor
kw:referer
kw:referrer
kw:regression
kw:rekey
kw:relay
kw:release
kw:release-blocker
kw:reliability
kw:relnotes
kw:remote
kw:removable
kw:removable-disk
kw:rename
kw:renew
kw:repair
kw:replace
kw:report
kw:repository
kw:research
kw:reserved_space
kw:response-needed
kw:response-time
kw:restore
kw:retrieve
kw:retry
kw:review
kw:review-needed
kw:reviewed
kw:revocation
kw:roadmap
kw:rollback
kw:rpm
kw:rsa
kw:rss
kw:rst
kw:rsync
kw:rusty
kw:s3
kw:s3-backend
kw:s3-frontend
kw:s4
kw:same-origin
kw:sandbox
kw:scalability
kw:scaling
kw:scheduling
kw:schema
kw:scheme
kw:scp
kw:scripts
kw:sdist
kw:sdmf
kw:security
kw:self-contained
kw:server
kw:servermap
kw:servers-of-happiness
kw:service
kw:setup
kw:setup.py
kw:setup_requires
kw:setuptools
kw:setuptools_darcs
kw:sftp
kw:shared
kw:shareset
kw:shell
kw:signals
kw:simultaneous
kw:six
kw:size
kw:slackware
kw:slashes
kw:smb
kw:sneakernet
kw:snowleopard
kw:socket
kw:solaris
kw:space
kw:space-efficiency
kw:spam
kw:spec
kw:speed
kw:sqlite
kw:ssh
kw:ssh-keygen
kw:sshfs
kw:ssl
kw:stability
kw:standards
kw:start
kw:startup
kw:static
kw:static-analysis
kw:statistics
kw:stats
kw:stats_gatherer
kw:status
kw:stdeb
kw:storage
kw:streaming
kw:strports
kw:style
kw:stylesheet
kw:subprocess
kw:sumo
kw:survey
kw:svg
kw:symlink
kw:synchronous
kw:tac
kw:tahoe-*
kw:tahoe-add-alias
kw:tahoe-admin
kw:tahoe-archive
kw:tahoe-backup
kw:tahoe-check
kw:tahoe-cp
kw:tahoe-create-alias
kw:tahoe-create-introducer
kw:tahoe-debug
kw:tahoe-deep-check
kw:tahoe-deepcheck
kw:tahoe-lafs-trac-stream
kw:tahoe-list-aliases
kw:tahoe-ls
kw:tahoe-magic-folder
kw:tahoe-manifest
kw:tahoe-mkdir
kw:tahoe-mount
kw:tahoe-mv
kw:tahoe-put
kw:tahoe-restart
kw:tahoe-rm
kw:tahoe-run
kw:tahoe-start
kw:tahoe-stats
kw:tahoe-unlink
kw:tahoe-webopen
kw:tahoe.css
kw:tahoe_files
kw:tahoewapi
kw:tarball
kw:tarballs
kw:tempfile
kw:templates
kw:terminology
kw:test
kw:test-and-set
kw:test-from-egg
kw:test-needed
kw:testgrid
kw:testing
kw:tests
kw:throttling
kw:ticket999-s3-backend
kw:tiddly
kw:time
kw:timeout
kw:timing
kw:to
kw:to-be-closed-on-2011-08-01
kw:tor
kw:tor-protocol
kw:torsocks
kw:tox
kw:trac
kw:transparency
kw:travis
kw:travis-ci
kw:trial
kw:trickle
kw:trivial
kw:truckee
kw:tub
kw:tub.location
kw:twine
kw:twistd
kw:twistd.log
kw:twisted
kw:twisted-14
kw:twisted-trial
kw:twitter
kw:twn
kw:txaws
kw:type
kw:typeerror
kw:ubuntu
kw:ucwe
kw:ueb
kw:ui
kw:unclean
kw:uncoordinated-writes
kw:undeletable
kw:unfinished-business
kw:unhandled-error
kw:unhappy
kw:unicode
kw:unit
kw:unix
kw:unlink
kw:update
kw:upgrade
kw:upload
kw:upload-helper
kw:uri
kw:url
kw:usability
kw:use-case
kw:utf-8
kw:util
kw:uwsgi
kw:ux
kw:validation
kw:variables
kw:vdrive
kw:verify
kw:verlib
kw:version
kw:versioning
kw:versions
kw:video
kw:virtualbox
kw:virtualenv
kw:vista
kw:visualization
kw:visualizer
kw:vm
kw:volunteergrid2
kw:volunteers
kw:vpn
kw:wapi
kw:warners-opinion-needed
kw:warning
kw:weapi
kw:web
kw:web.port
kw:webapi
kw:webdav
kw:webdrive
kw:webport
kw:websec
kw:website
kw:websocket
kw:welcome
kw:welcome-page
kw:welcomepage
kw:wiki
kw:win32
kw:win64
kw:windows
kw:windows-related
kw:winscp
kw:workaround
kw:world-domination
kw:wrapper
kw:write-enabler
kw:wui
kw:x86
kw:x86-64
kw:xhtml
kw:xml
kw:xss
kw:zbase32
kw:zetuptoolz
kw:zfec
kw:zookos-opinion-needed
kw:zope
kw:zope.interface
p/blocker
p/critical
p/major
p/minor
p/normal
p/supercritical
p/trivial
r/cannot reproduce
r/duplicate
r/fixed
r/invalid
r/somebody else's problem
r/was already fixed
r/wontfix
r/worksforme
t/defect
t/enhancement
t/task
v/0.2.0
v/0.3.0
v/0.4.0
v/0.5.0
v/0.5.1
v/0.6.0
v/0.6.1
v/0.7.0
v/0.8.0
v/0.9.0
v/1.0.0
v/1.1.0
v/1.10.0
v/1.10.1
v/1.10.2
v/1.10a2
v/1.11.0
v/1.12.0
v/1.12.1
v/1.13.0
v/1.14.0
v/1.15.0
v/1.15.1
v/1.2.0
v/1.3.0
v/1.4.1
v/1.5.0
v/1.6.0
v/1.6.1
v/1.7.0
v/1.7.1
v/1.7β
v/1.8.0
v/1.8.1
v/1.8.2
v/1.8.3
v/1.8β
v/1.9.0
v/1.9.0-s3branch
v/1.9.0a1
v/1.9.0a2
v/1.9.0b1
v/1.9.1
v/1.9.2
v/1.9.2a1
v/cloud-branch
v/unknown
No milestone
No project
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference: tahoe-lafs/trac#2386
No description provided.