npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

hendricks

v4.0.0

Published

Very tiny byte encoding

Downloads

25

Readme

hendricks

Protocol encoding for a new internet.

Richard Hendricks

Install

Install with npm

$ npm i hendricks --save-dev

Why

Web3 seeks to "decentralize" the internet. What this means in practice is turning centrally operated services into peer-to-peer protocols.

Encoding data for protocols is not like encoding data for services. Protocols are difficult to upgrade and must be precisely specified. They often operate in environments where minimizing storage costs is extremely important (such as the Ethereum Virtual Machine).

Protocols also need the ability to "split" to a different schema based on a version/type byte. For example in the dev p2p protocol, the first byte instructs the consumer how to interpret rest of the message (if the first byte is 0x00, interpret the remaining bytes as a hello, if the first byte is 0x01, interpret the remaining bytes as a disconnect).

Hendricks lets any protocol developer create easily upgradable, and splitable, protocols while being extremely conservative with bytes.

Binary only

Hendricks has no support for strings, integers, etc. Everything must be converted into binary before being encoded. For the javascript implementation, that means Uint8Arrays.

Templates

The primary concept in hendricks is the template. You can think of a template like a container that data can be placed in. Each template has their own encoding scheme, and templates can be nested into other templates. Every schema has a single root template.

There are 5 kinds of templates: fixed templates (1), dynamic templates (2), list templates (3), dictionary templates (4), split templates (5).

1. Fixed Templates

Fixed templates are designed for fixed-length data. They are useful when you know the size of the data never changes, for example elliptic curve keypairs and IP addresses. When defining a fixed template, the size of the data must be specified.

Since the size of the data is fixed and needs no length encoding, an encoding of a fixed template is simply the data itself.


const Fixed = require('hendricks/lib/Fixed')

publicKeyTemplate = new Fixed(33)
privateKeyKeyTemplate = new Fixed(32)

myPublicKey = new Uint8Array([1, 2, ..., 33])
myPrivateKey = new Uint8Array([1, 2, ..., 32])

publicKeyTemplate.encode(myPublicKey)
// > Uint8Array([1, 2, ..., 33])
privateKeyKeyTemplate.encode(myPrivateKey)
// > Uint8Array([1, 2, ..., 32])

2. Dynamic Templates

Dynamic templates allow for encoding variable-length data. When defining a dynamic template, the number of bytes needed to encode the length, referred to as the length encoding length, is specified. For example, if a dynamic field must contain data between 0 and 255 bytes, a length encoding length of 1 is needed. If a dynamic field contains between 0 and (256**2 - 1) bytes, a length encoding length of 2 is needed.

Length Encoding Length | Min Length | Max Length | --- | --- | --- | 1 | 0 | 255 | 2 | 0 | (256 ** 2) - 1 3 | 0 | (256 ** 3) - 1 4 | 0 | (256 ** 4) - 1


const Dynamic = require('hendricks/lib/Dynamic')

nameTemplate = new Dynamic(1) // name between 0 and 255 bytes
infoTemplate = new Dynamic(2) // info between 0 and 255 ** 2 bytes

name.encode(new Uint8Array([1, 2, 3, 4]))
// > Uint8Array([4, 1, 2, 3, 4])

info.encode(new Uint8Array([1, 2, ..., 256]))
// > Uint8Array([1, 0, 1, 2, ..., 256])

Length encodings are big-endian and left-padded.

3. List Templates

List templates allow for encoding arrays of data, where each element in the array is of the same template. When defining a list template, a length encoding length child template is needed.

const List = require('hendricks/lib/List')

publicKeysTemplate = new List(1, publicKey) // between 0 and 255 publicKeys

4. Dictionary Templates

Dictionary templates allow for encoding structs of data. When defining a dictionary template, an array of templates is specified.

const Dictionary = require('hendricks/lib/Dictionary')

storeTemplate = new Dictionary(['name', 'publicKeys'], [
  nameTemplate,
  publicKeysTemplate
])

5. Split Templates

Imagine you create a protocol that includes transmitting a public key. Later on, you decide you want to change your protocol so that users can transmitting multiple public keys. A split template allows you to upgrade your protocol.

When creating a split template, pass in a branch index encoding length, an array of strings for the branch names, and an array of templates.

The branches index encoding length tells the template how many bytes to allocate to branch index. For example if you expect between 0 and 255 branches, use a branches index encoding length of 1. If you expect between 0 and 256**2 - 1 branches, use a branches index encoding length of 2.

Branch indexes are big-endian and left-padded.

Branch Index Encoding Length | Min Branch Index | Max Branch Index | --- | --- | --- | 1 | 0 | 255 | 2 | 0 | (256 ** 2) - 1 3 | 0 | (256 ** 3) - 1 4 | 0 | (256 ** 4) - 1

const Split = require('hendricks/lib/Split')

versionTemplate = new Split(1, ['v0', 'v1'], [
  publicKeyTemplate,
  publicKeyTemplates
])

versionTemplate.encode({
  key: 'v0',
  value: publicKey
})
// > new Uint8Array([0, 1, 2, ..., 33])
versionTemplate.encode({
  key: 'v1',
  value: publicKeys
})
// > new Uint8Array([1, 2, 1, 2, ..., 33, 1, 2, ..., 33])

Split templates are also useful when your protocol changes based on a type byte. For example in SafeMarket a 0x00 byte tells the consumer to interpret the rest of the bytes as a store declaration, while a 0x01 tells the consumer to interpret the bytes as a message. Here's how a split template could be used to encode this.

const Split = require('hendricks/lib/Split')

typeTemplate = new Split(['store', 'message'], [
  storeTemplate,
  messageTemplate
])

versionTemplate.encode({
  key: 'store',
  value: storeData
})
// > new Uint8Array([0, 2, ..., 33])
versionTemplate.encode({
  key: 'message',
  value: messageData
})
// > new Uint8Array([1, 1, 2, ..., 1000])

Usage

const Split = require('hendricks/lib/Split')
const Dictionary = require('hendricks/lib/Dictionary')
const Dynamic = require('hendricks/lib/Dynamic')
const Fixed = require('hendricks/lib/Fixed')
const List = require('hendricks/lib/List')

Running tests

Install dev dependencies:

$ npm i -d && npm test

Contributing

Pull requests and stars are always welcome. For bugs and feature requests, please create an issue

License

Copyright © 2017 Licensed under the ISC license.


This file was generated by readme-generator on May 04, 2017.