atoponce

Cryptographic Best Practices

Putting cryptographic primitives together is a lot like putting a jigsaw puzzle together, where all the pieces are cut exactly the same way, but there is only one correct solution. Thankfully, there are some projects out there that are working hard to make sure developers are getting it right.

The following advice comes from years of research from leading security researchers, developers, and cryptographers. This Gist was [forked from Thomas Ptacek's Gist][1] to be more readable. Additions have been added from

jonathanmoore

Share Counts

I have always struggled with getting all the various share buttons from Facebook, Twitter, Google Plus, Pinterest, etc to align correctly and to not look like a tacky explosion of buttons. Seeing a number of sites rolling their own share buttons with counts, for example The Next Web I decided to look into the various APIs on how to simply return the share count.

If you want to roll up all of these into a single jQuery plugin check out Sharrre

Many of these API calls and methods are undocumented, so anticipate that they will change in the future. Also, if you are planning on rolling these out across a site I would recommend creating a simple endpoint that periodically caches results from all of the APIs so that you are not overloading the services will requests.

Twitter

FrankSpierings

Container security notes

Internet references

Kernel and architecture

• namespaces - overview of Linux namespaces http://man7.org/linux/man-pages/man7/namespaces.7.html

• mount_namespaces - overview of Linux mount namespaces

kriskowal

I have a bit of good news and bad news. Friday, April 3, was my last day at Uber. Monday, April 6, was my first day at Agoric.

I started at Uber 5½ years ago, on the dispatch system. I joined Tom Croucher’s team, which focused on common frameworks for marketplace systems, with Jake Verbaten, Russ Frank, and spiritually Matthew Esch. When I arrived, the scaffolding and frameworks were in place. I wrote a tool for verifying that JSON schema evolution remained backward-compatible, did some weird stuff to automatically mix the middleware stack, and wrote a thing to balance load across Node.js processes more fairly than the Linux kernel. I don’t believe any of that work made it to production, really, but for those six months, I learned how to operate global dispatch while I was on-call for 24 hours once a month and developed a bald spot.

I then got on board a new Distributed Systems Group under Matt Ranney’s guidance and many of the folks I’ve been working with to this day. Matt had designed a DHT based on the S

Gozala

// Lack of tail call optimization in JS
var sum = function(x, y) {
  return y > 0 ? sum(x + 1, y - 1) :
         y < 0 ? sum(x - 1, y + 1) :
         x
}

sum(20, 100000) // => RangeError: Maximum call stack size exceeded

// Using workaround

naholyr

var fs = require('fs');

// Here is a simple function that reads a file and makes something with its content
function readLog1 (cb) {
  // Notice how I even gave a name to my callback, this is useful for stack traces, everyone says…
  fs.readFile('file-not-found.log', function onRead1 (err, content) {

    // Usual error handling
    if (err) return cb(err);

getify

// all this `toJSON()` does is filter out any circular refs. all other values/refs,
// it passes through untouched, so it should be totally safe. see the test examples.

// only extend the prototype if `toJSON` isn't yet defined
if (!Object.prototype.toJSON) {
	Object.prototype.toJSON = function() {
		function findCircularRef(obj) {
			for (var i=0; i<refs.length; i++) {
				if (refs[i] === obj) return true;
			}

RReverser

// UPD:
// Now available as npm module!
// Check out https://github.com/RReverser/better-log for details.

console.log = (function (log, inspect) {
  return function () {
    return log.apply(this, Array.prototype.map.call(arguments, function (arg) {
      return inspect(arg, { depth: 1, colors: true });
    }));
  };

n1k0

Title	Seen	Rating ★☆
24	☑	★★☆☆☆
Ash vs Evil Dead	☒	?
Bates Motel	☑	★★★☆☆
Battlestar Galactica	☒	?
Better Call Saul	☑	★★★★★
Black Mirror	☑	★★★★★
Black Sails	☒	?
Breaking Bad	☑	★★★★★

wrboyce

#!/usr/bin/zsh

COMPRESSOR=$(whence -p yui-compressor)
[ -z $COMPRESSOR ] && exit 0;

function _compress {
        local fname=$1:t
        local dest_path=$1:h
        local min_fname="$dest_path/${fname:r}.min.${fname:e}"
        $COMPRESSOR $1 > $min_fname