Top all-time · #2803
ticki.github.io
Personal blog · ticki.github.io/blogprogrammingsystems
ticki.github.io is a personal blog at ticki.github.io about programming and systems. Since 2016, 27 different Hacker News readers have linked it 33 times, most often “Skip Lists Done Right”. The last post was in 2017, but the archive is still widely read.
Too few sampled comments (9) to say how often HN recommends it.?
Why HN links it
Linked for explanations of LZ4 compression, a Rust lifetimes series and the author's reasons for leaving open source. Comments cite it without judging the writing.
Summarised by Claude from a sample of 9 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
I'm Ticki.
Most-linked posts?
- Skip Lists Done Right3 people · 4 mentions · first linked 2016-09-23
- How LZ4 works (2016)3 people · 4 mentions · first linked 2017-06-25
- Fearless concurrency with hazard pointers3 people · 3 mentions · first linked 2017-08-02
- Why I'm leaving Open Source2 people · 2 mentions · first linked 2018-05-06
What Hacker News says?
TFS is very cool. Too sad that ticki has stopped working on it: http://ticki.github.io/blog/why_im_leaving_open_source/ Due to this, I don't know whether it will be ready at all.
Comment linking /blog/why_im_leaving_open_source/
on “Writing an OS in Rust: Advanced Paging”Submitted Skip Lists Done Right as a story · 451 points
HN discussionIt is used, and most every other compression technique was/is used in video games. I was thinking of using LZ4, but it doesn't really work that great on floating point, and images are already compressed (png, jpg, and even BCn, can't be compressed much further). So idk. Good thing about lz4 is that it's very simple[0] and probably faster then memcpy(). http://ticki.github.io/blog/how-lz4-works/
Comment linking /blog/how-lz4-works/
on “LZ4 – Extremely fast compression”Submitted A Hoare Logic for Rust as a story · 193 points
HN discussionI found this blog post describing some of the mechanics, but I am still interested in reading how this may be implemented branchlessly. http://ticki.github.io/blog/how-lz4-works/
Comment linking /blog/how-lz4-works/
on “LZ4 – Extremely fast compression”Submitted How LZ4 works (2016) as a story · 176 points
HN discussionI read the TFS github landing page and it didn't explain what the 'T' stood for. I then noticed the author's name is "Ticki"[1]. Therefore, I can only guess that TFS stands for "Ticki's File System" . [1] http://ticki.github.io/about/
Comment linking /about/
on “TFS: A file system built for performance, space efficiency, and scalability”Submitted SeaHash: Explained as a story · 143 points
HN discussionAs you pointed out, since this is an adversarial use case, a robust cryptographic hash function is the way to go. [For a non-cryptographic Hash function, SeaHash [1] would be the best choice, which is violently fast!] BLAKE2b would have been the perfect choice given the adversarial nature, as it much secure and faster than MD5. [2] MD5 is so broken, it's really poor choice for any use case - cryptographic (fundament…
Comment linking /blog/seahash-explained/
on “An Analysis of WeChat’s Realtime Image Filtering in Chats”Submitted Why I'm leaving Open Source as a story · 109 points
HN discussionReplying to a flagged/deleted comment from "nukeop": > From the man who brought you "The Case for Non-Binary Genders" last year. No thanks. Link for the lazy: https://ticki.github.io/blog/the-case-for-non-binary-genders... While this comment may not be directly "productive", I think the immediate response to it, and in general response to the topic at hand is rather instructive. It shows a general negativity (on bot…
Comment linking /blog/the-case-for-non-binary-genders/
on “Why I'm leaving Open Source”Submitted A Critique of Rust's `std::collections` as a story · 85 points
HN discussionPart 2 here: http://ticki.github.io/blog/lambda_crabs_2/
Comment linking /blog/lambda_crabs_2/
on “Lambda crabs, part 1: A mathematical introduction to lifetimes and regions”Submitted Lambda crabs, part 1: A mathematical introduction to lifetimes and regions as a story · 75 points
HN discussionThe really frustrating part is that linked lists are actually bad practices in most instances nowadays [0]. And skiplists are better than trees for many in-memory uses [1]. Not that you would usually implement such a thing yourself anyway. So these leetcode style interviews are actively selecting for people who practice 40 year old CS solutions that don't work well on modern hardware, and selecting against folks wit…
Comment linking /blog/skip-lists-done-right/
on “Byteboard assesses for on-the-job engineering skills”Submitted An Atomic Hash Table as a story · 14 points
HN discussion> Skiplists also win over balanced BSTs when it comes to concurrent access. Balanced Skiplists perform better than Skiplists which may skew otherwise (but balancing itself is expensive). Also, I've have found that maintaining cursors (at different points in a doubly-linked skiplist with million+ entries) instead of always looking for elements from the root/head is an even bigger win. > ConcurrentSkipListMap has been…
Comment linking /blog/skip-lists-done-right
on “What Are Skiplists Good For?”Submitted Why I'm leaving Open Source as a story · 6 points
HN discussionSubmitted Why Rust's `std::collections` is absolutely fantastic as a story · 4 points
HN discussionSubmitted Fearless concurrency with hazard pointers as a story · 3 points
HN discussionSubmitted Fearless concurrency with hazard pointers as a story · 3 points
HN discussionSubmitted Fearless concurrency with hazard pointers as a story · 3 points
HN discussionSubmitted You Are (Probably) Doing Login Systems Wrong as a story · 3 points
HN discussionSubmitted Making Terminal Applications in Rust with Termion as a story · 3 points
HN discussionSubmitted How LZ4 Works as a story · 2 points
HN discussionSubmitted Skip Lists: Done Right as a story · 2 points
HN discussionSubmitted Fearless concurrency with hazard pointers as a story · 2 points
HN discussionSubmitted Designing a good non-cryptographic hash function as a story · 2 points
HN discussionSubmitted Skip Lists done right as a story · 2 points
HN discussionSubmitted Skip Lists: Done Right as a story · 1 points
HN discussion
