Annanay Agarwal annanay25

Anti-hype LLM reading list

Goals: Add links that are reasonable and good explanations of how stuff works. No hype and no vendor content if possible. Practical first-hand accounts of models in prod eagerly sought.

Foundational Concepts

Pre-Transformer Models

Install Setup [running on ubuntu 16.04]

1. Install go 1.7.5

sudo apt-get install git 
wget https://storage.googleapis.com/golang/go1.7.5.linux-amd64.tar.gz
tar -C ${HOME} -xzf go1.7.5.linux-amd64.tar.gz

Add the following exports to your `~/.bashrc`.

Redis 4.2 roadmap

Redis Cluster

Speed up key -> hashslot association. Now makes RBB loading 4x slower when there are many small keys.
Better multi data center story
redis-trib C coded and moved into redis-cli
Backup / Restore of Cluster
Non blocking MIGRATE (also consider not using 2X memory)
Faster resharding
Bug fixing and stress testing to bring it to next level of maturity

LLDB Cheat Sheet

A complete gdb to lldb command map.

Print out

Print object

(lldb) po responseObject
(lldb) po [responseObject objectForKey@"state"]

p - Print primitive type

Most active GitHub users (git.io/top)

The list would not be updated for now. Don't write comments.

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.

Because of GitHub search limitations, only 1000 first users according to amount of followers are included. If you are not in the list you don't have enough followers. See raw data and source code. Algorithm in pseudocode:

githubUsers

	<div class="video-item">
	<iframe id="video0" src="//www.youtube.com/embed/4DMGfbje7NY?enablejsapi=1&html5=1" frameborder="0" allowfullscreen></iframe>
	<button class="play">Play</button>
	<button class="stop">Stop</button>
	</div>

	<div class="video-item">
	<iframe id="video1" src="//www.youtube.com/embed/nJl-qVoEEJI?enablejsapi=1&html5=1" frameborder="0" allowfullscreen></iframe>
	<button class="play">Play</button>
	<button class="stop">Stop</button>

	/* Skip Lists: A Probabilistic Alternative to Balanced Trees */

	#include <stdlib.h>
	#include <stdio.h>
	#include <limits.h>

	#define SKIPLIST_MAX_LEVEL 6

	typedef struct snode {
	int key;