-
Type: Bug
-
Resolution: Fixed
-
Priority: Major - P3
-
Affects Version/s: None
-
Component/s: None
-
Labels:None
-
Fully Compatible
-
ALL
-
-
Query Execution 2021-05-03
-
28
The test is inherently subject to randomness, since it is testing our random sampling implementation. It intends to make assertions based on the probably of an event being miniscule. However, this assertion can fail with non-negligible probability. I've shown experimentally that the probability of this assertion failing strictly due to randomness is >0.1%. Since this test will indeed run thousands of times, the probably of failure needs to be many orders of magnitude lower.
In order to pass as currently written, the ARHASH algorithm needs to obtain 5 valid samples in 100 iterations. The buckets are 1% full, so the likelihood of a single iteration obtaining a valid document is ~1%. Getting 5 hits in 100 attempts is apparently not as unlikely as it needs to be!