dlaptev

1. Create a new Telegram bot:
   1. start a chat with BotFather;
   2. type /newbot, select a name (to be shown in chats) and handle for your bot;
   3. note the bot token to access HTTP API - a long string with a colon in the middle (later referred to as <token>);
   4. optionally /setdescription and /setuserpic.
2. Add the bot to the chat/channel and note its id:
   1. add the bot to a new or existing chat or group - this is where your bot will send notifications to;
   2. go to https://api.telegram.org/bot<token>/getUpdates (replace <token> with your token);
   3. within the chat part, find and note the id field - a positive or negative number (later referred to as <chat_id>).
3. Programmatically send notifications:

ccdle12

Rust Cheat Sheet

Covers different areas of programming and the best practices/components explained.

Frequently used crates

• structopt

A crate that contains a trait StructOpt. Allows a structure Opt to be converted

xkr47

Replace all <....> parts with your specific details

/network add -nick <nick> libera
/server add -network libera -auto -ssl irc.libera.chat 6697
/connect libera
/query NickServ
register <password> <email>
<copypaste line from email>
/network add -autosendcmd "" -sasl_username <user> -sasl_password <pass> -sasl_mechanism PLAIN libera
/channel add -auto <channel> libera

LLFourn

Unifing FROST and MuSig

There might be a secure scheme that non-interactively generates a n-of-n FROST key and from there you can interactively turn it into a t-of-n by issuing new shares (i.e. enrolment). I don't really know if this is a useful contribution even if it works. There might be some utility in not having multiple schemes but rather a one size fits all approach.

Idea

MuSig takes a "multiset" of n public keys and outputs a single aggregated key which takes n-of-n secret keys to sign. Set z_i = H(X_1,.. X_i, .. X_n, X_i) for i = 1,2, .. n.