cf

#include <metal_stdlib>
/*
  Goldilocks add and mul with ❤️ from Carter (Public Domain)
*/
inline ulong reduce128(ulong x_hi, ulong x_lo){
    ulong x_hi_hi = x_hi>>32;
    ulong x_hi_lo = x_hi & 0xffffffff;
    ulong t0 = x_lo - x_hi_hi;
    if(t0 > x_lo){
        t0 -= 0xffffffff;

cf

bn256 for bitcoin is totally possible without branches

don't believe me?

see below

cf

<0>
<0>
<0>
<0>
<0>
<0>
<0>
<0>
<0>
<0>

cf

/*
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>

cf

// 47146146047289644837830156546653938753825339844208394066840267548397344669800 
<26683>
<25330>
<16353>
<18358>
<9138>
<2972>
<13605>
<11722>
<22216>

cf

//44347314585423944296568073680235476145090606693409235654433373536726375170836
<25099>
<22628>
<4378>
<17693>
<627>
<25528>
<24377>
<28384>
<14745>

cf

// root
<0x227c4fdcd6c57bf13f6af315dfeebfab6976e46276f11cc6160bbd0fb5ee22ec>
// sibling_1
<0x8869ff2c22b28cc10510d9853292803328be4fb0e80495e8bb8d271f5b889636>
// sibling_2
<0x848930bd7ba8cac54661072113fb278869e07bb8587f91392933374d017bcbe1>
// sibling_3
<0x7cdd2986268250628d0c10e385c58c6191e6fbe05191bcc04f133f2cea72c1c4>
// sibling_4

cf

// Blake 3 for Bitcoin Core
/*
Copyright 2024 Carter Feldman

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WIT

cf

[
  {
    "name": "abandontransaction",
    "description": "\nMark in-wallet transaction <txid> as abandoned\nThis will mark this transaction and all its in-wallet descendants as abandoned which will allow\nfor their inputs to be respent.  It can be used to replace \"stuck\" or evicted transactions.\nIt only works on transactions which are not included in a block and are not currently in the mempool.\nIt has no effect on transactions which are already abandoned.\n",
    "args": [
      {
        "names": [
          "txid"
        ],
        "type": "STR_HEX",

cf

/*
  Multiplication using U15 Arithmetic
  X = a*2^15 + b
  Y = c*2^15 + d
  Z = X*Y = e*2^45+f*2^30+g*2^15+h


  Solve for e,f,g,h such that e,f,g,h are each less than 2^15
  h = (b*d).lo
  g = ((a*d).lo+(b*d).hi)+(b*c).lo