Optimization: When possible, bail out early when quorum achieved
The beating heart of all consensus based distributed algorithms is to scatter a computation across multiple nodes, then to gather their results, then to evaluate whether quorum is achieved.
In some cases, _quorum_ requires gathering all of the nodes' results (e.g., interrogating all nodes for a maximum value for a variable).
But in other cases, _quorum_ requires gathering only `n // 2 + 1` nodes' results (e.g., figuring out if > 50% of nodes believe that I'm the owner of a lock).
Implement the logic to "bail out" early when possible, in the latter case.
What's Changed
* When possible, bail out early when quorum achieved by brainix in https://github.com/brainix/pottery/pull/286
* Bump version number by brainix in https://github.com/brainix/pottery/pull/287
**Full Changelog**: https://github.com/brainix/pottery/compare/v1.0.6...v1.0.7