@RandyMcMillan RandyMcMillan

Silent Payments

Receive private payments from anyone on a single static address without requiring any interaction or extra on-chain overhead.

Update: This now has a BIP and WIP implementation

Overview

The recipient generates a so-called silent payment address and makes it publicly known. The sender then takes a public key from one of their chosen inputs for the payment, and uses it to derive a shared secret that is then used to tweak the silent payment address. The recipient detects the payment by scanning every transaction in the blockchain.

Dear Brink Board,

Thanks to 20% support from Brink, I've been very fortunate to work part-time on Bitcoin Core engineering, mostly review, for almost a year. These are some of the accomplishments during this time:

biweekly calls with John Newbery until he stepped away, during which we discussed code review best practices, how to host review club, Bitcoin Core design philosophy, thread safety, book recommendations (both ways), suggestions for PRs to review and specifics of some of those, release engineering (version numbers, tagging), debugging, and many other topics
hosted Review Club three times (14707,

w2ui grid

See the w2ui homepage for more information:

DEMO: http://w2ui.com/web/demos/#/grid/1

DOCS: http://w2ui.com/web/docs/2.0/grid

w2ui is a really nice frontend library for creating grids, forms, and all sorts of simple but high quality html frontend interfaces.

GNUmakefile example

Reusable taproot addresses

Abstract

This document proposes a new scheme to avoid address reuse while retaining some of the convenience of address reuse, keeping recoverability purely from Bitcoin time chain and avoiding visible fingerprint. The scheme has negligible average overhead.

Motivation

Using debuggers with Bitcoin Core

Please also refer to Fabian Jahr's excellent documentation and video. In this document, I'll cover only some of what his document does in slightly greater detail, while trying not to duplicate too much, and focused on gdb and Linux.

Video version of (most of) this document: https://vimeo.com/576956296/df0b66fbfc NOTE if you watch the video: Near the end, I had problems attaching to

	(ns secp256k1
	(:import (java.util Arrays)
	(java.security MessageDigest)
	(java.nio.charset StandardCharsets)))

	(defrecord Point [^BigInteger x ^BigInteger y])

	(def infinity (->Point nil nil))

	(def ^BigInteger zero BigInteger/ZERO)

	[
	"ed1d0e1f743a7d19aa2dfb0162df73bacdbc699f67cc55bb91a98c35f7deac69",
	"fd3fdb0d0d8d6f9a7667b53211de8ae3c5246b79bdaf64ebac849d5148b5615f",
	"e668a111aa647e63ef587c17fb0e2513d5c2859cd8d389563c7640ffea1fc216",
	"1bbb8324577ac089607e45813bac499ebdab4621d029f8c02b2c82b4410fd3f4",
	"51535ad9f0e13a810f73ea8829a79b3733bd1fffb767c4885990b02f59103a13",
	"2508ed2c2ab3f6728a880fafbc0895a2afeacbb74eb69847255fb60564af0d85",
	"3707f1efc7515524dce41d3bf50bfd9fdaed3494620b5f94fcf16d2766da4ec2",
	"dbab9040bc1f0c436b0f92f517702498358edc1fde2c7884d0e1036c739d44f3",
	"ad5aab5be883a571ea37b231cd996d37522e77d0f121cedfd6787b91d848268e",

	_ = (
	lambda: [
	_
	# Imports
	for sys in [__import__('sys')]
	for math in [__import__('math')]

	# Helper functions
	for sub in [lambda *vals: None]
	for fun in [lambda *vals: vals[-1]]

	def compute(limit):
	d = [1] + [0] * limit
	primes = eulerlib.primes(limit)
	mod = 10**9
	Fibonnaci_numbers = [2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368]

	for p in primes:
	for i in range(p,limit+1):
	d[i] += (p*d[i-p] % mod)