This technical blog post describes performance optimizations to an independent search engine, including database refactoring and reduced memory requirements. While the content does not explicitly address human rights, the structural choices to maintain accessible, decentralized search infrastructure have a mild positive inclination toward Article 19 (freedom of information and expression).
It makes me deeply happy to hear success stories like this for a project that's moving in the correctly opposite direction to that of the rest of the world.
Engildification. Of which there should be more!
My soul was also satisfied by the Sleeping At Night post which, along with the recent "Lie Still in Bed" article, makes for very simple options to attempt to fix sleep (discipline) issues.
I enjoyed reading this but I also fundamentally don't get it at a basic level like... why re-implement stuff that has already been done by entire teams? There are so many bigger and productionised search and retrieval systems. Why invest the human capital in doing it all again yourself? I just don't get it.
I'm wondering if humans are mostly incapable of producing great things without (artifical) restrictions.
In this case, marginalia is (ridiculously) efficient because Victor (the creator) is intentionally restricting what hardware it runs on and how much ram it has.
If he just caved in and added another 32GiB it would work for a while, but the inefficient design would persist and the problem would just show it's head later and then there would be more complexity around that design and it might not be as easy to fix then.
If the original thesis is correct, then I think it explains why most software is so bad (bloated, slow, buggy) nowadays. It's because very few individual pieces of software nowadays are hitting any limits (in isolation). So each individual piece is terribly inefficient but with the latest M2 Pro and GiB connection you can just keep ahead of the curve where it becomes a problem.
Anyways, turned into a rant; but the conclusion might be to limit yourself, and you (and e everyone else) will be better off long term.
> In brief, every time an SSD updates a single byte anywhere on disk, it needs to erase and re-write that entire page.
Is that actually true for SSDs? For raw flash it’s not, provided you are overwriting “empty” all-ones values or otherwise only changing 1s to 0s. Writing is orders of magnitude slower than reading, but still a couple orders of magnitude faster than erasing (resetting back to “empty”), and only erases count against your wear budget. It sounds like an own goal for an SSD controller to not take advantage of that, although if the actual guts of it are log-structured then I could imagine it not being able to.
I took a start script from 90 seconds to 30 seconds yesterday, by finding a poorly named timeout value. Now I'm working on a graceful fallback from itimer to alarm instead of outdated c directives.
Oh thank you. I have been doing a hobby project on search engines, and I kept searching of variations of "Magnolia" for some reason. ""Marginalia"" at least for me is hard to remember. Currently, I am trying to figure my way around Searx.
Does Marginalia support "time filters" for search like past day, past week etc? According the special keywords the only search params accepted is based on years.
year>2005 (beta) The document was ostensibly published in or after 2005
year=2005 (beta) The document was ostensibly published in 2005
year<2005 (beta) The document was ostensibly published in or before 2005
"I wish I knew what happened, or how to replicate it. It’s involved more upfront design than I normally do, by necessity. I like feeling my way forward in general, but there are problems where the approach just doesn’t work"
Yes, immediate (or soon enough) gratification feels good... To me, and maybe is because I am an old fart, this is the difference between programming and engineering.
Just a shout out to my boss at Mojeek who presumably has a very similar path to this (the post resonates a lot with past conversations). Mojeek started back in 2004 and for the most part has been a single developer who built the bones of it, and in that, pretty much all of the IR and infrastructure.
Limitations of finance and hardware, making decisions about 32 vs 64 bit ids, sharding, speed of updating all sound very familiar.
Reminds me of Google way back when and their 'Google dance' that updated results once a month, nowadays it's a daily flux. It's all an evolution, and great to see Marginalia offering another view point into the web beyond big tech.
Lots of people treat optimization as some deep-black-magic thing[1], but most of the time, it's actually easier than fixing a typical bug; all you have to do is treat excessive resource usage identical to how you would treat a bug.
I'm going to make an assertion: most bugs that you can easily reproduce don't require wizardry to fix. If you can poke at a bug, then you can usually categorize it. Even the rare bugs that reveal a design flaw tend to do so readily once you can reproduce it.
Software that nobody has taken a critical eye to performance on is like software with 100s of easily reproducible bugs that nobody has ever debugged. You can chip away at them for quite a while until you run into anything that is hard.
1: I think this attitude is a bit of a hold-out from when people would do things like set their branch targets so that the drum head would reach the target at the same time the CPU wanted the instruction, and when resources were so constrained that everything was hand-written assembly with global memory-locations having different semantics depending on the stage the program was in. In that case, really smart people had already taken a critical eye to performance, so you need to find things they haven't found yet. This is rarely true of modern code.
How does one learn new things if not first by understanding them, and then looking to evolve them?
Sure, we can shell out to libraries and to other people's work, but at some point, you will have to understand the thing that you've abstracted away if you want to evolve it.
I want to do my own version of something like this to have a personally curated search function. The "it's mine" factor is enticing, if it does something unexpected, then I know all the dependent, interacting parts so I can trace the problem and fix it.
But I'm a privacy and self-hosting nut, which is probably just another way of saying the same thing.
(I will probably never actually do it, but that doesn't stop it being on the list).
Google still kills for useful applications. I use marginalia when I have either A) something deeply obscure I want to research or B) when I just want to read some entertaining long-form text posts about something in a category that interests me.
“So it’s a search engine. It’s perhaps not the greatest at finding what you already knew was there. Instead it is designed to help you find some things you didn’t even know you were looking for.”[0]
I also like how they decided to mix in sqlite alongside the existing MariaDB database because it gets the job done, and "a foolish consistency is the hobgoblin of little minds".
American Airlines ran SABRE, a sizeable airline ticketing and reservation system, in the mid-1970s on two system/360 mainframes that could only process a few tens of millions of instructions per second.
A raspberry pi 2 can do over 4 billion Dhrystone instructions per second, and a pi 4 over 10 billion per second.
Of course by modern standards mid-1970s SABRE was pretty barebones for an airline's main system, but it's at least theoretically possible to run simplified systems for over a 100 airlines simultaneously on a single pi 2...
So yes modern programs are very far from optimized. 1000x or 10 000x improvements are possible, less for math heavy stuff.
I think microsoft has a huge problem with this. Even 3000$ laptops from 5 years ago struggle with running a teams call, some office instances and a browser with 30 tabs at the same time without slowing down to unacceptable levels.
They test stuff individually and running one thing alone is fine, but that's not what people do.
I'd imagine that artificial limits in the form of run time on well-defined hardware that are only raised after an explicit decision could be the solution to this.
But then again I only write business software where the performance aspect comes down to "don't do stupid shit with the database and don't worry about the rest because the client won't pay for those worries", so I might be on the wrong track entirely.
I think it’s why old computers felt good and also why old games were so good.
Maybe it have something to do with the complexity of the systems we deal with.
When you have a restricted amount of some resource (RAM, physical space, food, materials, time, money …) you have to plan how you will use it. You are forced to be smart.
When you have a virtually infinite resource, you can make whatever you feel making but you don’t have to really care about the final state, you just start and you’ll see when it will work.
I’m not exactly a true gamer, but I’ve always been amazed by the fact humans were capable to store so much emotion, adventures and time to enjoy in the good old cartridges with some kb/mb of rom. I mean, Ocarina Of Time rom is just the size of the last 8 photos I took with my iPhone.
For most applications it simply does not make any sense to spend this much time on relatively small optimizations. If you can choose to either buy 32GiB of RAM for your server for less than $50 or spend probably over 40 hours of developer time at at least $20 / hour, it is quite obvious which one makes more sense from a business perspective. Not to mention that the website was offline for an entire week - that alone would've killed most businesses!
A lot of tech people really like doing such deep dives and would happily spend years micro-optimizing even the most trivial code, but endless "yak shaving" isn't going to pay any bills. When the code runs on a trivial number of machines, it probably just isn't worth it. Not to mention that such optimizations often end up in code which is more difficult to maintain.
In my opinion, a lot of "software bloat" we see these days for apps running on user machines comes from a mismatch between the developer machine and the user machine. The developer is often equipped with a high-end workstation as they simply need those resources to do their job, but they end up using the same machine to do basic testing. On the other hand, the user is running it on a five-year-old machine which was at best mid-range when they bought it.
You can't really sell "we can save 150MB of memory" to your manager, but you can sell "saving 150MB of memory will make our app's performance go from terrible to borderline for 10% of users".
Yeah this aligns with my view. Limitations breed ingenuity, and that isn't limited to demo scene outputs. You're going to run into scaling problems sooner or later, and they're a lot easier to deal with early than late. If your software runs well on a raspberry pi[1], it's going to be absurdly performant on a real server.
It's actually how we used to build software. It's why we could have an entire operating system perform well on a machine like a Pentium 1 with most of what you'd expect today, etc. while at the same time we have web pages that struggle to scroll smoothly on a smartphone with literally a thousand times more resources across all axes. The Word 95 team were constantly faced with limits and performance tradeoffs, and it very clearly worked or did not.
If I had just gone and added more RAM (or whatever), I would still have been stuck with an inferior design, and soon enough I would need to buy even more RAM. The crazy part about this change is that it isn't just reducing the resource utilization, it's actually making the system more capable, and faster because free RAM means more disk caching.
If all you want is the same results as Google I say you should just use Google. I'm not trying to compete with them, I give the results you won't find on the big G.
Most of what exists doesn't work for my application. It either assumes an unbounded resource budget, or makes different priorities that don't scale by e.g. permitting arbitrary realtime updates.
I'm building stuff myself because it's the only way I'm aware of to run a search engine capable of indexing quarter of a billion documents on a PC.
It's a function of scale: the larger the team/company behind the product, the greater its enshittification factor/potential.
The author recently went full time on their Marginalia search engine, AFAIK it's a team size of 1, so it's the farthest away from any enshittification risk. Au contraire, like you say: it's at these sizes where you make jewels. Where creativity, ingenuity and vision shines.
This comment is sponsored by the "quit your desk job and go work for yourself" gang.
In this scenario I was basically re-writing the entire hard-drive completely in a completely random order, which is the worst case scenario for an SSD.
Normally the controller will use a whole bunch of tricks (e.g. overprovisioning, buffering and reordering of writes) to avoid this type of worst case pattern, but that only goes so far.
>> In brief, every time an SSD updates a single byte anywhere on disk, it needs to erase and re-write that entire page.
> Is that actually true for SSDs? For raw flash it’s not, provided you are overwriting “empty” all-ones values or otherwise only changing 1s to 0s.
Maybe it depends. I wrote the driver for more than one popular flash chips (don't remember which ones now, but that employer had a policy of never using components that were not mainstream and available from multiple suppliers) and all the chips I dealt with did read and write exclusively via fixed-size pages.
Since SSDs are collection of chips, I'd expect each chip on the SSD to only support fixed-size paged IO.
Not precisely. The logical view of a page living at some address of flash is not the reality. Pages get moved around the physical device as writes happen. The drive itself maintains a map of what addresses are used for what purpose, their health and so on. It’s a sparse storage scheme.
There’s even maintenance ops and garbage collection that happens occasionally or on command (like a TRIM).
In reality a “write” to a non-full drive is:
1. Figure out which page the data goes to.
2. Figure out if there’s data there or not. Read / modify / write if needed.
3. Figure out where to write the data.
4. Write the data. It might not go back where it started. In fact it probably won’t because of wear leveling.
You’re right that the controller does a far more complex set of steps for performance. That’s why an empty / new drive performs better for a while (page cache aside) then literally slows down compared to a “full” drive that’s old, with no spare pages.
Source: I was chief engineer for a cache-coherent memory mapped flash accelerator. We let a user map the drive very very efficiently in user space Linux, but eventually caved to the “easier” programming model of just being another hard drive after a while.
The search index isn't updated more than once every month, so no such filters. The year-filter is pretty rough too. It's very hard to accurately date most webpages.
1. Writable Unit: The smallest unit you can write to in an SSD is a page.
2. Erasable Unit: The smallest unit you can erase in an SSD is a block, which consists of multiple pages.
So if a write operation impacts only 1 byte within a page, the SSD cannot erase just that byte. However, it does not need to erase the entire block either.
The SSD can perform a "read-modify-write" type of operation:
- Read the full page containing the byte that needs to change into the SSD's cache buffer.
- Modify just the byte that needs updating in the page cache.
- Erase a new empty block.
- Write the modified page from cache to the new block.
- Update the FTL mapping tables to point to the updated page in the new block.
So, a page does need to be rewritten even if just 1 byte changes. Whole-block erasure is avoided until many pages within it need to be modified.
I agree in general, but I think bugs are a lot easier to track down with divide and conquer strategies. If you're able to reproduce the bug by sending request X to service Y, gradually shrink the test case down until you've found the culprit.
Optimization is often an architectural problem. Sure there are cases where you're copying a thing where you could recycle a buffer, but you run out of those fairly quickly, and a profiler will tell you what you need to know.
A lot of the big performance wins are in changing the entire data logistics, possibly eliminating significant portions of the flow until the code does what it needs to in as few steps as possible.
Editorial Channel
What the content says
ND
PreamblePreamble
Not addressed
ND
Article 1Freedom, Equality, Brotherhood
Not addressed
ND
Article 2Non-Discrimination
Not addressed
ND
Article 3Life, Liberty, Security
Not addressed
ND
Article 4No Slavery
Not addressed
ND
Article 5No Torture
Not addressed
ND
Article 6Legal Personhood
Not addressed
ND
Article 7Equality Before Law
Not addressed
ND
Article 8Right to Remedy
Not addressed
ND
Article 9No Arbitrary Detention
Not addressed
ND
Article 10Fair Hearing
Not addressed
ND
Article 11Presumption of Innocence
Not addressed
ND
Article 12Privacy
Not addressed
ND
Article 13Freedom of Movement
Not addressed
ND
Article 14Asylum
Not addressed
ND
Article 15Nationality
Not addressed
ND
Article 16Marriage & Family
Not addressed
ND
Article 17Property
Not addressed
ND
Article 18Freedom of Thought
Not addressed
ND
Article 19Freedom of Expression
Medium Coverage Practice
Not addressed. Blog post does not explicitly discuss freedom of opinion, expression, or information access.
Observable Facts
The blog post states the long-term goal is to 'keep it possible to run and operate the system on low-powered hardware.'
The author has halved RAM requirements and removed hard limits on document indexing as part of this optimization effort.
Marginalia Search is presented as an independent search engine maintained by the author.
Inferences
Optimizing for low-powered hardware operation reduces barriers to running and distributing information access tools, which structurally supports decentralized information infrastructure.
Maintaining an independent search engine with emphasis on accessibility aligns with enabling broader freedom to access and distribute information.
ND
Article 20Assembly & Association
Not addressed
ND
Article 21Political Participation
Not addressed
ND
Article 22Social Security
Not addressed
ND
Article 23Work & Equal Pay
Not addressed
ND
Article 24Rest & Leisure
Not addressed
ND
Article 25Standard of Living
Not addressed
ND
Article 26Education
Not addressed
ND
Article 27Cultural Participation
Not addressed
ND
Article 28Social & International Order
Not addressed
ND
Article 29Duties to Community
Not addressed
ND
Article 30No Destruction of Rights
Not addressed
Structural Channel
What the site does
+0.10
Article 19Freedom of Expression
Medium Coverage Practice
Structural
+0.10
Context Modifier
ND
SETL
ND
The site maintains an independent search engine and implements optimization choices (reduced RAM requirements, support for low-powered hardware operation) that structurally support decentralized information infrastructure. This has a mild positive inclination toward enabling broader access to information resources.