this is used only once all clients start with handshake, then other party sends avtive to mark that connection is active

display spend key viewable wallet do not have spend secret key TODO wee need to give user a warning if we are printing secret

sets up data for ntp style processing

fill all the tx pool info as per requested

this function finds a possible peer to connect to keeping blacklist and already existing connections into picture it must not be already connected usi

freq_8_32 returns the character frequencies for text, as a slice indexed by character value. If freq is nil, freq_8_32 uses and returns bucket. If fre

freq_8_32 returns the character frequencies for text, as a slice indexed by character value. If freq is nil, freq_8_32 uses and returns bucket. If fre

we will collect atleast 50 blocks or till genesis

Note: This function is only used to distinguish between points with the same x-coordinates when doing point compression. An ordered field must be infi

handle all commands while in prompt mode

hard coded contracts generally do not do any initialization

this assumes that we are already locked

this will fill up the info struct from the tx

this will maintain connection to 1 seed node randomly

map_32 maps the LMS-substrings in text to their new IDs, producing the subproblem for the recursion. The mapping itself was mostly applied by assignID

map_32 maps the LMS-substrings in text to their new IDs, producing the subproblem for the recursion. The mapping itself was mostly applied by assignID

this will parse 1 line at a time, if there is an error, it is returned

dero removes length checks from bech32

readInt reads an int x from r using buf to buffer the read and returns x.

readInt reads an int x from r using buf to buffer the read and returns x.

recurse_32 calls sais_32 recursively to solve the subproblem we've built. The subproblem is at the right end of sa, the suffix array result will be wr

recurse_32 calls sais_32 recursively to solve the subproblem we've built. The subproblem is at the right end of sa, the suffix array result will be wr

start a rescan from block 0

function, which takes a string as argument and return the reverse of string.

all inputs are in micro secs,output is in nsec

this will run a function from a loaded SC and execute it if possible it can run all internal functions parameters must be passed as strings

sais_8_32 computes the suffix array of text. The text must contain only values in [0, textMax). The suffix array is stored in sa, which the caller mus

sais_8_32 computes the suffix array of text. The text must contain only values in [0, textMax). The suffix array is stored in sa, which the caller mus

we need the following RPCS to work

start a chain in simulator mode

start a chain in simulator mode

basically

we are expecting other side to have a heavier PoW chain, try to sync now

extract history from a single block first get a block, then get all the txs Todo we should expose an API to get all txs which have the specific addres

sync history

test tests an arbitrary suffix array construction function. Generates many inputs, builds and checks suffix arrays.

test tests an arbitrary suffix array construction function. Generates many inputs, builds and checks suffix arrays.

testRec fills x[i:] with all possible combinations of values in [1,max] and then calls testSA(t, x, build) for each one.

testRec fills x[i:] with all possible combinations of values in [1,max] and then calls testSA(t, x, build) for each one.

returns the serialized index size

returns the serialized index size

all non miner tx must be non-coinbase tx each check is placed in a separate block of code, to avoid ambigous code or faulty checks all check are plac

xToY reconstructs Y from X using the curve equation. it provides two solutions

this is for testing some edge case in simulator

Available return total available bytes on file system to an unprivileged user

* func Peer_DisableBan(address string) (err error){ p := GetPeerInList(address) if p == nil { return fmt.Errorf("Peer \"%s\" not found in

broad cast a block to all connected peers in cut up in chunks with erasure coding we can only broadcast a block which is in our db this function is tr

broad cast a block to all connected peers we can only broadcast a block which is in our db this function is trigger from 2 points, one when we receive

broadcast a new transaction, return to how many peers the transaction has been broadcasted this function is trigger from 2 points, one when we receive

generate proof etc

get the tx fee this function assumes that fees are per KB for every part of 1KB multiply by fee_per_kb

import "github.com/deroproject/derosuite/blockchain" peer has requested chain

notifies inventory

check block version validity at specific height according to current network

clean the transaction everything

add connection to map, only if we are not connected already we also check for limits for incoming connections same ip max 8 ip ( considering NAT) sam

prints all the connection info to screen

convert block which was serialized in p2p format to in ram block format

this function calculates the difficulty in big num form