HammadB

6 ms·

1.
Show HN: Package Search MCP – enable agents to search dependency source code(trychroma.com)
12 points by HammadB 1y ago|1 comments
2.
by HammadB 1y ago
You will always find a copy of McLuhan on the Chroma teams bookshelf !
3.
by HammadB 1y ago
Yes! It can - https://docs.trychroma.com/docs/querying-collections/metadat...
4.
by HammadB 1y ago
That is helpful feedback, thank you. We'll address this.
5.
by HammadB 1y ago
Hi! Hammad here - Chroma’s CTO. First off, I have an immense amount of respect for the Turbopuffer team, they’ve build a solid product. I understand your point. Chroma Cloud has been quietly live in production for a year, and we have been d
6.
Context Engineering – can't call it engineering if we can't predict it breaking [video](youtube.com)
4 points by HammadB 1y ago|0 comments
7.
Spann and SPFresh vector indexing in Chroma(twitter.com)
1 points by HammadB 1y ago|0 comments
8.
Building a usage-based billing system(trychroma.com)
2 points by HammadB 1y ago|0 comments
9.
by HammadB 1y ago
There is an abundance of discussion on this thread about whether models are intelligent or not. This binary is an utter waste of time. Instead focus on the gradient of intelligence - the set of cognitive skills any given system has and to
10.
by HammadB 2y ago
I've taken the linked Russ Tedrake class and have to say I loved this. Please make more!
11.
Napkin: Back-of-the-envelope calculations in Python(github.com)
24 points by HammadB 2y ago|3 comments
12.
by HammadB 2y ago
It’s COOL
13.
Query Embedding Adapters(research.trychroma.com)
2 points by HammadB 2y ago|0 comments
14.
by HammadB 2y ago
If segmented hsnw indices were O(N log N) - it would make no sense to build the index at all - brute force would be better as O(N log N) > O(N)
15.
by HammadB 2y ago
Sure, I see. I think this is an area where complexity analysis doesn’t lead to useful information. To be more correct it’s O(N/C log C) where C is the capacity of a segment. In this case you can ignore 1/C and log C as constant. S
16.
by HammadB 2y ago
a lot of game engines have higher level shading languages (often visually programmed) that are long-lived and widely used.
17.
by HammadB 2y ago
"The obstacle is that until now, off-the-shelf vector databases could not index a dataset larger than memory, because both the full-resolution vectors and the index (edge list) needed to be kept in memory during index construction. La
18.
by HammadB 2y ago
+1 I was ready to drop $$$
19.
by HammadB 3y ago
Curious - what was the specific leaderless replication strategy?
20.
by HammadB 3y ago
I don't think that - I am speaking generally.
21.
by HammadB 3y ago
I don't think its the role of the government to penalize layoffs. If a company needs to do a layoff to remain viable it must be allowed to - the downside (everyone loses their job) is worse. And trying to apply some mechanism where the
22.
by HammadB 3y ago
There is a fundamental disconnect between industry and academia here.
23.
by HammadB 3y ago
Yeah, was thinking the same thing. Something deeper to be explored here esp due to the consistency across domains. I wonder how far we can push "externalizing" higher level information the model wants to store while in the forward
24.
by HammadB 3y ago
https://github.com/bijection/g9/blob/master/src/minimize.js
25.
by HammadB 3y ago
Maybe I am misunderstanding but the postgres buffer cache is LRU and will evict pages right? At times data may go to disk and then during serving it will have to be loaded into memory? So it is quite dependent on the size of your buffer cac
26.
by HammadB 3y ago
No one is discrediting (or even discussing really) the validity of the point that if you use postgres pgvector or pgembedding may makes sense for the reasons you mention. The question was about how the algorithms compare, I compared the alg
27.
by HammadB 3y ago
Sure, I don't disagree that there is more to vector database selection than raw performance. Any technical decision is filled with many considerations. The commenter - thewataccount - asked about performance and I shared my intuition.
28.
by HammadB 3y ago
DiskANN construction is much much slower than HNSW, and the support around updates has been discussed in literature but has not been open sourced yet (They call this FreshDiskANN in the paper - DiskANN is from microsoft research btw). HNSW-
29.
by HammadB 3y ago
pg_embedding is based on a different approximate nearest neighbors algorithm - HNSW, which is generally considered - and studied - to be faster as well as more accurate than pgvectors IVF (ignoring a lot of nuance). However pg_embedding ser
30.
DIY simulacra–build and run your own simulation(github.com)
3 points by HammadB 3y ago|0 comments

More ›