The lockfile includes a hash of the tarball, doesn't it?
3,559 karma · joined June 26, 2013
If you are a human and you wish to contact me, the sha1 hash of my email address is 9aae0f6d01421dde3d5085fa1a24adff6c9e344f. I look forward to hearing from you soon.
Hi'); DROP TABLE emails;--
<script>alert('Hi!')</script>
The lockfile includes a hash of the tarball, doesn't it?
There's a way to make JS functions callable by WASM, and that's how people build a bridge from WASM to the DOM, but it involves extra overhead versus some theoretical direct access.
The very first section of the article talks about replacing requirements.txt with pyproject.toml which contains a similar high-level list of deps
Tavern Pachimon Wars in Osaka seems like it fits the description
So presumably yes
[1] https://en.wikipedia.org/wiki/Electoral_history_of_Ron_DeSan...
So probably a perk they decided was worth it or necessary for morale at some point
The cloud had a slash through it, I tapped it and enabled the setting.
1. Open Google Maps
2. Tap my profile photo at top right
3. Pick "Your Timeline" from the menu
4. Tap the cloud icon in top navbar
5. Toggle the option to enable cloud backup
They also link this video: https://www.youtube.com/watch?v=KRpPqcrdE-o
Running this for 1.5 hours would consume 1KWh of energy, and compute 1.134e14 hashes (or 2^46.7 if you prefer).
Assuming SHA-256 hashes are essentially normally distributed, that means that finding a hash with 13 leading hex zeroes should be a 1-in-(16^13) aka 1-in-(2^52) odds.
This gives 2^(52-46.7) or 39.7KWh on average to generate a single 13-zero hash, and ~16x that (635KWh) for a 14-zero hash. I got very lucky finding a 14-zero hash quickly, vastly earlier than average expectation, so my energy usage is quite a bit lower than that.
- https://en.wikipedia.org/wiki/1999_South_Dakota_Learjet_cras...
- https://en.wikipedia.org/wiki/2000_Australia_Beechcraft_King...
- https://en.wikipedia.org/wiki/Helios_Airways_Flight_522
- https://en.wikipedia.org/wiki/2022_Baltic_Sea_Cessna_Citatio...
If you limit your variable portion to a base16 alphabet like A-P, radix encoding would just be `nibble + 0x41`. Sure you're encoding 4x as many values, but with full branch predictability. You'd have to experimentally determine if that performs any better.
You could also do something theoretically clever with bitmasking the 4 nibbles then adding a constant like 0x4141 or 0x00410041 or something (I'm too tired to think this through) and then you can encode twice as many per op assuming 32-bit bitwise ops are similar in speed to 16-bit bitwise ops.
Anyways this has been a cool challenge. You might also enjoy hunting for amulets - short poems whose sha256 hash contains a substring that's all 8: https://news.ycombinator.com/item?id=26960729
Doesn't seem to be a re-peat according to https://hn.algolia.com/?dateRange=all&page=0&prefix=true&que...