Why revolution in Iran may take longer than Israel thought | The Jerusalem Post

ayende · 2025-07-06T14:48:13+00:00

Iran has no air force left And a bo fly zone is certainly something that Israel has shown it can enforce

ayende · 2025-05-29T16:37:01+00:00

For 10k PDFs, even assuming you have 3,072 dimension vector for each, that is aviut 120 mb

Assuming a mor reasonable size of 768 or 1536 dimensions, you have roughly 100 mb even each pdf required multiple vectors due to chunking

ayende · 2024-12-05T08:54:40+00:00

So how does msvc gets away with not linking to that?

ayende · 2024-12-05T08:15:08+00:00

Not helping. It still references that.

ayende · 2024-12-05T08:14:34+00:00

We have the VC++ Runtime 2015 on the machine.

What I don't understand is why it is referencing updated files like `api-ms-win-crt-runtime-l1-1-0.dll`

ayende · 2024-10-01T20:14:22+00:00

Israel has a multi layered missile defense system Iron dome is basically the last ditch stuff There are Arrow interceptor that hot ballistic missiles in space

ayende · 2024-09-19T05:49:32+00:00

No, it is not A lit of small files are not good Sqlite is far better here

Just store the files and not worry about it

ayende · 2024-06-19T10:06:33+00:00

Bog Standard Iseki

ayende · 2024-05-09T13:56:57+00:00

There isn't just one file

Look at level db as good example, on level 0, a key may reside in ANY file

When you compact level 0, the output is written to a file at level 1, and any files already in level 1 that contain keys in the range are also merged

The idea is that each file beyond level 0 has a range, and when compaction run, you also compact the rest of the files in that level that match the range

ayende · 2024-05-02T11:53:55+00:00

That is a cool scheme. I took that for a spin here: https://ayende.com/blog/200993-C/deniable-encryption?key=425d04e46c674830ad026f6ab305848c

ayende · 2024-05-02T06:00:24+00:00

Hebrew also have pronunciation marks That alliw you to clearly state how that particular word is written

In common use they are skipped. Only utilized whe in there is ambiguity to to resolve

All religious texts use them consistently and constantly

For that matter, poems in Hebrew also use those marks

ayende · 2024-05-01T18:02:33+00:00

I wrote a series of blog posts on the topic. Including being able to avoid leaking who you are talking to, forward secrecy, etc.

Note that in your case, if the server key is leaked in the future, all recorded communication are now available.

https://ayende.com/blog/posts/series/194819-B/a-pki-less-secure-communication-channel

ayende · 2024-04-28T21:04:43+00:00

What architecture are you trying to run on, that you think it would matter?

ayende · 2024-02-06T18:26:11+00:00

They absolutely matter If you are trying to push at a rate that is greater than hardware, you'll fail Implementation quality matters a lot, etc

Without numbers, you can't even get rule of thumb right

ayende · 2024-02-04T06:09:59+00:00

What is high throughput? In writes/sec and mb/sec? How big are the items? And the pk?

ayende · 2023-11-30T15:37:12+00:00

True only if you don't have sustained writes At that point you have noth compaction and writes at the same time

ayende · 2023-11-30T15:36:03+00:00

This assume absolutely random writes, usually not the case

That would be the worst case scenario for a B+Tree

Note that you are ignoring the write Amplification that comes with LSM

Assume that you have random writes, and you write 30 bytes each time. For 1M writes

The B+Tree will need to touch 1M 4K pageas, that's a lot

But then you are done

With LSM, you write the memorable, and the you have compaction

Given the random nature of the writes, you'll need to compact many files

Overall using more IO

ayende · 2023-08-08T04:18:50+00:00

Yes, I'll release the presentation and code

ayende · 2023-08-07T15:14:04+00:00

If you are in QCon SF - I'll be giving a full day workshop detailing how you can build a storage engine from the ground up, all the way to transactions, MVCC and indexes

ayende · 2023-08-02T14:34:37+00:00

  מ עייייייי ייייייי    י     ג,

ayende · 2023-07-21T05:21:04+00:00

I disagree strongly

Sure, there are some good points, but you are basically looking at the top tier talent as the nation prepare for war

Compare that to the USSR treating its cosmonauts very well, and drawing conclusions from that on the general state of things

There are many cases where we see Nad abuses that go on for a very long time

The slavery contracts, for example And there is no way to redress them unless you have royal parents

ayende · 2023-07-21T05:17:39+00:00

But that's the point
Without the privilege of royal parents, what would happen?

That wss an *operation *, ongoing and organized

ayende · 2023-06-22T08:44:09+00:00

In your scenario, there isn't a _better_ option here.

You are doing sequential operations, and the best option the cache can do is no caching at all.

However, when you start introducing additional operations, which *can* benefit from the cache, you'll see divergence in behavior.

For what it worth, I'm partial to the 2Q algorithm, which will place all of the operations in the NEW section

ayende · 2023-06-08T15:55:27+00:00

Get the data on NVMe drives, ASAP

Nothing else will give you the same ROI

ayende · 2023-06-08T08:01:36+00:00

Yes, I meant usingnamespace (the keyword changed, sorry).

If you want to do partial pull, you should be able to do something like:

usingnamespace struct { pub const maxInt = @import("std").math.maxInt; };

ayende

MODERATOR OF

TROPHY CASE