When I first tried to understand random forcing (which according to Wikipedia is forcing with $(\operatorname{Bor}(I),\subseteq,I)$, where $I = [0,1]$ and $\operatorname{Bor}(I)$ is the collection of Borel subsets of $I$ having non-zero Lebesgue measure), I misunderstood Borel sets as finite unions of closed-open intervals.
But from my (limited) understanding, closed and open shouldn't matter that much, and finite unions should already been taken care of by using the poset formulation instead of the Boolean algebra formulation, so it seemed to me that I might as well just use open intervals on $[0, 1]$. Then, it seemed that I should be able to approximate any interval by intervals whose endpoints have a finite binary representation, and the latter type of intervals are essentially demanding the "new real number" $r$ to start with some specified bits (again, up to finite union and ignoring some interval endpoints), so it seemed that what I got was equivalent to Cohen forcing with the forcing poset $(\operatorname{Fin}(\omega,2),\supseteq,0)$.
Since then, reading on the internet have given me a better understanding of Borel sets, but I still wonder if my intuitions about my mistaken "random forcing notion" was correct.