Yuval Kogman nothingmuch

NOTE: the content is out-of-date. All development is moved to the https://github.com/yurydelendik/wasmception

Using WebAssembly in LLVM

Compiling

# locations, e.g.
export WORKDIR=~/llvmwasm; mkdir -p $WORKDIR
export INSTALLDIR=$WORKDIR

A week ago I was CC'd in on a thread about Linux packaging, and how to avoid doing it the wrong way (i.e. RPM, Deb, etc.). I've always used MojoSetup and I've never forced distributions to do any additional work, but this is still a new concept to a lot of people. Additionally, Amos suggested that I expand on Itch's FNA appendix, so here's a guide on how I package my games.

This is a bit of an expansion on my MAGFest 2016 presentation, which you can find here:

http://www.flibitijibibo.com/magfest2016/

https://www.youtube.com/watch?v=B83CWUh0Log

I would recommend looking at that first! After that, read on...

A description of known problems in Satoshi Nakamoto's paper, "Bitcoin: A Peer-to-Peer Electronic Cash System", as well as notes on terminology changes and how Bitcoin's implementation differs from that described in the paper.

Abstract

The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power.

(Update, this has been moved to https://github.com/AdamISZ/CoinSwapCS/tree/master/docs as part of that project)

These notes refer to the setup described in table and diagram form here.

Why tweak the original Coinswap design.

The original design is explained in the original CoinSwap post. The reason for attempting to come up with a modification is seen in the diagram line E:

High level description Bitcoin Core's fee estimation algorithm

The algorithm takes as input a target which represents a number of blocks within which you would like your transaction to be included in the blockchain. It returns a fee rate that you should use on your transaction in order to achieve this.

The algorithm is conceptually very simple and does not attempt to have any predictive power over future conditions. It only looks at some recent history of transactions and returns the lowest fee rate such that in that recent history a very high fraction of transactions with that fee rate were confirmed in the block chain in less than the target number of blocks.

Transactions can occur with a nearly continuous range of fee rates and so in order to avoid tracking every historical transaction independently, they are grouped into fee rate "buckets". A fee rate bucket represents a range of fee rates within which the algorithm treats all transactions as having approximately the same fee rate and the answer th

	print("UPDATE AUG 2023: this script is beyond old and broken")
	print("You may find interesting and more up to date resources in the comments of the gist")
	exit()

	from slacker import Slacker
	import json
	import argparse
	import os

	# This script finds all channels, private channels and direct messages

	#
	# Extract files from Bare git-annex repositories without git-annex
	# Supports version v6
	#
	# See internals: http://git-annex.branchable.com/internals/
	#
	# Modified: added non-bare repos, added tar file (of symlinks) output for use with archivemount
	#
	# TODO: improve output
	# TODO: use cat-files instead of archive

	package main

	import (
	"crypto/ecdsa"
	"crypto/elliptic"
	"crypto/rand"
	"crypto/sha256"
	"crypto/x509"
	"crypto/x509/pkix"
	"encoding/asn1"

	spk1.spk: sandstorm-pkgdef.capnp sandstorm-files.list
	spk pack $@

	# Destination (in-package) path must not start with '/': /nix/store/6f...
	sandstorm-files.list: result
	# nix-store --query --requisites result \| sed -e 's,^/,,' >$@
	find $$(nix-store --query --requisites `readlink result`) \| sed -e 's,^/,,' >$@

	result: default.nix
	rm -rf result

	#!/bin/sh

	# Inspired by https://gist.github.com/daktak/f887352d564b54f9e529404cc0eb60d5

	ip() { qvm-ls --raw-data ip -- "$1"; }
	netvm() { qvm-prefs -g -- "$1" netvm; }

	forward() {
	local from_domain=$1
	local to_domain=$2