this post was submitted on 20 Oct 2024
7 points (100.0% liked)

Monero

1675 readers
32 users here now

This is the lemmy community of Monero (XMR), a secure, private, untraceable currency that is open-source and freely available to all.

GitHub

StackExchange

Twitter

Wallets

Desktop (CLI, GUI)

Desktop (Feather)

Mac & Linux (Cake Wallet)

Web (MyMonero)

Android (Monerujo)

Android (MyMonero)

Android (Cake Wallet) / (Monero.com)

Android (Stack Wallet)

iOS (MyMonero)

iOS (Cake Wallet) / (Monero.com)

iOS (Stack Wallet)

iOS (Edge Wallet)

Instance tags for discoverability:

Monero, XMR, crypto, cryptocurrency

founded 1 year ago
MODERATORS
 

I'm trying to arrive at the function that describes the following, but can't quite figure it out for multiple blocks. (there are some useful insights for a single block here.)

assume the Poisson point process that is the arrival of proof-of-work blocks on Monero. the mean of the block times is the target block time t (120 seconds).

also assume n subsequent blocks.

also assume p, the probability of n subsequent blocks having a mean block time less than or equal to T.

given t, n and p, how can I calculate T?

you are viewing a single comment's thread
view the rest of the comments
[–] chaser@monero.town 1 points 3 weeks ago

thank you very much, Rucknium. your understanding of my question was spot-on, and the R code works excellently! very useful.

I'd like to ask a few more questions:

  • is 314 a common seed in R, or just something you randomly picked?
  • in statistics in general, are there cases where n * 100000 random samples (any distribution) would be insufficient? is it a good rule of thumb?