Vladislav

Have we found a cause for this? I'm not sure because the spike is on master, we solved a bug for the replica...

I assume it's no longer relevant given we're rewritten transaction

```rust use std::io::BufRead; use std::iter; use rand::seq::SliceRandom; use rand::thread_rng; fn run(n: usize, m: usize, total: usize) { let mut res = vec![0; m]; let mut basevec = Vec::new(); for s...

n shards, top m are requested x - axis - number of shards, one plot for different m values blue - 99th percentile, if we pick that number for m...

@royjacobson if you like math you're welcomed to join me! 🎩 I tried using it (I studied Probability theory for a year!! 😆 ) but it quickly became evident that...

The next optimization is for structured search. Approaching this problem very simply and trying to find a very reliable upper bound Given an query with `LIMIT m` on `n` shards,...

The blue line is again the 99th percentile. It means that if we got `x` results on some shard, we can assume that all shards will have at least `y`...

> I don't think it's super tight It's not a tight bound at all, but I think it's still interesting. True. Its not so much about the tightest formula now,...

> I am curious, why do you choose writing scripts in rust? Do you find it more convenient? It would take ages in Python, etc. So I can only write...

> I want those scripts somewhere in our repos! Besides the algorithmic side, they can be helpful to learn (copy paste) when we need to generate graphs. I can re-write...