<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>rwmj</author><text>&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;facebook&amp;#x2F;zstd&amp;#x2F;issues&amp;#x2F;395#issuecomment-535875379&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;facebook&amp;#x2F;zstd&amp;#x2F;issues&amp;#x2F;395#issuecomment-535...&lt;/a&gt;&lt;p&gt;If anyone from Facebook is reading, please look at making zstd seekable.  There is already experimental support but it needs to be standardized.  This could open up really interesting new use-cases [see my comment linked above], where currently we have to use much slower xz&amp;#x2F;lzma instead.</text><parent_chain></parent_chain></comment><story><title>Zstandard v1.4.7</title><url>https://github.com/facebook/zstd/releases/tag/v1.4.7</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>kieckerjan</author><text>Zstandard is great indeed. Performance is excellent, but in my experience its killer feature is the user definable dictionary. My search engine software stores its documents in an archive to which I need random access. Lots of small documents, random access: bad for compression. Use of zstd with a tuned dictionary improved compression fivefold(!) when compared to the older zlib solution.</text><parent_chain></parent_chain></comment><story><title>Zstandard v1.4.7</title><url>https://github.com/facebook/zstd/releases/tag/v1.4.7</url></story>