rwjblue

• Data Down / Actions Up

  • http://emberjs.jsbin.com/nayaho/edit?html,js - Interdependent select boxes. No observers.
  • http://ember-twiddle.com/2d7246875098d0dbb4a4 - One Way Input

• Plain JSBin's

  • http://rwjblue.jsbin.com/pixeki/edit?html,js,output

• Ember Version Base JSBin's

  • 1.0 - http://emberjs.jsbin.com/juluje/edit?html,js,output

• 1.1 - http://emberjs.jsbin.com/cofufo/edit?html,js,output

kevinelliott

Mac OS X 10.10 Yosemite

Custom recipe to get OS X 10.10 Yosemite running from scratch, setup applications and developer environment. I use this gist to keep track of the important software and steps required to have a functioning system after a semi-annual fresh install. On average, I reinstall each computer from scratch every 6 months, and I do not perform upgrades between distros.

This keeps the system performing at top speeds, clean of trojans, spyware, and ensures that I maintain good organizational practices for my content and backups. I highly recommend this.

You are encouraged to fork this and modify it to your heart's content to match your own needs.

Install Software

nzoschke

# Save the AWS Convox API environment to .env

$ convox ps --app convox
ID            NAME      RELEASE         SIZE  STARTED      COMMAND                       
7e41311911f7  registry  20160127162722  256   3 hours ago  /docker-entrypoint.sh         
7a3ef788202b  web  

$ convox exec --app convox 7a3ef788202b env > .env

# Start a Docker Machine environment

dymurray

import ecdsa
import ecdsa.ellipticcurve as EC

curve = ecdsa.SECP256k1
x = int('11db93e1dcdb8a016b49840f8c53bc1eb68a382e97b1482ecad7b148a6909a5c', 16)
y = int('b2e0eaddfb84ccf9744464f82e160bfa9b8b64f9d4c03f999b8643f656b412a3', 16)
point = EC.Point(curve.curve, x, y)
pubkey = ecdsa.VerifyingKey.from_public_point(point, curve)

hash1 = 90774958364900180671716888080665726921328827653065727390791155349203800699667

DavidBurkett

import math
import ecdsa
import ecdsa.ellipticcurve as EC

#
# Compute the inverse mod p using the extend 
# euclidian algorithm. 
# See O. Forster, Algorithmische Zahlentheorie
#
def inv_mod_p(x, p):