Infinite dubs theory

A demonstration of infinite dubs.

Infinite dubs theory is when a thread gets infinite dubs on every reppey, causing endless dub-checking and creating an indestructible PPH farm.

The process

• OP's post gets dubs
• This causes dub-checking
• Every dub-check gets dubs
• All other reppeys get dubs

How many posts till the next dubs, formula

We are looking for the amount of posts until the next dub given the current post number, first, we have to understand there are 2 parameters at play, q, your current post number, and n, the range (ie if n equal to 2 then the dub would end in 11,22,33… for n equal to 3 it’s 111, 222,333…).

we define

$E(n)=\sum _{i=0}^{n-1}10^i$

Let us do this intuitively

let q equal to 384817 and n equal to 3

let us dissect q

$q1=floor(q/10^n)*10^n=384000$

$q2=q-q1=817$

if we do mod(q2,E(n)) it gives us mod(817,111) equal to 40

logically, q2-mod(q2,E(n)) is dividable by $E(n)$

817-40 equal to 777

if we add E(n)

$q2-mod(q2,E(n))+E(n)$

gives us 888

adding q1

$q1+q2-mod(q2,E(n))+E(n)=384888$

$q1+q-q1-mod(q-q1,E(n))+E(n)$

$q1=floor(q/10^n)*10^n$

$nextdub=q-mod(q-q1,E(n))+E(n)$

With q the post number, n the range, $D(q,n)$ the distance between the next dub

$D(q,n)=\sum _{i=0}^{n-1}10^i-mod(q-floor(q/10^n)*10^n,\sum _{i=0}^{n-1}10^i)$

Python script

q=828347391
n=6
def E(n):
    re=0
    for i in range(0,n):
        re+=10**i
    return re
print(E(n)-((q-floor(q/10**n)*10**n) % E(n)))

Probability of getting a dub

First, you need to obtain W, W being the current post number uncertainty. IE, given two posts being posted at the same time, what is the maximum difference in post number. For this, you can post two posts at the same time, and apply the difference between the two post numbers. You should measure it when the dub is about to happen (2-3 minutes o algo).

Assume you post your post a, when the latest post number is q. then $q+1<\le a\le q+w$

given d the dub. if $d\in [q+1,q+w]$ then the probability of getting the dub is equal to one over how many possible post numbers, thence $P=\frac{1}{w}$

Therefore: Given q the last post number before immediately posting, w the current post number uncertainty, and d the dub, the probability of getting the dub is equal to $\frac{1}{w}$ if $d\in [q+1,q+w]$ is true, otherwise probability is 0. We define P(w(t),q,d) a piecewise function like so. (w(t) is kinda time dependent btw)

Probability for n dubs in a row in the same thread

Let p1 be the first post, p2 second etc. such that p1 is a dub, p2 a dub, until pn. Given P(w(t),q,d) probability given a post to be a dub, and the posts till next dubs formula given above, find the probability, for n posts, to all be dubs, with the dub range being y.

See also

• Mathematics