bn256 for bitcoin is totally possible without branches
don't believe me?
see below
// root | |
<0x227c4fdcd6c57bf13f6af315dfeebfab6976e46276f11cc6160bbd0fb5ee22ec> | |
// sibling_1 | |
<0x8869ff2c22b28cc10510d9853292803328be4fb0e80495e8bb8d271f5b889636> | |
// sibling_2 | |
<0x848930bd7ba8cac54661072113fb278869e07bb8587f91392933374d017bcbe1> | |
// sibling_3 | |
<0x7cdd2986268250628d0c10e385c58c6191e6fbe05191bcc04f133f2cea72c1c4> | |
// sibling_4 |
//44347314585423944296568073680235476145090606693409235654433373536726375170836 | |
<25099> | |
<22628> | |
<4378> | |
<17693> | |
<627> | |
<25528> | |
<24377> | |
<28384> | |
<14745> |
// 47146146047289644837830156546653938753825339844208394066840267548397344669800 | |
<26683> | |
<25330> | |
<16353> | |
<18358> | |
<9138> | |
<2972> | |
<13605> | |
<11722> | |
<22216> |
/* | |
compute x % y given: q_lo = floor(x/y)&0x7fff, q_hi = floor(x/y)>>15, x_lo = x&0x7fff, x_hi = x>>15, y_lo = y&0x7ff, y_hi = y>>15 | |
<q_hi> | |
<q_lo> | |
<x_hi> | |
<x_lo> |
<0> | |
<0> | |
<0> | |
<0> | |
<0> | |
<0> | |
<0> | |
<0> | |
<0> | |
<0> |
bn256 for bitcoin is totally possible without branches
don't believe me?
see below
I hereby claim:
To claim this, I am signing this object:
This repository contains the code snippets from the tutorial A Hackers Guide to Layer 2: Zero Merkle Trees from Scratch.
Thanks to OAS for sponsoring this tutorial series.
Copyright 2023 Carter Jack Feldman
// Type definitions for tablestore 5.0 | |
// Project: https://github.com/aliyun/aliyun-tablestore-nodejs-sdk | |
// Definitions by: Carter Jack Feldman <https://github.com/cf> | |
// TypeScript Version: 4.2 | |
import Int64buf from 'int64-buffer'; | |
import { Buffer } from 'buffer'; | |
declare namespace TableStore { | |