https://github.com/laurci/simple-base95

https://github.com/laurci/simple-base95

Last synced: 30 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/laurci/simple-base95
• Owner: laurci
• Created: 2021-07-12T19:08:41.000Z (over 3 years ago)
• Default Branch: master
• Last Pushed: 2021-07-12T19:11:48.000Z (over 3 years ago)
• Last Synced: 2024-10-30T06:27:14.626Z (3 months ago)
• Language: TypeScript
• Size: 4.88 KB
• Stars: 3
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# BASE 95

Basic (and poorly optimized) implementation of an encoder/decoder in a custom alphabet that contains all the printable characters in ASCII. The implementation is based on bitconin's base58 encoding. The alogrithm can work with any alphabet that contains less than 255 characters. For base95, the encoded output is about 7% bigger on average than the input.

# Why?

@alex.ifrim :)

# How it works?

We encode byte arrays by doing divisions on all digits in the input bugger (this way we create a representation of that number in the desired base). For every leading 0 in the buffer we encode as a single leader character (it is chosed as the first character from the alphabet and is decoded as 8 bits). Every other charater depend on the base.

# What's next?

Maybe optimize this implementation to get more performance. Make it async? Parallelize it? Do all of that and write in as Node native extension in Rust? Or... Nothing :) Up to you.