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 thread.
View all comments View context
2 points

Town currently still blocks Tor exit nodes (because it is getting ddosed by them) and rucknium understandably doesn’t want to connect without it.

permalink
report
parent
reply
1 point

got it. they managed to post it anyway.

does having a hidden service introduce the same issues?

permalink
report
parent
reply

Monero

!monero@monero.town

Create post

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

Community stats

  • 228

    Monthly active users

  • 347

    Posts

  • 905

    Comments

Community moderators