Roman Gershman

ah it is the new version! so this is what does not make sense: ``` 53: I20231114 08:55:27.805414 25787 scheduler.cc:713] ------------ Fiber (sleeping until 1653020645721 now is 1652362959190) ```

we detect the deadlock after 120s: ``` 08:53:27 GMT 53: [ RUN ] ZSetFamilyTest.BlockingTimeout Tue, 14 Nov 2023 08:55:27 GMT 53: E20231114 08:55:27.455155 25789 test_utils.cc:225] Deadlock detected!!!! ``` but the...

7% look a lot for something that does not even defrag anything.

1. I am curious, why do you choose writing scripts in rust? Do you find it more convenient? 2. You may relax the requirement of non-communication. You can make `k`...

Your approach is very good! Did you think of it yourself or you read a paper? Seems like something that worthy publishing in academic literature.

1. I did not understand the code (and not because I do not understand rust) - i understand each line but hardly understand the intent. Could you add comments? 2....

I do not understand your last comment. Suppose we want to receive `m=160` via `n=10` shards. Lowest bound you can fetch is `16` and highest obviously `160`. In your formalisation...

I am sorry, I am like 10 steps behind you 😄 `So for n=16 and m=160, we can be 99% sure that each shard has 16 entries if we found...

I do not know if this helps or not but I asked this question on math exchange: https://math.stackexchange.com/questions/4773766/estimate-total-balls-based-on-the-ball-count-in-a-bin

You are doing the simulation of balls into bins problem: https://en.wikipedia.org/wiki/Balls_into_bins_problem#Random_allocation