linkjobai / Consistent Hashing Explained for System Design Interviews

0 likes

0 forks

1 files

Last active 1794542740

Interview prep notes

interview

Consistent Hashing Explained for System Design Interviews

When you shard a cache or database with hash(key) mod N, adding or removing one server remaps almost every key. Consistent hashing limits the damage to roughly 1/N of the keys.

How it works

Map servers and keys onto the same ring of hash values (for example 0 to 2^32 - 1).
A key belongs to the first server clockwise from its position.
When a server joins, it takes keys only from its clockwise neighbour; when one leaves, its keys move to the next server.

fameoai / Lip-sync quality checklist — a practical guide

0 likes

0 forks

1 files

Last active 1794377052

AI lip sync notes - https://fameo.ai

Lip-sync quality checklist — a practical guide

The goal here is a short clip that looks natural, finished in minutes rather than an afternoon.

A one-page check I run before I share a talking video from Fameo.

Image

Front-facing, with the mouth visible
Face large in the frame

yilaai / Yila AI

0 likes

0 forks

1 files

Last active 1793681581

Yila — evidence-traceable research workspace / research agent. https://yila.ai

Yila is a research agent that cites its sources. Every claim it produces can be traced back to the underlying evidence. It helps teams investigate questions and verify answers.

fernvector83 / Workshop Notes, Entry Fifteen

0 likes

0 forks

1 files

Last active 1790363541

Small repairs, honestly logged.

repair

The fence post leans after every storm, and every storm gets the same answer: dig the hole wider, set the post deeper, tamp the earth in layers. The neighbour says replace it. The notebook says the post outlasts three of his replacements already.

Repairs compound like interest. Each entry makes the next one faster: the tool is already sharp, the mistake already written down, the measurement already on file. The notebook is slow capital that pays out in saved Saturdays.

This gist is a copy of the notebook page, kept where text outlives paper.

Next: the lawn mower blade that finally got balanced.

aly / gist:eca9adc4c82f46c8bb6e3820e2da4eeb

0 likes

0 forks

1 files

Last active 1779666000

1	$: s("blk(3,8)").done(.2)
2
3	$: s("- ho").fast(7)
4
5	$: ch("Gm7")
6	.vo()
7	.sometimes(seg("8 6"))
8	.sometimes(seg("6 8"))
9	.dec(.3)
10	.sometimes(trans("<5 4>"))

aly / toggle-mousekeys.ps1

0 likes

0 forks

1 files

Last active 1768020426

1	Add-Type -AssemblyName System.Windows.Forms;
2	start-process ms-settings:easeofaccess-mouse;
3	Start-Sleep -Milliseconds 500;
4	[System.Windows.Forms.SendKeys]::SendWait(' ');
5	Start-Sleep -Milliseconds 500;
6	[System.Windows.Forms.SendKeys]::SendWait(' ');

aly / libupdate.py

0 likes

0 forks

2 files

Last active 1749870372

Scripts to manage pack torrents

1	#!/usr/bin/env python3
2	import sqlite3
3	from sys import argv
4	from requests import get,post
5	lib = argv[1]
6	ROOT = "/mnt/storage/_live/{}library.db"
7	QBT = "http://localhost:8080"
8
9	con = sqlite3.connect(ROOT.format(lib))
10	cur = con.cursor()

aly / lowestjob.lua

0 likes

0 forks

1 files

Last active 1747898973

1	-- Uses FastJobSwitcher
2	jobs = {
3	{ name="PLD", xp=1 },
4	{ name="WAR", xp=2 },
5	{ name="DRK", xp=21 },
6	{ name="GNB", xp=26 },
7	{ name="MNK", xp=0 },
8	{ name="DRG", xp=4 },
9	{ name="NIN", xp=19 },
10	{ name="SAM", xp=23 },

aly / main.rs

0 likes

0 forks

2 files

Last active 1747616828

1	use std::time::Duration;
2	use log::{error, info, warn, debug};
3
4	use reqwest::Client;
5	use totp_rs::{Algorithm, TOTP, Secret};
6	use clap::Parser;
7
8	const TOTP_DIGITS: usize = 6;
9	const TOTP_STEP: u64 = 30;
10	const TOTP_ALGORITHM: Algorithm = Algorithm::SHA1;

aly / a.md

0 likes

0 forks

1 files

Last active 1746656675

thing