TomMD

I was told compiling with `prof` will make the new GHC call stacks more informative (which seems odd) so I made this test.

Consider `so.hs`:

> import GHC.Stack
>
> main :: IO ()
> main = f
>
> f, g, h :: IO ()

TomMD

Keybase proof

I hereby claim:

• I am tommd on github.
• I am tommd (https://keybase.io/tommd) on keybase.
• I have a public key whose fingerprint is 6E35 2C85 514C 080E 745D 10F8 1C09 217D A7A7 8EF5

To claim this, I am signing this object:

TomMD

XCRUSH (ed?)

An amature cryptographer posted a new block cipher called xcrush. Usually I ignore these posts, but seeing as this guy knew it to be an educational exercise and made a somewhat digestable document I took the bait.

A common question to ask is if the key expansion function is injective. This is important because a non-injective key expansion function means two keys result in the same block cipher operation, and thus the security

TomMD

### Keybase proof

I hereby claim:

  * I am tommd on github.
  * I am tommd (https://keybase.io/tommd) on keybase.
  * I have a public key whose fingerprint is 8BC2 FE48 95E8 2B82 4E1D  9EB6 DA9F 2B24 F69F B294

To claim this, I am signing this object:

TomMD

module LazyDemo where

import Vision.Image.JuicyPixels
import Vision.Image (RGBA)
import Codec.FFmpeg
import System.IO.Unsafe

lazyStream :: FilePath -> IO [RGBA]
lazyStream fp = do
    initFFmpeg