Forgret

I created numbase is an alternative to Base64 that encodes data into a single large number instead of ASCII characters. It's useful if you want to store or transmit data in numeric form and easily apply compression algorithms like Huffman.

GitHub: https://github.com/Ferki-git-creator/numbase

I've been working on a C library that combines the best features of Fortran's multi-dimensional arrays with NumPy's expressiveness and Julia's performance.

Key features:

· Fortran-style column-major arrays with A[i,j] indexing

· NumPy-like operations (element-wise math, slicing, broadcasting)

· Memory-safe allocation/deallocation

· Efficient views instead of copies for slicing operations

· Linear algebra support (matmul, transpose, etc)

It's written in pure C99 with no dependencies beyond standard math libraries. Perfect for scientific computing where you need both performance and expressiveness in C.

GitHub: https://github.com/Ferki-git-creator/stdm

I used to make normal libraries - the hype quickly disappeared. And here I made something in 20 minutes, without fanaticism, and got 21 upvotes HN sometimes really works randomly.

This weekend I created stacklib.h - a single-header library that brings Forth-style stack operations to C. It implements a basic interpreter with:

- Stack operations (push/pop/dup/swap/over/drop) - Arithmetic (+, -, *, /) - Output (., emit, cr) - Stack inspection (.s, depth)

Example usage: Stack s; stack_init(&s); dict_init(); exec(&s, "10 20 + ."); // Prints "30" exec(&s, "1 2 3 4 .s"); // Shows stack contents

The library is self-contained, requires no dependencies, and handles basic error checking. It was inspired by wanting to understand how Forth works at a fundamental level while keeping the simplicity of C.

I'm curious what other stack-based or concatenative programming enthusiasts think about this approach. Has anyone else built something similar? What features would you add to make it more useful?

GitHub: https://github.com/Ferki-git-creator/stacklib

Hi HN, I want to share my updated FSP (Find Similar Patterns) v2 text compression algorithm. I tested it on a non-trivial excerpt from Romeo and Juliet, and it achieved impressive results: original size 437 bytes, compressed size 358 bytes, compression ratio 1.22. Unlike traditional methods like LZMA or Huffman, FSP v2 searches for repeating 3–5 character patterns, storing references (REF) alongside literal characters (LITERAL). This allows it to compress real-world text, maintain lossless decompression, and achieve compressed sizes smaller than the original. The algorithm works on any byte stream or text and can scale to larger files, potentially outperforming classical compression on texts with repetitive or near-repetitive patterns. Code and implementation details are available upon request.

GitHub: https://github.com/Ferki-git-creator/fsp

Website(more info): https://ferki-git-creator.github.io/fsp/

If I made a mistake somewhere, please tell me.

Hey HN, I’m trying to level up my productivity while working remotely. What’s one trick, habit, or tool that dramatically improved your workflow? Looking for actionable tips, not just generic advice.

GitHub: https://github.com/Ferki-git-creator/STB-Style-Single-File-C...

Lightweight single-header JSON parser/generator for C/C++ in STB tradition. Implements RFC 8259 (JSON), RFC 6901 (JSON Pointer), RFC 6902 (JSON Patch), and RFC 7386 (Merge Patch). Zero dependencies, thread-safe, UTF-8 validation, file I/O, minification, and custom allocators. Ideal for embedded systems and cross-platform projects.

GitHub: https://github.com/Ferki-git-creator/std_net