Go to file
2021-01-19 00:37:42 +00:00
__pycache__ inital commit 2020-04-11 02:48:28 -05:00
kasten remove crypto, bump version 2020-12-27 03:30:13 +00:00
tests remove crypto, bump version 2020-12-27 03:30:13 +00:00
.gitignore more gitignore 2020-12-07 14:49:35 +00:00
CHANGELOG.md remove crypto, bump version 2020-12-27 03:30:13 +00:00
LICENSE added mimcgenerator and license boilerplate 2020-04-22 04:51:28 -05:00
Makefile inital commit 2020-04-11 02:48:28 -05:00
README.md Added more docs to readme 2020-08-26 20:58:31 +00:00
run_tests.sh inital commit 2020-04-11 02:48:28 -05:00
setup.py bump version for new mimcvdf version 2021-01-19 00:37:42 +00:00

Kasten 🖃

Binary serialization format with metadata, validation, and configurable hash IDs with proof-of-work (VDF) support.

Kasten is intended to wrap messages for transport agnostic communication.

Sending a message:

import kasten

# Bob creates message

message = b"hello world"
# Mode for any external lib to use
encrypt_mode = 0
packed_message: bytes = kasten.generator.pack.pack(message, 'txt', encrypt_mode)

# We pick the base generator which checks for sha3_256 validity and that's it
# However we could also pick KastenMimcGenerator which has both validity and proof-of-work ratelimiting
# Or, we could make our own. Both parties just need the same logic.
kasten = kasten.generator.KastenBaseGenerator.generate(packed_message)

message_checksum: bytes = kasten.id

# Bob sends packed_message and message_checksum to Alice

Receiving a message:

import kasten

# Alice receives message
bobs_message = b'\x93\xa3txt\x00\xce_F\xc7!\nhello world'
bobs_checksum = b"\xac\x83K=n\xdb\xba\x9aJ\xca:\x82]'9b\xd0\x98\xda\xee'\x9f\xf2\xd7\x94\x9e\x91\x94\x9dnh6\x02\x03\xf0\xfe\x85\xbdrLj]R\xeb;xB@"

# Recreate on Alice's end using the checksum, message, and the same generator
# The generator will automatically check message validity and throw a kasten.exceptions.InvalidID exception if failed
kasten_message = kasten.Kasten(bobs_checksum, bobs_message, kasten.generator.KastenBaseGenerator)