I wrote a CLI application in Go that implements Shamir's Secret Sharing algorithm. It allows you to split a secret string or file into n "shares". If you have any k of the shares, you can reconstruct the original secret. If you have k-1 or fewer shares, you have no information about what the secret was other than its length. You can set any 2 <= k <= n <= 255 you like.I had a lot of fun making this in my free time. Let me know if you have any ideas or suggestions to improve the project.