Stefano Zacchiroli@cwebber couldn't, at least in theory, relays be organized in a cascading arrangement (à la *cough* NNTP or BBS servers back in the days *cough*), possibly hierarchically? If so, wouldn't that solve the O(n^2) problem? What am I missing? (Sure, that would result in uneven distribution times, but that's a different problem.)
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.