Posts filled under #hash


HOLEEE FUK THIS GMO ( Garlic Cookies ) by @moxie__michigan is PURE FUKKING FIRE ... this shit is next level topshelf shit... id like to shout out the grower but not sure if it was @dankemshunter or sumone else but credit to the unbelievably stinky for liveresin... so funky... rediculous flyin off the shelves at @firstclass517 ... the lemon punch is straight flame as well it won the recent high times cannabis cup here in MI ... Shatterday night terpfest #mmmp#moxie#moxiemichigan#liveresin#gmo#garliccookies#terps#terpsdontlie #funky#dabs#dab#wax#budder#shatter#topshelf#cupwinners#lansterdamn#michiganja#holyshit#youcantrollwithus#extracts#comcentrates#hash#dope

Excerpt from @edrosenthal

Excerpt from @edrosenthal420 This Bud's for You: "The relation between a master gatherer and the resin goes beyond the realm of collecting. Preservation and aging in tropical countries are essential to quality and longevity. To this end, a Royal Nepalese Temple Ball was the ultimate manifestation of resin optimization and preservation; the origins of such a cutting edge approach to packaging and long-term conservation may never be discovered but the art should not be lost. The Royal Nepalese Temple Balls were stuff of mythology already in the late 70s and early 80s, a fairy tale for many and the Holy Grail of concentrates for a few. Imagine a sphere of resin hand pressed to an absolutely unflawed dark and hard surface polished to a mirror-like quality, a ball that resembles more a glossy stone or black marble than resin. Imagine an outside protective layer of resin fused into a crust so perfect that it can stand the depredation of time and nurture the aging evolution at its core. Imagine cracking open a ten-year-old resin ball like you would break a big egg, the inner core revealing itself slowly in all its glorious creaminess. Imagine a spicy tropical fruit cocktail with subtle earthy undertones taking over your olfactory senses as the resin breaks apart reluctantly exposing its dark red melted caviar like texture, the long contained aromas bursting out with an explosive force. Imagine creating such a wonder!" - SCIENCE MEETS TRADITIONS - THE LOST ART OF THE HASHISHIN WORKSHOP BARCELONA SEPTEMBER 9th For tickets and info EventBrite Search: Lost Art Barcelona THE LOST ART OF THE HASHISHIN WORKSHOP SAN FRANCISCO SEPTEMBER 24th For tickets and info EventBrite Search: Lost Art San Francisco #fortheloveoftheplant #AficionadoEstates #boldtbags #emeraldtriangle #emeraldtrianglegenetics #frenchycannoli #frenchytech #fullspectrum #hashishin #hashish #hashishlovers #hash #icewatersieving #icewaterhash #lostartofthehashishin #ouhlala #press2activate #presstech #pressedhash #resin #rosin #templeball #tradition #terroir #weedworldmag #sieveNOTextract

An extract on #hash

The ideal cryptographic hash function has five main properties: it is deterministic so the same message always results in the same hash it is quick to compute the hash value for any given message it is infeasible to generate a message from its hash value except by trying all possible messages a small change to a message should change the hash value so extensively that the new hash value appears uncorrelated with the old hash value it is infeasible to find two different messages with the same hash value Cryptographic hash functions have many information-security applications, notably in digital signatures, message authentication codes (MACs), and other forms of authentication. They can also be used as ordinary hash functions, to index data in hash tables, for fingerprinting, to detect duplicate data or uniquely identify files, and as checksums to detect accidental data corruption. Indeed, in information-security contexts, cryptographic hash values are sometimes called (digital) fingerprints, checksums, or just hash values, even though all these terms stand for more general functions with rather different properties and purposes.

Most cryptographic hash functions are designed to take a string of any length as input and produce a fixed-length hash value. A cryptographic hash function must be able to withstand all known types of cryptanalytic attack. In theoretical cryptography, the security level of a cryptographic hash function has been defined using the following properties: Pre-image resistance Given a hash value h it should be difficult to find any message m such that h = hash(m). This concept is related to that of one-way function. Functions that lack this property are vulnerable to preimage attacks. Second pre-image resistance Given an input m1 it should be difficult to find different input m2 such that hash(m1) = hash(m2). Functions that lack this property are vulnerable to second-preimage attacks. Collision resistance It should be difficult to find two different messages m1 and m2 such that hash(m1) = hash(m2). Such a pair is called a cryptographic hash collision. This property is sometimes referred to as strong collision resistance. It requires a hash value at least twice as long as that required for preimage-resistance; otherwise collisions may be found by a birthday attack. Collision resistance implies second pre-image resistance, but does not imply pre-image resistance. The weaker assumption is always preferred in theoretical cryptography, but in practice, a hash-function which is only second pre-image resistant is considered insecure and is therefore not recommended for real applications. Informally, these properties mean that a malicious adversary cannot replace or modify the input data without changing its digest. Thus, if two strings have the same digest, one can be very confident that they are identical. Second pre-image resistance prevents an attacker from crafting a document with the same hash as a document the attacker cannot control. Collision resistance prevents an attacker from creating two distinct documents with the same hash. A function meeting these criteria may still have undesirable properties. Currently popular cryptographic hash functions are vulnerable to length-extension attacks: given hash(m) and len(m) but not m, by choosing a suitable m' an attacker can calculate hash(m || m') where || denotes concatenation. This property can be used to break naive authentication schemes based on hash functions. The HMAC construction works around these problems. In practice, collision resistance is insufficient for many practical uses. In addition to collision resistance, it should be impossible for an adversary to find two messages with substantially similar digests; or to infer any useful information about the data, given only its digest. In particular, should behave as much as possible like a random function (often called a random oracle in proofs of security) while still being deterministic and efficiently computable. This rules out functions like the SWIFFT function, which can be rigorously proven to be collision resistant assuming that certain problems on ideal lattices are computationally difficult, but as a linear function, does not satisfy these additional properties. Checksum algorithms, such as CRC32 and other cyclic redundancy checks, are designed to meet much weaker requirements, and are generally unsuitable as cryptographic hash functions. For example, a CRC was used for message integrity in the WEP encryption standard, but an attack was readily discovered which exploited the linearity of the checksum.