abcdw

Nix vs Guix

These are notes to the stream: https://youtu.be/S9V-pcTrdL8

Some notes

• We are not aware of a lot of GNU software available to us.
• Seems that Guix more hacker-friendly/explorable.

General comparsion

Description

Nix

Guix

Comment

rjhansen

SKS Keyserver Network Under Attack

This work is released under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Terminological Note

"OpenPGP" refers to the OpenPGP protocol, in much the same way that HTML refers to the protocol that specifies how to write a web page. "GnuPG", "SequoiaPGP", "OpenPGP.js", and others are implementations of the OpenPGP protocol in the same way that Mozilla Firefox, Google Chromium, and Microsoft Edge refer to software packages that process HTML data.

Who am I?

lionello

/* Use this with an overmind Procfile like this:
geth: geth --dev --rpc console
jest: pnpx jest --watchAll
*/
const ChildProcess = require('child_process')
const Web3 = require('web3')
const Assert = require('assert')

function addressOf(contract) {
  return contract.options.address

leonardofed

A curated list of AWS resources to prepare for the AWS Certifications

A curated list of awesome AWS resources you need to prepare for the all 5 AWS Certifications. This gist will include: open source repos, blogs & blogposts, ebooks, PDF, whitepapers, video courses, free lecture, slides, sample test and many other resources.

---

larrybotha

Custom Social Sharing Buttons

Custom social sharing buttons for Twitter, Facebook, Google Plus, LinkedIn, StumbleUpon, and Pinterest.

via http://siliconstation.com/how-develop-custom-google-plus-button/

<a class="icon-twitter" rel="nofollow"
	href="http://twitter.com/"

tluyben

#!/usr/bin/perl

$f = $ARGV[0];

$pagestart = 0; 
$charstart = 0; 
$kernstart = 0;

$s = "<?xml version=\"1.0\"?>\n<font>\n"; 
open(F, $f);

MohamedAlaa

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

bellbind

# Basics of Elliptic Curve Cryptography implementation on Python
import collections


def inv(n, q):
    """div on PN modulo a/b mod q as a * inv(b, q) mod q
    >>> assert n * inv(n, q) % q == 1
    """
    for i in range(q):
        if (n * i) % q == 1: