<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: timmclean</title><link>https://news.ycombinator.com/user?id=timmclean</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 13 Jun 2026 12:51:04 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=timmclean" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by timmclean in "Ferrocene – Rust for Critical Systems"]]></title><description><![CDATA[
<p>For supply chain security, you might be interested in cargo-vet[0], a tool for coordinating and requiring manual reviews of open source dependencies. Both Mozilla and Google[1] have started publishing their audits.toml files, which are machine-readable files describing what source code reviews they have performed.<p>[0] <a href="https://github.com/mozilla/cargo-vet">https://github.com/mozilla/cargo-vet</a><p>[1] <a href="https://opensource.googleblog.com/2023/05/open-sourcing-our-rust-crate-audits.html" rel="nofollow noreferrer">https://opensource.googleblog.com/2023/05/open-sourcing-our-...</a></p>
]]></description><pubDate>Sun, 08 Oct 2023 19:08:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=37813468</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=37813468</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37813468</guid></item><item><title><![CDATA[New comment by timmclean in "Results of technical investigations for Storm-0558 key acquisition"]]></title><description><![CDATA[
<p>Is there a reason why they couldn't split the load across multiple HSM? For something so sensitive I would've expected a design where one or more root/master keys (held in HSM) are periodically used to sign certificates for temporary keys (which are also held in HSM). The HSMs with the temporary keys would handle the production traffic. As long as the verification process can validate a certificate chain, then this design should allow them to scale to as many HSMs as are needed to handle the load...</p>
]]></description><pubDate>Thu, 07 Sep 2023 00:01:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=37413082</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=37413082</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37413082</guid></item><item><title><![CDATA[New comment by timmclean in "InternLM – new open source 7B LLM"]]></title><description><![CDATA[
<p>Saving you a click: despite what the repo title might suggest, while the code is open source, the model weights cannot be used commercially without permission.<p>> The code in this repository is open-source under the Apache-2.0 license. The InternLM weights are fully open for academic research and also allow commercial use with written permission from the official team. For inquiries about commercial licenses and collaborations, please contact internlm@pjlab.org.cn.<p><a href="https://github.com/InternLM/InternLM#open-source-license">https://github.com/InternLM/InternLM#open-source-license</a></p>
]]></description><pubDate>Thu, 06 Jul 2023 19:18:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=36621349</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=36621349</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36621349</guid></item><item><title><![CDATA[New comment by timmclean in "AWS doesn't make sense for scientific computing"]]></title><description><![CDATA[
<p>FWIW, spot prices for c5a.24xlarge in us-east-2b and us-east-2c seem to have been under $0.92/hr for most of the last 3 months. So, assuming some flexibility on the choice of region, that would adjust your estimate to $0.92 / $1.69 * $1233.70/mo = $671.60/mo, which looks a lot more reasonable. Hopefully I did that math right. Data egress prices are definitely still ridiculous, I agree.</p>
]]></description><pubDate>Fri, 07 Oct 2022 23:01:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=33128003</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=33128003</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33128003</guid></item><item><title><![CDATA[ChaosDB Explained: Azure's Cosmos DB Vulnerability Walkthrough]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.wiz.io/blog/chaosdb-explained-azures-cosmos-db-vulnerability-walkthrough">https://www.wiz.io/blog/chaosdb-explained-azures-cosmos-db-vulnerability-walkthrough</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=29283057">https://news.ycombinator.com/item?id=29283057</a></p>
<p>Points: 116</p>
<p># Comments: 34</p>
]]></description><pubDate>Fri, 19 Nov 2021 21:53:31 +0000</pubDate><link>https://www.wiz.io/blog/chaosdb-explained-azures-cosmos-db-vulnerability-walkthrough</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=29283057</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=29283057</guid></item><item><title><![CDATA[ChaosDB Explained: Azure's Cosmos DB Vulnerability Walkthrough]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.wiz.io/blog/chaosdb-explained-azures-cosmos-db-vulnerability-walkthrough">https://www.wiz.io/blog/chaosdb-explained-azures-cosmos-db-vulnerability-walkthrough</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=29204338">https://news.ycombinator.com/item?id=29204338</a></p>
<p>Points: 10</p>
<p># Comments: 2</p>
]]></description><pubDate>Fri, 12 Nov 2021 20:48:16 +0000</pubDate><link>https://www.wiz.io/blog/chaosdb-explained-azures-cosmos-db-vulnerability-walkthrough</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=29204338</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=29204338</guid></item><item><title><![CDATA[New comment by timmclean in "Class Action Lawsuit Filed Against Robinhood"]]></title><description><![CDATA[
<p>Thank you for your comments on this thread and others today. They have been very helpful in understanding what is actually going on.</p>
]]></description><pubDate>Fri, 29 Jan 2021 00:03:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=25951401</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=25951401</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=25951401</guid></item><item><title><![CDATA[New comment by timmclean in "Micro-op fusion in x86"]]></title><description><![CDATA[
<p>I believe you're thinking about `add`. According to Agner Fog's instruction tables, the load and ALU uops are fused for `add`s, but not in the case of `inc`<p><a href="http://www.agner.org/optimize/instruction_tables.pdf" rel="nofollow">http://www.agner.org/optimize/instruction_tables.pdf</a></p>
]]></description><pubDate>Mon, 05 Feb 2018 03:34:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=16306420</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=16306420</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16306420</guid></item><item><title><![CDATA[New comment by timmclean in "Micro-op fusion in x86"]]></title><description><![CDATA[
<p>That all makes sense, but it doesn't seem to apply to the example code in the article, right? `inc` doesn't decode to a single fused uop on Ivy Bridge. AFAIK, the example code in both cases decodes to the same number of uops in the fused domain...</p>
]]></description><pubDate>Sun, 04 Feb 2018 22:20:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=16305273</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=16305273</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16305273</guid></item><item><title><![CDATA[New comment by timmclean in "MD6 Message-Digest Algorithm"]]></title><description><![CDATA[
<p>The important thing to take away from this article is that MD6 really shouldn't be used in any production software, unfortunately. MD6 didn't even make it past the first round of the SHA-3 competition, so it hasn't received much attention from cryptanalysts.<p>Cryptohipsters (can I coin this term?) should take a look at Skein (a third-round SHA-3 candidate), BLAKE2 (the successor of a third-round SHA-3 candidate), and Keccak (the SHA-3 winner). These hash functions have undergone much more analysis. Notably, BLAKE2 is faster than MD5 in many cases, but without the security problems of MD5.</p>
]]></description><pubDate>Sun, 29 May 2016 19:55:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=11797935</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=11797935</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=11797935</guid></item><item><title><![CDATA[New comment by timmclean in "A list of command line tools for manipulating structured text data"]]></title><description><![CDATA[
<p>I've been meaning to learn jq, so I decided to give it a try.<p><pre><code>    FRUITS=$(cat input.json | jq '.models | map(select(.title == "fruits")) | .[0]')
    FRUIT_NAME_KEY=$(echo "$FRUITS" | jq '.fields | map(select(.name == "Name")) | .[0].key')
    
    FARMERS=$(cat input.json | jq '.models | map(select(.title == "farmers")) | .[0]')
    FARMER_NAME_KEY=$(echo "$FARMERS" | jq '.fields | map(select(.name == "Full name")) | .[0].key')
    FARMER_FRUITS_KEY=$(echo "$FARMERS" | jq '.fields | map(select(.name == "Fruits")) | .[0].key')
    
    BOB=$(echo "$FARMERS" | jq '.entities | map(select(.['$FARMER_NAME_KEY'] == "Bob, the farmer")) | .[0]')
    BOB_FRUIT_IDS=$(echo "$BOB" | jq '.['$FARMER_FRUITS_KEY'] | .[]' -r)
    
    for BOB_FRUIT_ID in "$BOB_FRUIT_IDS"; do
        echo "$FRUITS" | jq '.entities | map(select(._id == "'$BOB_FRUIT_ID'")) | .[0] | .['$FRUIT_NAME_KEY']'
    done
</code></pre>
There's a bit of bash boilerplate, but honestly it was about what I would expect, given a structure with so many layers of indirection.<p>Pain points:<p>* Switching between bash and jq's filtering language led me to use string interpolation with bash variables. Malicious inputs can probably exploit this (and it was just awkward anyway).<p>* A "select one" filter would be nice, instead of select + get first element.</p>
]]></description><pubDate>Sat, 07 May 2016 21:41:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=11651458</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=11651458</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=11651458</guid></item><item><title><![CDATA[Why losing a home means losing everything]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.washingtonpost.com/news/wonk/wp/2016/02/29/how-the-housing-market-exploits-the-poor-and-keeps-them-in-poverty/">https://www.washingtonpost.com/news/wonk/wp/2016/02/29/how-the-housing-market-exploits-the-poor-and-keeps-them-in-poverty/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=11250598">https://news.ycombinator.com/item?id=11250598</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 09 Mar 2016 03:01:44 +0000</pubDate><link>https://www.washingtonpost.com/news/wonk/wp/2016/02/29/how-the-housing-market-exploits-the-poor-and-keeps-them-in-poverty/</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=11250598</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=11250598</guid></item><item><title><![CDATA[New comment by timmclean in "OweFS – One-way encrypted file system"]]></title><description><![CDATA[
<p>The author should use a library that provides a simple "encryptWithPublicKey" method, so that any choices about RSA key size, AES mode of operation, etc are all taken care of.  NaCl[1] would probably be best, since it's written and audited by prominent cryptographers.<p>[1] <a href="http://nacl.cr.yp.to/" rel="nofollow">http://nacl.cr.yp.to/</a></p>
]]></description><pubDate>Sat, 16 Jan 2016 00:22:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=10913401</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10913401</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10913401</guid></item><item><title><![CDATA[New comment by timmclean in "OweFS – One-way encrypted file system"]]></title><description><![CDATA[
<p>Heads up to anyone considering using this: the author wrote their own crypto code[1].  I would recommend against using this until that is fixed... I've already spotted a few vulnerabilities.<p>[1] <a href="https://github.com/FedericoCeratto/owefs/blob/master/pycryptoenc.py" rel="nofollow">https://github.com/FedericoCeratto/owefs/blob/master/pycrypt...</a></p>
]]></description><pubDate>Fri, 15 Jan 2016 23:33:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=10913114</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10913114</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10913114</guid></item><item><title><![CDATA[Million Dollar Curve]]></title><description><![CDATA[
<p>Article URL: <a href="https://cryptoexperts.github.io/million-dollar-curve/">https://cryptoexperts.github.io/million-dollar-curve/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=10823350">https://news.ycombinator.com/item?id=10823350</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 01 Jan 2016 20:48:52 +0000</pubDate><link>https://cryptoexperts.github.io/million-dollar-curve/</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10823350</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10823350</guid></item><item><title><![CDATA[The design flaw in PBKDF2]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.chosenplaintext.ca/2015/10/08/pbkdf2-design-flaw.html">https://www.chosenplaintext.ca/2015/10/08/pbkdf2-design-flaw.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=10356146">https://news.ycombinator.com/item?id=10356146</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 08 Oct 2015 20:55:08 +0000</pubDate><link>https://www.chosenplaintext.ca/2015/10/08/pbkdf2-design-flaw.html</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10356146</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10356146</guid></item><item><title><![CDATA[Researchers make quantum computing breakthrough, paving way for world-first chip]]></title><description><![CDATA[
<p>Article URL: <a href="http://www.smh.com.au/technology/sci-tech/australian-researchers-make-quantum-computing-breakthrough-paving-way-for-worldfirst-chip-20151005-gk1bov.html">http://www.smh.com.au/technology/sci-tech/australian-researchers-make-quantum-computing-breakthrough-paving-way-for-worldfirst-chip-20151005-gk1bov.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=10342769">https://news.ycombinator.com/item?id=10342769</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 06 Oct 2015 22:11:32 +0000</pubDate><link>http://www.smh.com.au/technology/sci-tech/australian-researchers-make-quantum-computing-breakthrough-paving-way-for-worldfirst-chip-20151005-gk1bov.html</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10342769</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10342769</guid></item><item><title><![CDATA[New comment by timmclean in "Enough with the Salts: Updates on Secure Password Schemes"]]></title><description><![CDATA[
<p>Modern password hashes are designed to use a large amount of RAM in addition to CPU time in order to make password cracking using ASICs and GPUs more difficult.  The paper on Argon2[1], the winner of the recent password hashing competition, would be a good read if you're interested in learning more about how password hashes are designed.<p>[1] <a href="https://www.cryptolux.org/images/0/0d/Argon2.pdf" rel="nofollow">https://www.cryptolux.org/images/0/0d/Argon2.pdf</a></p>
]]></description><pubDate>Mon, 21 Sep 2015 18:09:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=10254071</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10254071</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10254071</guid></item><item><title><![CDATA[New comment by timmclean in "Enough with the Salts: Updates on Secure Password Schemes"]]></title><description><![CDATA[
<p>Mainly because it adds complexity, and complexity in crypto can hide subtle bugs.  Example: <a href="http://blog.ircmaxell.com/2015/03/security-issue-combining-bcrypt-with.html" rel="nofollow">http://blog.ircmaxell.com/2015/03/security-issue-combining-b...</a></p>
]]></description><pubDate>Mon, 21 Sep 2015 17:58:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=10253980</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10253980</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10253980</guid></item><item><title><![CDATA[Escaping callback hell]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.chosenplaintext.ca/2015/09/09/callback-hell.html">https://www.chosenplaintext.ca/2015/09/09/callback-hell.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=10195655">https://news.ycombinator.com/item?id=10195655</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Thu, 10 Sep 2015 01:16:34 +0000</pubDate><link>https://www.chosenplaintext.ca/2015/09/09/callback-hell.html</link><dc:creator>timmclean</dc:creator><comments>https://news.ycombinator.com/item?id=10195655</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10195655</guid></item></channel></rss>