fire Fire-

The Problem

Standard practices say no non-root process gets to talk to the Internet on a port less than 1024. How, then, could I get Node talking on port 80 on EC2? (I wanted it to go as fast as possible and use the smallest possible share of my teeny tiny little micro-instance's resources, so proxying through nginx or Apache seemed suboptimal.)

The temptingly easy but ultimately wrong solution:

Alter the port the script talks to from 8000 to 80:

}).listen(80);

OS X Screencast to animated GIF

This gist shows how to create a GIF screencast using only free OS X tools: QuickTime, ffmpeg, and gifsicle.

Instructions

To capture the video (filesize: 19MB), using the free "QuickTime Player" application:

Width	Height	Divisible by 8
128	72	Yes
256	144	Yes
384	216	Yes
512	288	Yes
640	360	Yes
768	432	Yes
896	504	Yes
1024	576	Yes

Exporting your 2FA tokens from Authy to transfer them into another 2FA application

IMPORTANT - Update regarding deprecation of Authy desktop apps

Past August 2024, Authy stopped supported the desktop version of their apps:
See Authy is shutting down its desktop app | The 2FA app Authy will only be available on Android and iOS starting in August for details.

And indeed, after a while, Authy changed something in their backend which now prevents the old desktop app from logging in. If you are already logged in, then you are in luck, and you can follow the instructions below to export your tokens.

If you are not logged in anymore, but can find a backup of the necessary files, then restore those files, and re-install Authy 2.2.3 following the instructions below, and it should work as expected.

	class Tests
	SUBTESTS = %w(Abstract Decision Quantitative Verbal)
	end

	describe Tests do

	describe "before assigning @ - " do
	describe "this doesn't work because the loops are all at the same describe level (the befores override one another)" do
	Tests::SUBTESTS.each do \|test\|
	before(:each) do

	#!/usr/bin/env sh
	# fake_time_machine.sh

	# Fake Time Machine
	# by Peter Marreck
	# Based on ideas in http://blog.interlinked.org/tutorials/rsync_time_machine.html
	# 9/2011

	# E_BADARGS=85
	# if [ -z "$1" ]

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	// Takes string of Note + Octave
	// Example:
	// var frequency = getFrequency('C3');

	var getFrequency = function (note) {
	var notes = ['A', 'A#', 'B', 'C', 'C#', 'D', 'D#', 'E', 'F', 'F#', 'G', 'G#'],
	octave,
	keyNumber;

	if (note.length === 3) {

	#!/usr/bin/env python
	# -- coding: utf-8 --

	import struct
	import sys
	sys.stdout.flush()

	def main():
	with open('DRAKS0005.sl2', 'rb') as fo:
	fo.seek(0x3c0, 0)

	(Dijkstra and plain A* are generally not included here as there are thousands of
	implementations, though I've made an exception for rare Ruby and Crystal versions,
	and for Thor, Mapzen's enhanced A*. )

	A* Ruby https://github.com/georgian-se/shortest-path
	A* Crystal https://github.com/petoem/a-star.cr
	A* (bidirectional with shortcuts) C++ https://github.com/valhalla/valhalla
	NBA* JS https://github.com/anvaka/ngraph.path
	NBA* Java https://github.com/coderodde/GraphSearchPal
	NBA* Java https://github.com/coderodde/FunkyPathfinding