Tromp is going to make Proof-of-Work systems great again

August 5, 2016 1:47 PM

John Tromp is a computer scientist whose interests include mazes (playable: 1, 2), chess problems, Go (previously), graphical representations of combinatory logic, Connect-4, code obfuscation, darts, pop music, and much, much more.
posted by OverlappingElvis (8 comments total)

Blessed are the computer scientists who share their passion in a way we unwashed masses can understand.
posted by radicalawyer at 1:58 PM on August 5, 2016 [1 favorite]

Is there a GoCoin where a neural network based proof-of-work component solves Go problems? It's be horribly slanted towards the big mining pools who can build a larger collaborative neural networks, but it'd still be funny.
posted by jeffburdges at 2:38 PM on August 5, 2016 [1 favorite]

#NeverTromp?
posted by blue_beetle at 3:01 PM on August 5, 2016

.

Came for the headline. Stayed for the links to share with mr. mitt.
posted by ovenmitt at 5:04 PM on August 5, 2016

His homepage is baller.
posted by fraxil at 6:35 PM on August 5, 2016

The lambda calculus and combinatory logic paper and associated work has been a fantastic mind expanding exercise for many years.
posted by wobh at 7:06 PM on August 5, 2016

I love quirky academic math people websites. So much.
posted by oceanjesse at 7:34 PM on August 5, 2016 [1 favorite]

There's a darts game a few friends and I had come up with that seems relevant here, Math Darts.

You start out by trying to hit a 1, then another 1.
Next you want to hit a 2.
Then a 3.
After 3 comes 5.
Next comes 8.
I think you get the rest.

Each round is considered additive so if in a round you throw 1, 1, 2 then you qualify as hitting your 1s, 2s (two ways), and 3s. I have found somewhere between three and six beers to be the optimal strategy for winning.
posted by phlyingpenguin at 9:53 AM on August 6, 2016