>Because any node will answer a GET request, and nodes may "fall behind" updates, stale reads are possible. Again, hraftd is a simple program, for the purpose o

>Because any node will answer a GET request, and nodes may "fall behind" updates, stale reads are possible. Again, hraftd is a simple program, for the purpose of demonstrating a distributed key-value store. These shortcomings can be addressed by enhancements to the existing source. Late to the conversation, but would you mind updating the README to elaborate upon this? I'm looking for the simplest implementation of Raft but need to be certain that I'm getting the "most recent" value for a key (in other words the last value that passed consensus). I'd like to be able to either: 1) turn on that functionality without modifying the code 2) see a code snippet that achieves it by reading from some number of nodes or whatever 3) be directed to a link explaining if/why it's not possible Otherwise, cool project, congrats!