| Age | Commit message (Collapse) | Author |
|---|
|
|
|
Windows again
|
|
|
|
since they will need them to push auth for multicast stuff, (2) added a bunch of rate limit circuit breakers for anti-DOS, (3) cleanup.
|
|
do not handle OK packets we did not expect. This hardens up a few potential edge cases around security, since such messages might be used to e.g. pollute a cache and DOS under certain conditions.
|
|
|
|
(will be replaced with federation stuff).
|
|
|
|
|
|
network controller easier to refactor.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
std::map() overhead.
|
|
an active bridge.
|
|
|
|
and replacing it with a simple non-crypto PRNG that just uses Salsa20.
|
|
|
|
|
|
full identity of peers instead of just address.
|
|
replace txQueue list by vector for faster memory access and less allo…
|
|
|
|
|
|
|
|
behind me.
|
|
|
|
|
|
|
|
|
|
is now good enough given the small number of legacy nodes left.
|
|
|
|
|
|
toggled.
|
|
|
|
|
|
|
|
|
|
This should not affect most users, but on large networks it should cause service
announcements to work a lot better. This is the result of a prolonged discussion
with a user about the visibility of game servers on a large network. The old
multicast algorithm was de-facto randomized due to its distributed nature, while
the new algorithm is more deterministic. This will restore some randomization
beyond limit-overflow conditions.
It won't affect small networks at all.
|
|
|
|
ahead and keep track of total known peers.
|
|
refactoring, and a few other things related to multicast.
|
|
command in testnet.
|
|
only one peer.
|
