[{"data":1,"prerenderedAt":217},["ShallowReactive",2],{"maker-seiflotfy":3},[4,32,52,73,92,108,121,138,152,170,184,201],{"id":5,"name":6,"line":7,"ai":8,"cat":9,"year":10,"points":11,"comments":12,"rec":13,"s":14,"top":15,"kw":16,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":25,"url":26,"mix":27,"praise":30,"objection":31,"sub":17},11242022,"Skizze","High-throughput probabilistic data structure service",false,"data",2016,53,6,"quiet",null,31,[17,18,19,20],"probabilistic data structures","bloom filter","hyperloglog","streaming statistics","seiflotfy","github.com","notable",0,"350330","https:\u002F\u002Fgithub.com\u002Fskizzehq\u002Fskizze",[28,29,28,24],1,2,"Useful idea, especially the streaming metrics feature","Unclear how threshold and memory usage relate to error rate",{"id":33,"name":34,"line":35,"ai":8,"cat":36,"year":37,"points":38,"comments":29,"rec":13,"s":14,"top":39,"kw":40,"maker":21,"domain":22,"tier":46,"attempts":24,"strip":47,"url":48,"mix":49,"praise":50,"objection":-1,"sub":51},13480604,"mcs","Initial Microsoft Bing Speech API for Go (In Progress)","languages",2017,10,82,[41,42,43,44,45],"go","bing speech api","speech recognition","microsoft","golang","shown","55","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fmcs\u002Ftree\u002Fmaster\u002Fspeech",[29,24,24,24],"Commenters find it interesting and wanted something like it","speech api client library",{"id":53,"name":54,"line":55,"ai":8,"cat":36,"year":37,"points":56,"comments":57,"rec":58,"s":59,"top":60,"kw":61,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":65,"url":66,"mix":67,"praise":70,"objection":71,"sub":72},14636699,"HyperLogLog","An improved version of HyperLogLog",194,44,"curious",0.06,8,[19,62,63,64],"cardinality estimation","count distinct","go library","3030055033031130000000003330133030303300","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fhyperloglog.git",[29,68,24,69],15,3,"Smaller space usage with good accuracy","TailCut can make results order-dependent when values repeat","probabilistic data structure library",{"id":74,"name":75,"line":76,"ai":8,"cat":36,"year":77,"points":78,"comments":79,"rec":80,"s":81,"top":82,"kw":83,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":86,"url":87,"mix":88,"praise":90,"objection":91,"sub":72},16097776,"hyperminhash","HyperLogLog intersections",2018,88,16,"mixed",0.22,24,[19,62,84,85,17],"set intersection","minhash","5030005300303513","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fhyperminhash\u002Ftree\u002Fmaster",[69,89,28,28],4,"Useful library for approximate set operations","Naive HLL intersection via min of counts is inaccurate for cardinality estimation",{"id":93,"name":94,"line":95,"ai":8,"cat":36,"year":77,"points":96,"comments":12,"rec":13,"s":14,"top":97,"kw":98,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":102,"url":103,"mix":104,"praise":105,"objection":106,"sub":107},17766068,"quantiles","A Go implementation of TensorFlow's streaming quantiles estimator",98,21,[99,41,100,101],"streaming quantiles","quantile estimator","t-digest","003000","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fquantiles",[24,28,24,24],"Fast insertion benchmarks compared to other quantile libraries","Unbounded size as data grows, per the referenced paper","quantile estimation library",{"id":109,"name":110,"line":111,"ai":8,"cat":9,"year":77,"points":112,"comments":69,"rec":13,"s":14,"top":113,"kw":114,"maker":21,"domain":22,"tier":46,"attempts":24,"strip":117,"url":118,"mix":119,"praise":-1,"objection":-1,"sub":120},17826416,"PCSA","Reducing the size of PCSA to that of HyperLogLog",45,39,[115,62,19,116],"probabilistic counting","sketch algorithm","033","https:\u002F\u002Fgithub.com\u002Fseiflotfy\u002Fpcsa",[24,29,24,24],"cardinality estimation sketch",{"id":122,"name":123,"line":124,"ai":8,"cat":9,"year":125,"points":126,"comments":60,"rec":13,"s":14,"top":127,"kw":128,"maker":21,"domain":123,"tier":46,"attempts":29,"strip":133,"url":134,"mix":135,"praise":136,"objection":-1,"sub":137},28775160,"play.axiom.co","Most active bots commenting on GitHub in the past 30 days",2021,25,50,[129,130,131,132],"github bots","github issues","event query","observability","00033005","https:\u002F\u002Fplay.axiom.co\u002Faxiom-play-qf1k\u002Fexplorer?qid=SXmcgdLrEvY-r0kdzw",[28,29,24,24],"Cool demo, thanks for sharing","github event analytics",{"id":139,"name":140,"line":141,"ai":8,"cat":36,"year":125,"points":142,"comments":28,"rec":13,"s":14,"top":143,"kw":144,"maker":21,"domain":22,"tier":46,"attempts":24,"strip":148,"url":149,"mix":150,"praise":-1,"objection":-1,"sub":151},28947433,"welford","Go implementation of Welford's algorithm for weighted variance",11,75,[145,146,41,147],"welford algorithm","weighted variance","online variance","0","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fwelford",[24,24,24,24],"numerical library",{"id":153,"name":154,"line":155,"ai":8,"cat":156,"year":125,"points":157,"comments":29,"rec":13,"s":14,"top":158,"kw":159,"maker":21,"domain":164,"tier":46,"attempts":24,"strip":165,"url":166,"mix":167,"praise":-1,"objection":168,"sub":169},29152286,"Repobeats","Insightful eye-candy for your GitHub repo with Repobeats","dev_tools",19,57,[160,161,162,163],"github analytics","repository stats","github insights","readme badges","repobeats.axiom.co","00","https:\u002F\u002Frepobeats.axiom.co",[24,24,24,24],"Privacy concern that GitHub's image proxy leaks viewer information","repository analytics",{"id":171,"name":172,"line":173,"ai":8,"cat":9,"year":125,"points":79,"comments":69,"rec":13,"s":14,"top":174,"kw":175,"maker":21,"domain":123,"tier":46,"attempts":24,"strip":180,"url":181,"mix":182,"praise":-1,"objection":-1,"sub":183},29452565,"Axiom","Scuba-like observability for non-Facebook engineers",63,[132,176,177,178,179],"log analytics","scuba","kusto query language","honeycomb alternative","000","https:\u002F\u002Fplay.axiom.co\u002Faxiom-play-qf1k\u002Fdatasets\u002Fsample-http-logs?qid=Stc5ff57jT9-r3nrlb&relative=1",[24,24,24,24],"observability analytics",{"id":185,"name":186,"line":187,"ai":8,"cat":36,"year":188,"points":189,"comments":190,"rec":58,"s":191,"top":192,"kw":193,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":195,"url":196,"mix":197,"praise":198,"objection":199,"sub":200},34312335,"zig-hyperloglog","HyperLogLog in Zig",2023,154,34,0.14,13,[19,62,194,63],"zig","3303000033305000000000005303033333000","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Fzig-hyperloglog",[29,192,24,24],"Commenters find the project awesome and cool","Dense representation allocates 1\u003C\u003Cp bytes upfront, undermining the sparse representation","algorithm library",{"id":202,"name":203,"line":204,"ai":8,"cat":9,"year":205,"points":192,"comments":29,"rec":13,"s":14,"top":206,"kw":207,"maker":21,"domain":22,"tier":46,"attempts":24,"strip":47,"url":213,"mix":214,"praise":215,"objection":-1,"sub":216},45439111,"FSST","Fast Static Symbol Table Compression Library in Go",2025,65,[208,209,210,211,212],"fsst","go compression","symbol table compression","static symbol table","string compression","https:\u002F\u002Fgithub.com\u002Faxiomhq\u002Ffsst",[29,24,24,24],"Fills a gap in the Go ecosystem","compression library",1793991213977]