Bithack

*BitHack* makes a few changes to the way our BitSwap implementation work. From an API standpoint, the biggest change is the addition of `GetBlocks`.  `GetBlock` has been changed to be a special case call of `GetBlocks`. When `GetBlocks` is called, the keys that are requested are sent to another goroutine through a channel, where the actual requests are handled.

When a set of keys are requested, BitSwap will add them all to the wantlist, and the find providers for the first key in the list. It will then send the wantlist to those found providers.
The main bitswap loop now contains a 'timeout ticker', when it ticks, bitswap will find providers for every single key left on the wantlist and send the wantlist out to them, this is the 'plan B' as we hope that our initial request succeeds, saving us the bandwidth. This operation could be optimized to ensure only sending wantlist to a peer once per tick.

`ReceiveMessage` also was changed. Previously it would *always* return a message, which looked to me like it would cause an infinite loop of messaging between a set of peers. Im surprised we never experienced anything bad because of it.

To take advantage of this new behaviour, I modified the DAGReader to use GetBlocks to retrieve blocks for reading.
> I'm not convinced that checking errors by value is the safest/most robust thing to do.

I agree. I still dont know what TRTTD is. I wonder if maybe type switching on errors: 

```Go
if err != nil {
  switch err.(type) {
  case FooErr:
    panic("oh no, a Foo")
  default:
    panic("probably a bar")
  }
}
```

> and we may want to query the Exchange _any_ time the datastore comes up empty, no?

Isn't that what the condition says? `ds.ErrNotFound` is when the datastore comes up empty. s.Remote != nil is a check just to make sure there is an exchange i think.