mfornet

stakes.txt contains the amount of stake per validator on NEAR mainnet as of writing this document. This file can be recomputed using:

export NEAR_ENV=mainnet
near validators current | tee stakes.txt

The output of running the script main.py using this version of the file stakes.txt is:

mfornet

this file was intentionally left blank

mfornet

https://the-eye.eu/public/AI/pile/test.jsonl.zst
https://the-eye.eu/public/AI/pile/val.jsonl.zst
https://the-eye.eu/public/AI/pile/SHA256SUMS.txt
https://the-eye.eu/public/AI/pile/train/00.jsonl.zst
    dir = train
https://the-eye.eu/public/AI/pile/train/01.jsonl.zst
    dir = train
https://the-eye.eu/public/AI/pile/train/02.jsonl.zst
    dir = train
https://the-eye.eu/public/AI/pile/train/03.jsonl.zst

mfornet

enum __device_builtin__ cudaError
{
    /**
     * The API call returned with no errors. In the case of query calls, this
     * also means that the operation being queried is complete (see
     * ::cudaEventQuery() and ::cudaStreamQuery()).
     */
    cudaSuccess                           =      0,
  
    /**

mfornet

import random
import os
import json
import sys
from typing import List

if __name__ == '__main__':
    # Load two random files from the folder data
    file1 = random.choice(os.listdir('data/training'))
    file2 = random.choice(os.listdir('data/evaluation'))

mfornet

import torch
import torch.nn as nn


def build_model():
    return nn.Sequential(
        nn.Linear(1, 1, bias=False),
        nn.Sigmoid(),
    )

mfornet

Testing references in MD¹. YAR².

And a similar repeated reference in markdown¹.

Footnotes

1. Markdown This reference has a link to learn more about the language ↩ ↩²

2. Yet another refernce ↩

mfornet

Userscript to show the number of teams that have solved each problem on Universal Cup contests.

1. Install Tamper Monkey as a browswer extension.
2. Add the script universal_cup_enhanced.user.js to the extension.

mfornet

Nonograms | DiceCTF 2025

tl;dr:

• Use gauss in Z2 to find any solution per row, and the kernel
• Using the kernel find a solution for columns without breaking rows, and also find the kernel
• Using the new kernel find a solution that matches known qrcode requirements
• profit

---