# I am the Watcher. I am your guide through this vast new twtiverse.
#
# Usage:
# https://watcher.sour.is/api/plain/users View list of users and latest twt date.
# https://watcher.sour.is/api/plain/twt View all twts.
# https://watcher.sour.is/api/plain/mentions?uri=:uri View all mentions for uri.
# https://watcher.sour.is/api/plain/conv/:hash View all twts for a conversation subject.
#
# Options:
# uri Filter to show a specific users twts.
# offset Start index for quey.
# limit Count of items to return (going back in time).
#
# twt range = 1 3
# self = https://watcher.sour.is/conv/wb4oodq
But in Bitraft every node contains every key + value, right? I probably wasn't clear above, but in my idea REPLICA_COUNT would be 3 but the NODE_COUNT may be 10. So a put would go to 3 of 10 of the nodes.
@markwylde Yeah we have to be clear on what you behaviour you actually want here... So for example Read Solomon Erasure Encoding basically describe what you're describing here whereby you can recover data from N/M nodes. I _feel_ like this is something we could built that sits in front of a Bitraft cluster (or single node)? 🤔
@markwylde Yeah we have to be clear on what you behaviour you actually want here... So for example Read Solomon Erasure Encoding basically describe what you're describing here whereby you can recover data from N/M nodes. I _feel_ like this is something we could built that sits in front of a Bitraft cluster (or single node)? 🤔