Abort writing to trace file if an error is encountered. This should result in a well-formed partial trace file.

Allocates a noun list as an array of AesSivData structs on the NockStack for use as associated data in AES-SIV functions.

Perform a key exchange between the given public key and the private key of the keypair generate from the given seed, writing the resulting shared key

c += sign * a * b Simple method: O(a.len() * b.len()). Returns carry.

Allocate a slice by copying another slice. Returns the remaining chunk of memory. The original memory is not usable until both the new memory and th

Push onto the tracing stack

Get connection timeout (same as swarm idle timeout)

Copy the root from another slab into this slab, set this slab's root to the copied root

Creates a new Nock interpreter context with all necessary components This context is used to execute Nock code and interpret Hoon-generated data. It

Create the born driver that waits for signal before poking You can chain many of these together by passing 'init_complete_tx'.

Create a task that waits for all registered drivers to initialize

Deserialize a noun from a BitSlice This function implements the inverse of jam, unpacking a serialized noun. Corresponds to `++cue` in the hoon stdl

edit door values

words % rhs

Walk through the linked list of WarmEntry objects and do a partial check against the subject using Batteries (walk to root of parent batteries). If th

Must call flush to make sure all the data is written.

Get the size in bits of an encoded atom or backref TODO: use first_zero() on a slice of the buffer

Start of the memory range for this NockStack */

Greater than or equal to (boolean)

Utility function to compute the raw memory usage of an [IndirectAtom] */

Test if a noun is a cell. */

Determine if the given key refers to a cell.

Test if a noun is a direct atom. */

Serialize an atom into the jam state

Serialize a backreference into the jam state