I'm after a ECDSA encryption implementation in Haskell, specifically Secp256k1. The only thing I can find on Hackage is http://hackage.haskell.org/package/crypto-pubkey-types-0.4.0/ which seems to define types but has no implementation. I also found https://github.com/tomcumming/ecdsa but that does not seem to have been uploaded to Hackage for some reason.
Anyone know of an ECDSA/Secp256k1 implementation in Haskell?submitted by krypto-knight
[link] [10 comments]
Data.Set is implemented using size-balanced trees. But where possible, tries are better than trees. As tries store lists, a trie would be a better choice when storing lists, i.e. any Set [a]. But it would also be possible with non-list-shaped datatypes that are isomorphic to something list-like. All datatypes that have Show and Read have this property, and a serialization could be derived analogously to Show and Read. So it seems to me that an implementation of Data.Set could instead use a trie for many/most datatypes, resulting in improvements in time and potentially space complexity, with little or no effort from the user. The same applies to Data.Map.
Apologies for the brain dump -- I'd appreciate any corrections to this train of thought, or pointers to implementations, or suggestions on how this would be implemented. (Type families? I'm not too familiar with this extension.)submitted by Jameshfisher
[link] [3 comments]
I have never succeed to install any package depended on such gtk packages.
- Wiki page is too old.
- https://github.com/bgamari/gtk2hs works not for all times.
What is the suggested package currently?
Any one is maintaining such packages?
[link] [20 comments]