HNHacker News
TopNewBestAskShowJobs

shudv

6 karma · joined April 19, 2019

Anti-slop cannon
submissionscomments
shudv··on The age of "Software Deslopers" is coming
Done. I am going to spell it as "Desloppers" going forward. And if this term gets gains traction I am going to credit you as a contributor my friend :D
shudv··on The age of "Software Deslopers" is coming
You can throw away prototypes, sure. But can you just throw something out something that is supporting a critical workload? Not really.

Also what would be the plan after you throw out the AI slop? Rebuild it using AI? Why wouldn't that be slop as well that would have to be thrown out?

shudv··on The age of "Software Deslopers" is coming
I agree. It's hard to foresee exactly where this settles, if it settles.

My sentiment is more of a hope than a prediction. The way I see this is - even if AI gets stronger from here, assuming business continue to exist - what will they compete on exactly if all businesses have access to the same level of intelligence? It would again boil down to who is able to harness the power of AI better and that again would require understanding and controlling system complexity i.e. "desloping".

shudv··on Ask HN: What did you build this winter?
If you have worked with React before - you would know that its actually not straightforward to correctly memoize computation. That is specially true for operations on collection data like filters and sorts.

That pushed me to first build this - https://github.com/shudv/memotable

which is a way to build a "read-optimised" in-memory collection so that re-renders in the ui layer do not run filters and sorts on the data again and again unnecessarily.

And this was sufficient to solve my original problem.

DeltaSort was just something that came to me while I was thinking about taking memotable performance to the next level - make the sorting as fast as possible. Thats when it hit me - if I am able to somehow use the information about the delta since the previous sort - that might help me re-sort much faster. And it turns out, it actually is much faster (at least for the Rust based implementation)

shudv··on Ask HN: What did you build this winter?
you are right - december is a good time to disconnect from the daily chaos and do some focussed work.

I worked on this: https://github.com/shudv/deltasort

Its a more efficient way to incrementally repair sorted arrays. Feedback welcome!

What did you build?

shudv··on Show HN: An update-aware approach to incremental sorting (DeltaSort)
OpenReview PDF: https://openreview.net/attachment?id=AlMKtDfJvy&name=pdf