Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
5
Newest
 Teacher
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 4 votes cast
Feb
27
comment Stateless proof-of-work system with 0-roundtrip time
If we use more bits, like 10+ bits, we can point multiple id's to the same server, allowing for changing the server count dynamically by moving the pointers, and still have good load balance.
Feb
27
comment Stateless proof-of-work system with 0-roundtrip time
There are multiple use-cases. Established connections, UDP and QUIC are a few where this would be beneficial. It could still be encrypted, since ahead of time setup is ok.
Dec
29
awarded  Teacher
Dec
29
comment Stateless proof-of-work system with 0-roundtrip time
Simply put: if the client doesn't know what server it connects to, since they are load balanced, what should it use for the server-id field? This looks like my first example solution that fails condition 1.
Dec
29
comment Stateless proof-of-work system with 0-roundtrip time
This assumes that the client knows what server it uses, so load-balanced servers would have to share state to avoid a single request-id being used once on each server, right?
Dec
28
answered Two different keys decrypting same content
Dec
27
asked Stateless proof-of-work system with 0-roundtrip time
Aug
25
awarded  Autobiographer
Aug
1
accepted Simple proof of work example?
Aug
1
asked Simple proof of work example?
Jun
3
asked P = NP security implications
Dec
25
awarded  Supporter
May
4
awarded  Scholar
May
4
accepted Do public/private pairs work both ways?
May
4
awarded  Student
May
4
asked Do public/private pairs work both ways?