Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
bjoli
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
61.
▲
by
bjoli
5mo ago
Quite the contrary. Shor's algorithm actually works better for the shorter keys of ECC. The rule of thumb is 2n qbits for RSA keys and 6n qbits for ecc. I believe it has something to do with hownit applies to the hidden subgroup probl
62.
▲
by
bjoli
5mo ago
As a musician, I find the butchering of musical notation on Kimis pricing page extremely off-putting.
63.
▲
by
bjoli
5mo ago
I think most people misunderstood syntax rules. It was not meant as the macro system for scheme. It was meant as the template macro system everyone could agree on, while leaving the more powerful low level macro systems to the implementatio
64.
▲
by
bjoli
5mo ago
You don't need syntax case to do advanced things though. Alex shinn's match.scm uses all the dirty syntax-rules trick. It is pretty awful to write things like that.
65.
▲
by
bjoli
6mo ago
Org mode uses / as well.
66.
▲
by
bjoli
6mo ago
As I said, it is a protocol for iteration or data access. You cant take an iterator and hand it as a filter to a file reader. If I make a rot13 transducer I can hand it to a transduce function that transforms a collection. I can give it to
67.
▲
by
bjoli
6mo ago
They compose. And can be passed around and be completely oblivious to how they will be reduced. With conj or sum or whatever they want. And you can extend them at any point at any end. They are like map, filter and friends, but they compose
68.
▲
by
bjoli
6mo ago
I made srfi-171 [0], transducers for scheme. If you have any questions about them in general I can probably answer them. My version is pretty similar to the clojure version judging by the talks Rich Hickey gave on them. I know a lot of peop
69.
▲
by
bjoli
6mo ago
Optimization level 2 in chez scheme does about 100 KLOC/s in my pretty modest machine, while also producing code that is pretty darn fast.
70.
▲
by
bjoli
6mo ago
Yes. But treating in a strict division isn't really what people expect. Then 12mi/h in km/h becomes "19.3xyz" not "19.3xyz km/h". The least surprising thing would be to enforce unit output. If I say
71.
▲
by
bjoli
6mo ago
You are right about this being confusing. I have thought about whether to adopt in as strict division or whether to be strict about in UNIT to have to produce UNIT. The first one will not resolve the issue of Umits selecting becquerel or Hz
72.
▲
by
bjoli
6mo ago
Hah! I wrote a unit converter for Android recently and that is one of the criticism I get. "Why does my conversion end up in becquerel?" It is usually because people forgot to divide by time, where they write something like "
73.
▲
by
bjoli
6mo ago
Yes. It can run under Cpython (2.7).
74.
▲
by
bjoli
6mo ago
It is restricted in a way that you would restrict yourself to write high speed software in most languages, and I found it is not that restrictive compared to C that you would have to use if you were to write a fast Python library.
75.
▲
by
bjoli
6mo ago
And, in some ways, PyPy. I still think it is the sanest way to implement Python. It makes me sad that I have to write C to make any meaningful changes to Python. Same goes for ruby. Rubinius was such a nice project. Hacking on schemes and l
76.
▲
by
bjoli
6mo ago
No, but persistent bit partitioned tries were pretty well known in the late 90s (I first met them in standard ML in 2005)
77.
▲
by
bjoli
6mo ago
I tried in scheme first, but failed miserably. Doing it in c# was easier since I could more directly compare code.
78.
▲
by
bjoli
6mo ago
Well, sure. But it is not like Hickey invented the 5bit partitioned trie (there is work in sml and Haskell before that), nor did he invent functional tries. He took what was a research topic and made it standard. There were no other 5bit pa
79.
▲
by
bjoli
6mo ago
And Hickey himself said he adapted ideas from Bagwell's HAMTs. And tries are 60 years old. I have always thought Hickeys main contribution was making it default in a coherent way, and proved it could be done. Before clojure most peopll
80.
▲
by
bjoli
6mo ago
I know people using ref counting to support using allocation arenas for immutable structures. For some workloads that gives a pretty crazy performance boost. Just pre-allocating leaf nodes can reduce iteration overhead by 40%.
81.
▲
by
bjoli
6mo ago
He went on to implement https://github.com/hypirion/c-rrb Which are just like clojures vectors but has fast insertions/deletes and merges. I semi-ported it to c# here: https://github.com/bjoli
82.
▲
by
bjoli
6mo ago
Those are not really the same. Those are N=32 finger trees which have extra benefits (quick slices, for example, quicker insertions).
83.
▲
by
bjoli
6mo ago
AEPD are well known, even in the rest of the world. They have a different strategy compared to other countries. Ireland's DPC are also heavy handed, but focus on large companies mostly. France's CNIL is also not bad. They are part
84.
▲
by
bjoli
6mo ago
Didnt they move to CHAMP? Otherwise, that seems like a waste of resources. They are literally the same but CHAMPs are a little faster in just about every way. I am still a bit disappointed that they didn't change to RRB trees or copy t
85.
▲
by
bjoli
6mo ago
Whoa! > We have assigned pluses to the yeas because Congress has every duty to forbid grossly illicit acts of sexual perversion in the armed forces. It is full of things that are not what I would consider freedoms. Freedoms of companies
86.
▲
by
bjoli
6mo ago
Iran doesnt have the defensive capabilities needed tomproperly defend their airspace, so their plan was to make it hurt if they were attacked. The fact that the US seemed surprised they shut down the strait is such an immense intelligence f
87.
▲
by
bjoli
6mo ago
I wrote this for (guile) scheme: https://rikspucko.koketteriet.se/bjoli/goof-loop This is just sugar over tail calls.
88.
▲
by
bjoli
6mo ago
Finally! Tail calls! I had to write rust some years ago, and the ocaml person in me itched to get to write tail recursion. Tail recursion opens up for people to write really really neat looping facilities using macros.
89.
▲
by
bjoli
6mo ago
I remember being able to move the windows by holding alt (and opt?) and clicking anywhere in the window. This is how I do it today still.
90.
▲
by
bjoli
6mo ago
I dont know why, but I have always been very fond of the BeOS ui. It was toony, but still said "this is where you come to get shit done". Tabbing windows together and quickly flipping between them with a simple keyboard shortcut w
More ›