Hashpipe – Pipe iff the hash matches
jbenet.github.io
Hashpipe – Pipe iff the hash matches
1–10 of 90 posts
Re: Hashpipe – Pipe iff the hash matches
#2A polarizing name, if perhaps less so amongst programmers
Re: Hashpipe – Pipe iff the hash matches
#3A polarizing name, if perhaps less so amongst programmers
yeah, i was going to call it `hashcat` -- maybe i should do that. or `pipehash`.
Re: Hashpipe – Pipe iff the hash matches
#4A polarizing name, if perhaps less so amongst programmers
yeah, i was going to call it `hashcat` -- maybe i should do that. or `pipehash`.
already have a hashcat purring on my computer...
Re: Hashpipe – Pipe iff the hash matches
#5Be warned that this reads everything until EOF into memory, doing something like:
hashpipe QmUJPTFZnR2CPGAzmfdYPghgrFtYFB6pf1BqMvqfiPDam8 Re: Hashpipe – Pipe iff the hash matches
#6Be warned that this reads everything until EOF into memory, doing something like: hashpipe QmUJPTFZnR2CPGAzmfdYPghgrFtYFB6pf1BqMvqfiPDam8 will produce unexpected behaviour.
yeah, hashes are decided by every single bit including the last one, and not a single bit should be output until the hash matches. It currently buffers everything in memory, but might do this: https://github.com/jbenet/hashpipe/issues/1
(some settings dont have disk though).
hashpipe is intended for most executable use cases (usually under <50MB)
Re: Hashpipe – Pipe iff the hash matches
#7Be warned that this reads everything until EOF into memory, doing something like: hashpipe QmUJPTFZnR2CPGAzmfdYPghgrFtYFB6pf1BqMvqfiPDam8 will produce unexpected behaviour.
yeah, hashes are decided by every single bit including the last one, and not a single bit should be output until the hash matches. It currently buffers everything in memory, but might do this: https://github.com/jbenet/hashpipe/issues/1 (some settings dont have disk though). hashpipe is intended for most executable use cases (usually under <50MB)
Loading everything into memory at once shouldn't be necessary to produce a hash of the entire input. All of the hash functions currently supported allow for incremental hashing. That means you can hash in blocks instead of all at once.
Re: Hashpipe – Pipe iff the hash matches
#8Earlier quoted context omitted.
yeah, hashes are decided by every single bit including the last one, and not a single bit should be output until the hash matches. It currently buffers everything in memory, but might do this: https://github.com/jbenet/hashpipe/issues/1 (some settings dont have disk though). hashpipe is intended for most executable use cases (usually under <50MB)
Loading everything into memory at once shouldn't be necessary to produce a hash of the entire input. All of the hash functions currently supported allow for incremental hashing. That means you can hash in blocks instead of all at once.
The input still needs to be cached for eventual output in case the hash matches I assume.
Re: Hashpipe – Pipe iff the hash matches
#9A polarizing name, if perhaps less so amongst programmers
yeah, i was going to call it `hashcat` -- maybe i should do that. or `pipehash`.
I wager more programmers would object to hashcat than hashpipe; cat is for concatenating! http://en.wikipedia.org/wiki/Cat_%28Unix%29#Useless_use_of_c... ;)