RomarQ

// SPDX-License-Identifier: None
pragma solidity ^0.8.0;

contract EntropyProvider {
    bytes entropy;
    uint last_update;
    address processor;

    constructor(address _processor) {
        processor = _processor;

RomarQ

pragma solidity ^0.8.0;

contract EntropyProvider {
    bytes entropy;
    uint last_update;
    address processor;

    constructor(address _processor) {
        processor = _processor;
    }

RomarQ

pragma solidity ^0.8.17;

contract IBCF_Client {
    // The action counter is used in the Tezos blockchain for ordering the actions sequentially and as replay attack prevention.
    uint action_counter;
    // Proof slot
    mapping(uint => string) action_registry;

    /**
     * Modifier to increase the action counter

RomarQ

Delete all remote branches but main.

git branch -r | grep -v "main" | cut -d/ -f2- | while read line; do git push origin :heads/$line; done;

RomarQ

Rust Cheat Sheet

Bubble sort

fn bubble_sort<T: Ord + Copy>(mut list: Vec<T>) -> Vec<T> {
    for i in 0 .. list.len() {
        for j in i .. list.len() {
            if list[i] > list[j] {
                list.swap(i, j);

RomarQ

Go Cheat Sheet

Get map keys

func GetMapKeys[K comparable, V any](m map[K]V) []K {
	keys := make([]K, 0)

	for k := range m {
		keys = append(keys, k)

RomarQ

Linux Cheat Sheet

List all PCI devices

lspci

List available kernels

ls -l /lib/modules

RomarQ

Typescript Cheat Sheet

Make all properties in T optional

/**
 * Make all properties in `T` optional
 
 * @typeParam T - Object
 */

RomarQ

HTTP Streaming (or Chunked vs Store & Forward)

The standard way of understanding the HTTP protocol is via the request reply pattern. Each HTTP transaction consists of a finitely bounded HTTP request and a finitely bounded HTTP response.

However it's also possible for both parts of an HTTP 1.1 transaction to stream their possibly infinitely bounded data. The advantages is that the sender can send data that is beyond the sender's memory limit, and the receiver can act on