number-speller VS PoxHash

Hey guys. If you remember me from several months ago, with this object de art, I am here with a less cringy question than that of 'I made a hash function!!!111'. I apologize if this question is basic btw. My question is, how do crypto functions, of any kind, deal with character size? For example in C, wchar_t is either 2 or 4 bytes. So, if the implementation goes through the stream like stream++ it will be stepping word-wise not byte-wise. And then if another machine, using a different implementation, reads the stream byte-wise and not word-wise, then it won't get the same message right?

I am happy with my progress and I am not hasty at all. If you go to my Github you will see that my previous project was in every way inferior. At least I can wrap my head around most basic things now.

The whole process is not optimal anyways. But I guess I will just have to pay my due diligence in this field until I can do something worthwhile. Keep in mind that I wrote this degeneracy so I have in the least grown. i don't want this compression algorithm to be as bad as what I just linked is. At least a bit more performant and applicable.

I do a great deal of coding with Python. Most modern languages are similar. Like take my project PoxHash as an example. I wrote it in C, Rust, Nim, Go, Python and JS. So this alone should serve as enough of a proof that I can code. But know x many languages does not make you a 'good' programmer. Racking up languages in your portfolio is does not a programmer make! What makes a good programmer is 1- familiarity with theory 2- knowing where to apply that theory.

Hey. I was recently working on a pubsub fuzztester where I used C + Assembly to communicate with the broker and Python to pre-generate the packets. My client wanted a much simpler thing, and we decided to part ways. That is why I, as I promised my former client, to always specify that I am a person to always take the more challenging way, and never aim at mediocrity. My recent projects include PoxHash, a block hash algorithm by me, which I implemented in 6 languages (C, Rust, Go, Nim, JS, Python). I always aim at micro-optimization. I never half-ass a job, I may take full-assing it too far though. Another recent project of mine is ProtoGen (I know!), a series of application-layer protocols in Go. I try often not to language-hop much. I post small codes in Gist form too, for example, a PRNG in x86-64 Assembly and a Hash in Aarch64 Assembly here or a metaprogram in Bash here.

You can view my portfolio in my Github profile, linked above. I have a special showcase session, sorted my projects by topic, and language also. I am a bit light on Assembly code samples, only have 3. That I am working on right now. My recent complete project was PoxHash, a block hash algorithm that is not very good, but is a good showcase of my skills as it is in six languages (C, Rust, Go, Python, Nim, JS). I have published several small Gists since then.

I am against overusing libraries anyhow. Some people freaking spoil library usage. There's a package on NPM called 'is-odd'. I shrill, and cringe every time I remember this fact. I managed to implement my own hashing algorithm (which is very slow and is not a proper hash algorithm in general but I had fun making it and fun and education was the point) in C, Rust, Go, Nim, Python and JS without using a single non-std library! Hell sometimes I did not even use the STD when I should have. For example, I wrote a function called to_e_notation/toENotation across all these 6 languages (albeit I did not make full use of every languages features, so I kinda cheated) which formats a float into e notation. Did I need to do it? No. But I wanted to. I'm currently writing a PNG decoder/encoder for my new Rust project. I initially wanted to forgo implementing Zlib standard and bind the official implementation myself but I now thing it would be cool if I implemented Zlib myself. Should be educational. Thoughts?

So I wrote a hash and implemented it in 6 languages: https://github.com/chubek/PoxHash

I once thought bitwise operations in Python is impossible due to it rotating one to the left every time it overflows but I now realize even bitwise operations with Python is possible WITH overflow (like, not using it's array.array STD as I did in my implementation of Python implementation of PoxHash but you can just & the result with max of the bits like if you want your integer to be strictly a byte you just & it with 0xff. These tricks make the life of a systems programmer in Python much easier.