Oliver Hunt

Do you have any performance numbers for other implementations? even just JS parsed by other engines vs. binary ast in your implementation?

Oh, I see "The time required to create a full AST (without verifying annotations) was reduced by ~70-90%, which is a considerable reduction since SpiderMonkey's AST construction time for the...

You could do something absolutely brutal: ``` trait BlockCipher { ... } trait Counter {} trait PaddingSafeCounter :Counter {} pub struct CBCCounter {} pub struct GCMCounter {} impl Counter for...

I've confirmed this correctly identifies the expectation mismatch, and the suggested/default fix correctly sets the hook dir for the repo, and doesn't conflict with global rules

Sorry for the delay, now that we've got the qualifier and various other features upstreamed, I'll be upstreaming our ptrauth hardening for the various runtime libraries in the not too...

Sorry, I missed this Now that the ptrauth qualifier is available I'm going to be preparing and pushing the darwin libunwind+personality function changes, which are very aggressive in there protection...

I've finally got our downstream hardening to the point where it should be sane: https://github.com/llvm/llvm-project/pull/143230

What are your thoughts on this approach? I couldn't work out a way to get similar semantics in latex, my prior approach has been `[1.1->1.2]{.pnum}` style notation which is kind...

> For what it's worth, I never change numbers. I just insert fake numbers in the middle. I think this makes it easier to look at the old wording, since...

@cor3ntin oh yeah, I know, I'm also there :D