{"id":23102565,"url":"https://github.com/charlieroth/gossip-glomers","last_synced_at":"2025-04-03T21:27:08.189Z","repository":{"id":241383778,"uuid":"806628388","full_name":"charlieroth/gossip-glomers","owner":"charlieroth","description":"Fly's \"Gossip Glomers\" Challenge in Swift","archived":false,"fork":false,"pushed_at":"2024-06-25T10:50:41.000Z","size":14511,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-26T10:50:40.997Z","etag":null,"topics":["distributed-systems","gossip-glomers","swift"],"latest_commit_sha":null,"homepage":"https://fly.io/dist-sys/","language":"Swift","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/charlieroth.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-27T15:05:49.000Z","updated_at":"2024-06-25T10:50:44.000Z","dependencies_parsed_at":"2024-06-25T08:44:30.954Z","dependency_job_id":null,"html_url":"https://github.com/charlieroth/gossip-glomers","commit_stats":null,"previous_names":["charlieroth/flydistswift","charlieroth/gossip-glomers"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/charlieroth%2Fgossip-glomers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/charlieroth%2Fgossip-glomers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/charlieroth%2Fgossip-glomers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/charlieroth%2Fgossip-glomers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/charlieroth","download_url":"https://codeload.github.com/charlieroth/gossip-glomers/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247081124,"owners_count":20880376,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["distributed-systems","gossip-glomers","swift"],"created_at":"2024-12-16T23:59:57.918Z","updated_at":"2025-04-03T21:27:08.163Z","avatar_url":"https://github.com/charlieroth.png","language":"Swift","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Gossip Glomers\n\nSolving Fly's _Gossip Glomers_ distributed systems challenges with Swift\n\n## Challenge Checklist\n\n- [x] Challenge 1: Echo\n- [x] Challenge 2: Unique ID Generation\n- [x] Challenge 3a: Single-Node Broadcast\n- [x] Challenge 3b: Multi-Node Broadcast\n- [x] Challenge 3c: Fault Tolerant Broadcast\n- [x] Challenge 3d: Efficient Broadcast, Part 1\n- [x] Challenge 3e: Efficient Broadcast, Part 2\n- [x] Challenge 4: Grow-Only Counter\n- [x] Challenge 5a: Single-Node Kafka-Style Log\n- [x] Challenge 5b: Multi-Node Kafka-Style Log\n- [x] Challenge 5c: Efficient Kafka-Style Log (See `MultiNodeKafka/`\n  solution)\n- [x] Challenge 6a: Single-Node, Totally Available Transactions\n- [ ] Challenge 6b: Totally-Available, Read Uncommitted Transactions\n- [ ] Challenge 6c: Totally-Available, Read Committed Transactions\n\n## Maelstrom Commands\n\n### Challenge 1: Echo\n\n```bash\n./maelstrom test -w echo --bin ~/path/to/bin --node-count 1 --time-limit 10\n```\n\n### Challenge 2: Unique ID Generation\n\n```bash\n./maelstrom test -w unique-ids --bin ~/path/to/bin --time-limit 30 --rate 1000 --node-count 3 --availability total --nemesis partition\n```\n\n### Challenge 3a: Single-Node Broadcast\n\n```bash\n./maelstrom test -w broadcast --bin ~/path/to/bin --node-count 1 --time-limit 20 --rate 10\n```\n\n### Challenge 3b: Multi-Node Broadcast\n\n```bash\n./maelstrom test -w broadcast --bin ~/path/to/bin --node-count 5 --time-limit 20 --rate 10\n```\n\n### Challenge 3c: Fault-Tolerant Broadcast\n\n```bash\n./maelstrom test -w broadcast --bin ~/path/to/bin --node-count 5 --time-limit 20 --rate 10 --nemesis partition\n```\n\n### Challenge 3d: Efficient Broadcast, Part I\n\n```bash\n./maelstrom test -w broadcast --bin ~/path/to/bin --node-count 25 --time-limit 20 --rate 100 --latency 100\n```\n\n### Challenge 3e: Efficient Broadcast, Part II\n\n```bash\n./maelstrom test -w broadcast --bin ~/path/to/bin --node-count 25 --time-limit 20 --rate 100 --latency 100\n```\n\n### Challenge 4: Grow-Only Counter\n\n```bash\n./maelstrom test -w g-counter --bin ~/path/to/bin --node-count 3 --rate 100 --time-limit 20 --nemesis partition\n```\n\n### Challenge 5a: Single-Node Kafka-Style Log\n\n```bash\n./maelstrom test -w kafka --bin ~/path/to/bin --node-count 1 --concurrency 2n --time-limit 20 --rate 1000\n```\n\n### Challenge 5b: Multi-Node Kafka-Style Log\n\n```bash\n./maelstrom test -w kafka --bin ~/path/to/bin --node-count 2 --concurrency 2n --time-limit 20 --rate 1000\n```\n\n### Challenge 5c: Efficient Kafka-Style Log\n\n```bash\n./maelstrom test -w kafka --bin ~/path/to/bin --node-count 2 --concurrency 2n --time-limit 20 --rate 1000\n```\n\n### Challenge 6a: Single-Node, Totally-Available Transactions\n\n```bash\n./maelstrom test -w txn-rw-register --bin ~/path/to/bin --node-count 1 --time-limit 20 --rate 1000 --concurrency 2n --consistency-models read-uncommitted --availability total\n```\n\n### Challenge 6b: Totally-Available, Read Uncommited Transactions\n\n```bash\n./maelstrom test -w txn-rw-register --bin ~/path/to/bin --node-count 2 --concurrency 2n --time-limit 20 --rate 1000 --consistency-models read-uncommitted\n\n./maelstrom test -w txn-rw-register --bin ~/path/to/bin --node-count 2 --concurrency 2n --time-limit 20 --rate 1000 --consistency-models read-uncommitted --availability total --nemesis partition\n```\n\n### Challenge 6c: Totally-Available, Read Commited Transactions\n\n```bash\n./maelstrom test -w txn-rw-register --bin ~/path/to/bin --node-count 2 --concurrency 2n --time-limit 20 --rate 1000 --consistency-models read-committed --availability total –-nemesis partition\n```\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcharlieroth%2Fgossip-glomers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcharlieroth%2Fgossip-glomers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcharlieroth%2Fgossip-glomers/lists"}