We thank Tezos TQ Tezos Michael Klein for the informative & enjoyable presentation on the #SmartContract, network update & #security functionality of the #tezos #blockchain platform and how this can be an asset in #capitalmarkets. Looking forward to the next!

full house for tonight’s Cross-Chain Group event - TQ Tezos Cosmos - The Interchain ⚛️ Keep #tBTC UMA “DeFi is the New Testament. Bitcoin is the Old Testament.” - Allison Lu spitting some 🔥🔥🔥

Tezos has surpassed EOS by Total Value Locked in Staking 🚀 Tezos is now the biggest staking network. stakingrewards.com/global-charts

Keno Fischer Peter Desnoyers Greg K-H @johnregehr Yes! This was an IRB 'failure'. Again, in my area of Social Computing, it's been clear for awhile that IRBs often do not understand the issues and the potential risks/harms of doing research in online communities / social media. So researchers have to exercise their own care....

📢 Welcome to ar5iv.org Change the "X" in any arXiv article link to the "5" in ar5iv to get a modern HTML5 document. Thread: what is included, why now, and how we hope to merge back into arXiv. #OA #OpenScience #preprints 1/10

The $AZTEC token sale is live. An onchain, community-owned sale where you set the terms. No airdrops. No mysterious allocations. sale.aztec.network

2track.pro/tracks/682

An impromptu response to Dave Cheney's response "Never edit a method, always rewrite it" to chad fowler's talk "Growing Old" from DeccanRubyConf 2019 : gist.github.com/michaeljklein/…

How is it so fast? "Instead of a hybrid brute-force approach".."there is a relentless positional boa constrictor approach that is simply unheard of." It avoids dead-ends by having "no such..issues, and seems to thrive on snuffing out the opponent’s play.": youtu.be/p20TBm_H5K8 x.com/johncarlosbaez…

#Haskell scales: 7.7MB real memory, 1.00TB virtual, no input, output to stdout, 190 lines of code

Communicating Advanced Mathematics to Kids: “If you can't explain it to a six year old, you don't understand it yourself.” shar.es/1Mitei

On Infinite Computation: The Book of Sand vs. The Monster group vs. Chess: gist.github.com/michaeljklein/…

A Haskell package for working with high-performance streamed operations: some folds and experiments github.com/michaeljklein/…

Technical debt, bit rot, and the Abelian Sandpile Model: gist.github.com/michaeljklein/… Image by Claudio Rocchini: en.wikipedia.org/wiki/Abelian_s…

popl18.sigplan.org/event/popl-201… I've been discouraged from writing random tests in Ruby. I like the QuickCheck approach and deterministic tests are limited, but maybe if failing random tests were added to a list of static tests, we could prevent patterns like: ✓ x ✓ x x ✓ ✓ ✓ x x ✓

Evolution of "p_k p = print each until p (pred) gives False" in #Haskell: p_0 p = mapM_ (\(i, x) -> if p x then print (i, x) else error (show (i, x))) . zip [0..] p_1 p = foldM_ (\ i x -> if p x then print (i, x) >> return (i+1) else error (show (i, x))) 0 p_2 _ = mapM_ print

Types: p_0 :: Show a => (a -> Bool) -> IO [a] -> IO () p_1 :: Show a => (a -> Bool) -> IO [a] -> IO () p_2 :: (Foldable t, Show a) => (a -> Bool) -> IO (t a) -> IO () p_2's other, derived type ignores the predicate: p_2 :: (Foldable t, Show a) => b -> IO (t a) -> IO () 😆

Animate Haskell modules across their commit histories with: animate_modules.rb [git clone address] github.com/michaeljklein/…

Quick (15 lines) Sierpinski Triangle animation in CodeWorld: code.world/#PVW-u5bRODsX8… CodeWorld Haskell version: code.world/haskell#PkOQ_l… Tried CodeWorld Blocks, but didn't get very far: code.world/blocks#Ps37cUZ…