If you had a proven method to make every eth layer 1 transaction 1/8 it’s current size in bits and be readable, writable, and executable without bringing it back to its original size; how would you go about getting it into the hands of the ethereum foundation?

CEO @ LogN | helloworld.beb | fully homomorphic compression

PS the big O for linear search using this method is: O((n)/((input_size/output_size)-search_overhead))

For example: ((1000000)/((793/86)-0.8))=118,764 vs 1,000,000 which is roughly 8.42x faster.

@vitalik.eth what are your thoughts?! Our tech is based on a sister problem to FHE, fully homomorphic compression.