Bitcoin and crypto coin news website [UV 438/PV 788]

For sale a Bitcoin and crypto news website. Site is getting some traffic monthly: UV 438 / PV 788 (in May).
All content is currently made of HTML files (not WordPress nor SQL db) but you can convert it back to WordPress thanks to some cheap services online. Files and images are about 70-100MB. Selling as it is, you get what you see.

AwStat: https://snipboard.io/iWJkcV.jpg

Low reserve, must go

Why are you selling this site?
Need to free some space on server
How is it…

Bitcoin and crypto coin news website [UV 438/PV 788]

An almost surly fine-time game of coin toss where you win with probability $p$

Given a fair coin and a number $ p\in(0,1)$ . How do you Design a game that finishes in finite number of tosses with probability $ 1$ . And further, with probability $ p$ you win the game.

I thought about random walks where head, you add 1, tail you subtract 1. And you want to get to $ n$ . But that gives an approximation to $ p$ and not $ p$ .

When indulging a vice, can I spend coin to increase the stress relieved?

The general rules for downtime activities allow spending coin to improve the roll:

For any downtime activity, take +1d to the roll if a friend or contact helps you. After the roll, you may spend coin after the roll to improve the result level. Increase the result level by one for each coin spent. So, a 1-3 result becomes a 4 or a 5, a 4/5 result becomes a 6, and a 6 becomes a critical.

For the Acquire an Asset, Reduce Heat, Recover, or Long-Term Project activities, this makes sense: they have various outcomes keyed to each of those results (1-3, 4-5, 6, critical).

But how does this work for the Indulge Vice action, where the outcome (stress removed) is simply equal to the highest die roll? Suppose I roll a 1, and want to spend coin to improve it. I could see this working three different ways:

  • The next result level above 1-3 is 4-5, so I can spend a coin to increase it to a 4 or 5. Lucky me.

  • Indulging a vice doesn’t use the same result levels as everything else; it has 6 discrete levels, so spending a coin increases a 1 to a 2.

  • Indulging a vice doesn’t use this mechanic at all. I get my 1 stress relief. If I want more than that, I have to take the Indulge Vice action again.

Whose portrait is printed on the Waterdhavian gold coin?

Reading Waterdeep: Dragon Heist for an upcoming campaign, I’m writing a few teasers about the world in preparation. I know that the “dragon” is the local name for the gold coin minted in Waterdeep, but it has two sides – one showing a dragon, and one showing an old man with a beard.

My initial instinct is that it’s probably Ahghairon, the first Open Lord of Waterdeep, and the dragon is Aurinax, but I’ve not been able to find anything to back this up as there don’t appear to be any images of Ahghairon.

Does anybody know if there are any official sources that give an indication on who it’s supposed to be?

Image of a Waterdhavian "dragon" gold coin

Is there such a thing as a Magically Animated Coin Monster?

In today’s session of the D&D 5e campaign I’m participating in, our party had to fight what was essentially a anthromorphic, magically animated, pile of gold coins with a weakness to fire (it was initially disguised as a mundane pile of gold coins when we entered the room).

Is this a standard monster, and, if so, what is it called? A google search for “magically animated coin monster d&d” turned up no relevant results.

How do I pronounce the “Taol” coin from Waterdeep?

In the city of Waterdeep, there’s a coin called a “Taol” worth 2 gp. I find the description of the coin in Waterdeep: Dragon Heist on page 169, but it’s not on the pronunciation guide on page 4. I’m trying to figure out how I would pronounce it in my games. Is it “TAY-all”? “TOW-ull” (like “towel”)? So does it somehow all slur together in one syllable like “tail” (rhyming with “gaol”)? Is there some “official” pronunciation, or does every group just fend for themselves?

Prove Canonical Coin Greedy Algorithm

I am trying to prove the following:

Show that for the following coin system S, the following greedy algorithm gives the optimal solution: Select the largest possible coin at each step until the amount of money has been obtained for any given value of money. S = {1,2,5,10,20,50,100,200}.

I do not know where to begin with this proof. I am thinking that mathematical induction could be used, but I’m not sure how I would perform that proof. This problem is very easy to prove for particular amounts of money, but I don’t have a clue how to prove it for any amount of money.