Jonathan Vaage

[Alex Agut @apagut]

If you worked on BSV and you've got a small business or a startup today,

I want you to be one of the first to use something I've built 👀 - not payment related, though.

Closed beta starts this Friday.

Free for a month.

DM me.

If you've ever used HandCash help me with a RT🙏

[Jonathan Vaage @JonathanVaage]

Reconsider the page layout. Scanning a multi-column/grid for something specific I’m looking for is a micro-stressor. I’d prefer a linear list to easily and confidently search the set without worry I skipped over it. Perhaps the groupings could be arranged as blocks in a 2 or 3 column grid, with their contents in a straight list.

[Jonathan Vaage @JonathanVaage]

@deggen With primary currency units, the multiple leading zeros make it so hard to parse. To help, I looked at using a thin space between digits 2 & 3.

$0.00 0035

[Jonathan Vaage @JonathanVaage]

@deggen Yeah, maybe c works for Euros and p works for Brits (pence).

[Jonathan Vaage @JonathanVaage]

Would you consider switching to BSV at a lower amount, perhaps with 3 decimal points while under 1 BSV, for a minimum of 2 significant digits?

Large amounts of satoshis, like 18 million, feels like too big of a number for such an insignificant unit, especially given that those amounts begin to have some monetary weight. Granted there's also a limit to how well we deal with fractional units of BSV.

1¢ ≈ 61,087 sats
5¢ ≈ 305,435 sats
10¢ ≈ 610,870 sats

25¢ ≈ 0.015 BSV
(vs. 1,527,184 sats)

$1 ≈ 0.061 BSV
(vs. 6,108,735 sats)

$5 ≈ 0.305 BSV
(vs. 30,543,677 sats)

$20 ≈ 1.22 BSV
$100 ≈ 6.11 BSV
$1,000 ≈ 61.08 BSV

[Tech with Mak @techNmak]

In 1948, a 32-year-old at Bell Labs published a paper nobody fully understood.

Engineers found it too mathematical. Mathematicians found it too engineering-focused. One prominent mathematician reviewed it negatively.

That paper - "A Mathematical Theory of Communication", became the founding document of the digital age.

The man was Claude Shannon. Father of Information Theory.

At 21, he wrote the most important master's thesis of the 20th century.

Working at MIT on an early mechanical computer, Shannon noticed its relay switches had exactly two states - open or closed. He had just taken a philosophy course introducing Boolean algebra, which also operated on two values: true and false.

Nobody had ever connected these two things.

His 1937 thesis proved that Boolean algebra and electrical circuits are mathematically identical, and that any logical operation could be built from simple switches.

Howard Gardner called it "possibly the most important, and also the most famous, master's thesis of the century."

Every digital computer ever built traces back to this insight.

At 29, he proved that perfect encryption exists.

During WWII, Shannon worked on classified cryptography at Bell Labs. His work contributed to SIGSALY, the secure voice system used for confidential communications between Roosevelt and Churchill.

In a classified 1945 memorandum, he mathematically proved the one-time pad provides perfect secrecy, unbreakable not just computationally, but provably, permanently, against an adversary with infinite power.

When declassified in 1949, it transformed cryptography from an art into a science. It laid the foundations for DES, AES, and every modern encryption standard.

At 32, he defined what information is.

His 1948 paper introduced one equation:
H = −Σ p(x) log p(x)

Shannon entropy. The average uncertainty in a probability distribution. The minimum bits required to encode a message.

Three things followed:

> He defined the bit - the fundamental unit of all information. His colleague John Tukey coined the name.

> He proved the channel capacity theorem, every communication channel has a maximum rate of reliable transmission. You can approach it. You can never exceed it.

> He unified telegraph, telephone, and radio into a single mathematical framework for the first time.

Robert Lucky of Bell Labs called it the greatest work "in the annals of technological thought."

Where his equation lives in AI today:

Cross-entropy loss - the function training every classifier and language model, is derived directly from H. Decision tree splits use information gain, which is H applied to data. Perplexity, the standard LLM evaluation metric, is an exponentiation of cross-entropy.

Every time a neural network trains, Shannon's formula runs inside it.

He also built the first AI learning device.

In 1950, Shannon built Theseus, a mechanical mouse that navigated a maze through trial and error, learned the correct path, and repeated it perfectly. Mazin Gilbert of Bell Labs said: "Theseus inspired the whole field of AI."

That same year he published the first paper on programming a computer to play chess. He co-organized the 1956 Dartmouth Workshop, the founding event of AI as a field.

The man:
He rode a unicycle through Bell Labs hallways while juggling. He built a flame-throwing trumpet, a rocket-powered Frisbee, and Styrofoam shoes to walk on the lake behind his house.

He called his home Entropy House.

When asked what motivated him: "I was motivated by curiosity. Never by the desire for financial gain. I just wondered how things were put together."

In 1985, he appeared unexpectedly at a conference in Brighton. The crowd mobbed him for autographs. Persuaded to speak at the banquet, he talked briefly, then pulled three balls from his pockets and juggled instead.

One engineer said: "It was as if Newton had showed up at a physics conference."

He died in 2001 after a decade with Alzheimer's, the cruel irony of information slowly leaving the mind of the man who defined what information was.

Claude, the AI model, is named after Claude Shannon, the mathematician who laid the foundation for the digital world we rely on today.

[Jonathan Vaage @JonathanVaage]

@___siggi___ Boom!

[Jonathan Vaage @JonathanVaage]

@kittytreats

[Jonathan Vaage @JonathanVaage]

@LightBSV @EquityDiamonds @Brendan_Lee__ @ProjectBabbage @MineLikeAnApe Could be sensible for new entrants, but any reason a node with an established reputation would add PoW to their own subtrees? New entrants would likely already prioritize subtrees from reputable nodes without PoW.

[Jonathan Vaage @JonathanVaage]

@LightBSV @EquityDiamonds @Brendan_Lee__ @ProjectBabbage @MineLikeAnApe Why would a node care about subtree announcements from a peer with no history of block discoveries?

[Randy @nondualrandy]

DMs open 📩

I am making myself available for work Branding, Logo, Animation, Interface Design, Frontend Development, Mobile Apps, Websites, 3D, whatever you need.

RT for visibility 🤩

[Alex Agut @apagut]

This is the right formula.

[Jonathan Vaage @JonathanVaage]

@deggen @KarlTheProgrmr The txn itself is public but the correlation of many txns tied to one identity, even a pseudonymous message box account owner, should not be public.

[Jonathan Vaage @JonathanVaage]

Then there’s matter of privacy wrt the message box. There probably needs to be a txn specific encryption key, the private key for which can then itself be encrypted for each counterparty along with the rest of the initial txn details.

The ARC service can then use this txn specific encryption pubkey to encrypt the Merkle proof broadcast to the designated multicast address.

[Jonathan Vaage @JonathanVaage]

@KarlTheProgrmr @deggen Exactly. It wouldn’t have to be an extra forwarding step for Alice if she provided ARC a means to broadcast the Merkle path to all txn counterparties. Idk if Bob’s ‘message box’ can be told to subscribe to a multicast address based on the txid or something.

[Jonathan Vaage @JonathanVaage]

Can ARC really be counted on to provide Bob Merkle paths for any historic txn on demand indefinitely?

I would think Alice needs to forward the Merkle path to Bob after she receives it. I imagined one wound need to register a Merkle path call back request along with the initial txn broadcast, or worst case, shortly after block inclusion. Perhaps for a fee, some overlays will provide Merkle paths for older txns, but can that be counted on?

[Jonathan Vaage @JonathanVaage]

@jamesm Great design, but ya gotta further indent that child label so the text doesn’t align with the parent. Also siblings with children of their own align with siblings without children, while leaving room for the expand/collapse chevron. Check out https://t.co/AVDCWl3DgK

[Jonathan Vaage @JonathanVaage]

@braydenjlangley Active polls aren’t loading for me

[Jonathan Vaage @JonathanVaage]

@PeterRizun Looks like sha256