dgrnbrg

4 ms·

1.
by dgrnbrg 8y ago
What about the 3rd founder? He got written out of the narrative early on, but he built the original platform and was bought out in the first few years.
2.
by dgrnbrg 9y ago
At least one commercial company I've heard of has a sophisticated permissioning model, so that the owner of the chain can publish it and have its causal history and/or integrity be validated by all participants, but with specific
3.
by dgrnbrg 10y ago
It's not just the root's event log--it's all the event logs. The deferrals allow us to batch writes in an optimized way, and do so with a fully incremental algorithm. In the IO cost model, each "block" read or cost
4.
by dgrnbrg 10y ago
Creator here. As other commenters noted, this data structure only requires keys to be sortable, not hashable, and the best sorted performance we can achieve is O(log(n)). That said, when a Cuckoo hash gets very full and bounces entries arou
5.
by dgrnbrg 10y ago
The code actually includes a benchmarking tool that's meant to help in figuring out this decision. Once you've selected your key size (or distribution), value size (or distribution), and backend, you can play with these factors. I
6.
by dgrnbrg 10y ago
Indeed that would.
7.
by dgrnbrg 10y ago
Creator here. You could use this from Java using the Clojure API for Java; however, many of the extension hooks use Clojure protocols. I would recommend writing a shim to Java for your particular application, so that your data types are rep
8.
by dgrnbrg 10y ago
That is very cool! When you end up doing reads, do you compute all the pending writes along the path from root to leaf, and then run queries on the projection?
9.
by dgrnbrg 10y ago
Creator here. There's no visualizations of this yet, but I'll be speaking about it this year at Strange Loop. For that talk, I'll be creating visualizations, so stay tuned!
10.
by dgrnbrg 10y ago
Creator here. I would absolutely agree with this, but let me shed a bit more light to clarify: the underlying idea of B+ trees with inline caches is not patented (or maybe it was, but a long time ago?). Tokutek's patents are all focuse
11.
by dgrnbrg 10y ago
I wrote a similar project to this in Clojure, called Piplin: http://www.piplin.org . I worked on it for a year, and did some interesting things to enable REPL-driven FPGA development, but over time my interests shifted to macro-s
12.
by dgrnbrg 11y ago
Hey HNers! One of the authors here, happy to answer any questions.
13.
by dgrnbrg 11y ago
I think they've improved a lot WRT fixing problems--we had a chat with them after some issues with Datomic in production, and since then (6 months ago) we've had every problem we've discovered get fixed very promptly, and Dat
14.
by dgrnbrg 12y ago
You can watch a talk I gave about how we use Datomic at Two Sigma to manage our cluster's state: https://www.youtube.com/watch?v=YHctJMUG8bI It's been a great experience using it, and I'd be happy to answer a
15.
by dgrnbrg 12y ago
I lived in a building where one of the tenants full-time rented out their unit on AirBnB. The "guests" would tag the elevator, make noise, and trash the hallways. Also, it felt very unsafe when a large group of 4-8 people would be
16.
by dgrnbrg 12y ago
They're based on Raft--that's not a consensus protocol that's designed for multi-datacenter operations. I suspect you'll have reliability and throughput issues fairly quickly, just as you see with multi-datacenter zookee
17.
by dgrnbrg 12y ago
I am interested in Clojure bindings for spark!
18.
by dgrnbrg 12y ago
I think that this article shows a very interesting application of a technique known as “derandomization”. Usually, derandomization is when you take a randomized algorithm and remove all sources of randomness. In this application, we see it
19.
Copysets and Chainsets: A Better Way to Replicate(hackingdistributed.com)
1 points by dgrnbrg 12y ago|1 comments
20.
by dgrnbrg 13y ago
Another interesting solution is to use a functional database, like Datomic. Since the database looks like a giant timeseries, you have an implicit versioning built into the database.
21.
by dgrnbrg 13y ago
If OpenSCAD isn't powerful enough for you, there's a Clojure wrapper that lets you leverage Clojure to generate SCAD code: https://github.com/farrellm/scad-clj . OpenSCAD automatically re-renders the model whe
22.
by dgrnbrg 14y ago
I have been working on this problem as well, by writing a system that allows you to compile Clojure to FPGAs. I'll be giving a talk on it at Clojure West: http://clojurewest.org/sessions#greenberg </shamelessplug>
23.
by dgrnbrg 14y ago
I am talking about Tim Pope. I have forked his code and renamed it, but instead of the community helping me, I've received a lot of negative feedback about "fragmenting the community" for trying to maintain and evangelize a non-sexist versi
24.
by dgrnbrg 14y ago
What do we do about less overt sexism? For instance, there's a popular developer who writes useful plugins named after genitalia and sex acts. I find his code useful, and I've asked him publicly and privately to choose nonsexual names for h
25.
by dgrnbrg 14y ago
Where are these functional compilers developers? I am passionate about functional languages and compilers research, but feel siloed off after I left academia.
26.
by dgrnbrg 14y ago
When I was in high school, I only managed to skip one math class. I was forbidden from taking AP physics without first taking non-AP physics, and the school was unwilling to work with me so that I could take classes at a local college (i.e.
27.
by dgrnbrg 14y ago
Does riak support range queries?
28.
by dgrnbrg 14y ago
It seems like a solution to getting more performant, lower overhead GC would be to allocate GC pools that contain only a specific kind of object, and then generate specialized code to mark/sweep those pools (since you could elide the object