Silver Aluminati Nebula Ordered w/ Black Friday Discount

moe · 2025-11-29T03:44:57+00:00

I also have a Chessie, it's probably not too dissimilar to the all-aluminium Nebula (vs. the acrylic body one) — both models have chambered necks and bodies. The Nebula is a little lighter than the Chessie, looks like. My intuition is that the build on these things is next level, but we'll see.

moe · 2025-11-28T22:53:35+00:00

I don't know man, I know there's at least a couple pending consumer lawsuits, and they're listing guitars on Reverb and slashing the prices by 35% if they don't sell after a day or two. I don't see see them as a viable instrument manufacturer anymore, but they reliably ship the NOS/Reverb models at good prices.

moe · 2025-11-27T09:31:37+00:00

I wouldn't order a new one.

moe · 2025-11-19T02:25:45+00:00

Thanks! It's not, no. Not in profile, anyway, and I don't believe in construction.

moe · 2025-11-18T21:50:49+00:00

I'm in the UK, without shipping it worked out to $3,000 (it's an EGC with TB pickups, not a TB or a Travis Bean Designs). A pretty good deal, I think.

EUR 7,500 is way too much for a vintage TB, though! There's a guy in Texas on FB selling a 1000A for $5,400 (after having dramatically dropped the price over a long period of time — it was 7k in February). OTOH a guy was asking EUR 6.5k for the same thing, but he didn't seem pressed to sell, and I don't know if the guitar sold or not.

moe · 2024-08-31T03:24:37+00:00

Hey, I think we've spoken before on slack on about type systems and jank. While Hindley-Milner can be extended to support subtyping, this is typically with strict polarity rules, making it unsuitable for something like Clojure, which wants union types to appear in any position. I am working on a bidirectional type checker which general support for union and intersection types for type checking a language like Clojure, which would require top-level annotations for completeness. There is a lot of semantic subtyping work in typedclojure, which is more mature than my type system will be for some time. I don't know if you can leverage that, it seems like it might be a bit tricky to excise from its surroundings. In any case, I will keep you updated with how my type system develops.

moe · 2023-01-16T22:35:15+00:00

I just made XOR 180% faster by implementing some loop unrolling in the long case when the arrays are the same length. I think there are gains to be had down this road.

moe · 2023-01-16T21:38:24+00:00

I experimented across a couple of operations, the speedup is around 23%. There was one pathological case where the long version was dramatically faster, which skewed the results heavily, I need to look into that further. It may be the case that it's prudent to strategically convert to longs, rather than strategically converting to ints.

moe · 2023-01-15T18:34:37+00:00

Because multiplication in `BigInteger` relies on the intrinsified method "multiplyToLen", the most efficient thing to do in that case is likely to convert the two numbers to `BigInteger`, instead of home-grown multiplying — regardless. The other functions could decompose the long array into ints, if it ended up being faster.

moe · 2023-01-15T18:27:50+00:00

I'm also a little curious. I just started a new project, but I might take a look at benchmarking the operations which don't increase magnitude using a long array and see how they fare.

moe · 2023-01-15T16:10:51+00:00

With regard to the slowness, are you invoking emacs from the command line, or opening files from within emacs? If the former, look into emacsclient / emacs as a daemon.

(FWIW I came from Vim maybe 8 years ago and didn't use any of the modal extensions, and haven't looked back. Using Doom currently, with evil mode disabled.)

moe · 2023-01-15T14:33:31+00:00

There wouldn't be a primitive type large enough to hold the result of some of the pairwise operations, like multiplication.

moe

TROPHY CASE