GitHub status: access issues and outage reports

Problems in the last 24 hours

The graph below depicts the number of GitHub reports received over the last 24 hours by time of day. When the number of reports exceeds the baseline, represented by the red line, an outage is determined.

Most Reported Problems

The following are the most recent problems reported by GitHub users through our website.

• Website Down (68%)
• Sign in (18%)
• Errors (14%)

Live Outage Map

The most recent GitHub outage reports came from the following cities:

City	Problem Type	Report Time
Ashkelon	Website Down	24 hours ago
Veigné	Errors	9 days ago
Paris	Website Down	12 days ago
Saint-Paul	Website Down	13 days ago
Saint-Paul	Website Down	13 days ago
Mexico City	Sign in	14 days ago

Full Outage Map

Community Discussion

Tips? Frustrations? Share them here. Useful comments include a description of the problem, city and postal code.

Beware of "support numbers" or "recovery" accounts that might be posted below. Make sure to report and downvote those comments. Avoid posting your personal information.

GitHub Issues Reports

Latest outage, problems and issue reports in social media:

• 
  take_p (@take_profit_sol) reported 4 minutes ago

  @extratard 🥀 just start a new github and start over. problem solved

• 
  lẹ̀kẹ́ (@KinyemiDavid) reported 4 minutes ago

  @kdaigle Hey @kdaigle long shot here and don’t mean to pile on, but just wanted to ask if your team could possibly take a human look at my request? My GitHub account /kinyemidavid has been erroneously taken down by an automated tool (I think). I’m a solo dev doing normal development work and I’m in the middle of an urgent startup application that is extremely time sensitive. This will have serious consequences on what’s required. I’ve also not pulled in all my work so I have significant work that I’ve done for months currently unreachable to me. Would appreciate if you could help look into this.

• 
  PrimeFeranmi ★ (@prime_feranmi) reported 6 minutes ago

  @land_on_davis “I am collecting these Python repos for research.” No, I am not. I just like the feeling of stars-ing a repository on GitHub and pretending that one day I will actually sit down and read the source code. My "To Read" folder is where code goes to die.

• 
  Tuomas Rinta (@tjrfinn) reported 9 minutes ago

  X on the web and GitHub seem to be having issues, at least for me. How am I bow supposed to work when I can’t merge the PRs Claude made for me, and browse X while waiting?

• 
  bén abt (@Abt_Benjamin) reported 17 minutes ago

  The Google models are incredibly poorly integrated into GitHub Copilot. For days now, it hasn't been possible to run a prompt - there are constant unexplained crashes or errors like "invalid model" or "response too long." It still costs credits....

• 
  Duncan Townsend (@duncancmt) reported 18 minutes ago

  Notion is disrespectful software and I automatically think less of you if you make me use it. It's laggy, unoptimized, and the UI is terrible. Just send me a GitHub gist or some raw markdown

• 
  hibakod (@hibakod) reported 19 minutes ago

  @francedot @supabase Probably a GitHub issue considering how unreliable GitHub has been lately

• 
  AliceHsu (@AliceHsu_kou) reported 21 minutes ago

  Why Indirect Prompt Injection is scarier than jailbreaking:AI agents read emails, websites, GitHub issues, any can hide instructions the model blindly follows. Real cases: zero-click leaks, unauthorized payments, supply chain attacks.Why is it so hard to fix? Full breakdown 👇

• 
  Aakash Kumar Nain (@A_K_Nain) reported 22 minutes ago

  Related: I am sick and tired of README, docs, and github issues full of slop.

• 
  Sean D Langshaw (@sdlangshaw) reported 24 minutes ago

  @auth0 Doing just that on the next sprint. We already have a Custom auth + 0Auth adding federation (Google, Microsoft, Apple, GitHub, Amazon). Also adding more based on geolocation trackers. There is a valid reason for this. You'll understand when you login to the DeFi AI app.

• 
  Florian Brand (@xeophon) reported 26 minutes ago

  @angerman the code on github is the machine code but with less hoops (and in this case also the correct solution, as reading gh shows a package bump would've solved the problem)

• 
  logan (@loosenedspirit) reported 30 minutes ago

  @batuhan if this is the case please file an issue on the codex GitHub repo and/or contact their security contact

• 
  Aness Anees (@aness8191) reported 30 minutes ago

  3 hours wasted on @GitHubEducation Student Pack verification. Same docs, 3 different rejection reasons each time (name mismatch → doc issue → campus location). Also ID upload only allows front camera, no gallery option. Fix your broken verification system. @github

• 
  😴 (@Tally__DE) reported 32 minutes ago

  Erm I think I did something... An old graph-theory conjecture claimed that a certain restricted family of networks must always have the same-sized minimal monitoring teams. Sol found that every network in that family has one of only two possible structures. In the first structure, every minimal team has exactly two members. In the second, every minimal team has exactly three. That classification proves the conjecture. A Proof of Written on the Wall II Conjecture 314 Triangle-free graphs with no induced P5 are well-totally-dominated Result. Every finite simple connected triangle-free P5-free graph on at least two vertices has all inclusion-minimal total dominating sets of one size. More strongly, the size is exactly 2 in the bipartite case and exactly 3 in the nonbipartite case. Date 21 July 2026 Priority note: the mathematical proof below is complete. The claim that the resolution is publicly new is necessarily provisional: no public prior resolution was found in a focused audit, but private or unindexed prior knowledge cannot be ruled out. WOWII Conjecture 314 Private research note - 21 July 2026 Contents 1 Statement and stronger result 1 2 The bipartite branch 1 3 The nonbipartite branch 2 4 Exact computational audit 4 5 Public-prior-art assessment 5 References 6 i WOWII Conjecture 314 Private research note - 21 July 2026 1 Statement and stronger result A set D ⊆ V (G) is a total dominating set if every vertex of G, including each vertex of D, has a neighbor in D. It is minimal if no proper subset of D is a total dominating set. A graph is well-totally-dominated (WTD) when all minimal total dominating sets have the same cardinality. The current Formal Conjectures transcription of Written on the Wall II Conjecture 314 states: For every finite simple connected graph G with more than one vertex, if G is triangle-free and the largest induced path of G has at most four vertices, then G is well-totally-dominated. The path condition is exactly that G is P5-free. The public formal source currently tags the statement as research open and leaves its proof as sorry.1 Theorem 1 (Structural strengthening). Let G be a finite simple connected triangle-free P5-free graph with at least two vertices. 1. If G is bipartite, then G is a connected chain graph and every minimal total dominating set has size 2. 2. If G is nonbipartite, then G is an independent-set blow-up of C5 and every minimal total dominating set has size 3. Consequently, γt(G) = Γt(G) = {2, G is bipartite, 3, G is nonbipartite. In particular, G is WTD. Here an independent-set blow-up of C5 means that each cycle vertex i is replaced by a nonempty independent set Ai, consecutive parts are joined completely, and nonconsecutive parts have no edges. 2 The bipartite branch Fix a bipartition (X, Y ) of G. Lemma 2. The graph G is 2K2-free. Proof. Suppose that x1y1 and x2y2 induce a 2K2, with x1, x2 ∈ X and y1, y2 ∈ Y . Choose a shortest path u0u1 · · · uk whose first vertex belongs to {x1, y1} and whose last vertex belongs to {x2, y2}. There is no edge between the two endpoint sets, so k ≥ 2. Let u−1 be the other endpoint of the first displayed edge and uk+1 the other endpoint of the second. Then u−1, u0, u1, . . . , uk, uk+1 1Google DeepMind, Formal Conjectures, file WrittenOnTheWallII/GraphConjecture314.lean, accessed 21 July 2026. 1 WOWII Conjecture 314 Private research note - 21 July 2026 is an induced path. The middle path is induced because it is shortest. Bipartiteness excludes u−1u1 and uk−1uk+1. Any edge from u−1 to a later internal vertex, or from an earlier internal vertex to uk+1, would shorten the distance between the two endpoint sets. Finally, the original four vertices induce exactly two edges. The resulting induced path has at least five vertices and therefore contains an induced P5, a contradiction. Lemma 3. The graph G is a chain graph: on each side of the bipartition, the open neighborhoods are linearly ordered by inclusion. Proof. If x, x′ ∈ X had incomparable neighborhoods, choose y ∈ N (x) \ N (x′) and y′ ∈ N (x′) \ N (x). Then xy and x′y′ induce a 2K2, contradicting theorem 2. The same argument applies to Y . Lemma 4. Every minimal total dominating set of G has size 2. Proof. Let D be a minimal total dominating set. Both D ∩ X and D ∩ Y are nonempty. Choose x∗ ∈ D ∩ X whose neighborhood is maximal under inclusion and choose y∗ ∈ D ∩ Y similarly. For each y ∈ Y , total ********** gives a vertex x ∈ D ∩ X adjacent to y. By nestedness, N (x) ⊆ N (x∗), so x∗y ∈ E(G). Thus x∗ is universal to Y . Symmetrically, y∗ is universal to X. Hence {x∗, y∗} is a total dominating set contained in D, and minimality gives D = {x∗, y∗}. The argument also identifies every minimal total dominating set: it is exactly a pair {x, y} in which x is universal to Y and y is universal to X. 3 The nonbipartite branch Assume that G is nonbipartite. Lemma 5. The graph G contains an induced C5. Proof. Choose a shortest odd cycle. It is induced, because a chord splits it into two cycles, one of which is odd and shorter. Triangle-freeness excludes length 3. An induced odd cycle of length at least 7 contains an induced P5 on five consecutive vertices. Hence the cycle has length 5. Write the cycle as C = v0v1v2v3v4v0, with all indices read modulo 5. Lemma 6. The cycle C dominates G. Proof. If not, choose a vertex z at distance exactly 2 from C, with a path z − y − v0. The set N 📷 ∩ V (C) is independent because G is triangle-free. Since it contains v0, it is one of {v0}, {v0, v2}, {v0, v3}. The three cases respectively produce the induced paths z − y − v0 − v1 − v2, z − y − v2 − v3 − v4, z − y − v3 − v2 − v1. Each is an induced P5, a contradiction. 2 WOWII Conjecture 314 Private research note - 21 July 2026 Lemma 7. Every vertex x /∈ V (C) has exactly two neighbors on C, uniquely of the form N (x) ∩ V (C) = {vi−1, vi+1} for some i ∈ Z5. Proof. The set N (x) ∩ V (C) is a nonempty independent subset of C5 by triangle-freeness and theorem 6; hence it has size at most 2. If it had size 1, say {v0}, then x − v0 − v1 − v2 − v3 would be an induced P5. Thus it has size 2, and every independent pair of C5 has the displayed unique form. Define five nonempty parts Ai = {vi} ∪ {x /∈ V (C) : N (x) ∩ V (C) = {vi−1, vi+1}} . They partition V (G). Lemma 8. The parts A0, . . . , A4 form an independent-set blow-up of C5. Proof. Each Ai is independent: any two vertices in it share the neighbor vi−1, so an edge between them would create a triangle. Likewise, Ai is anticomplete to Ai+2, because vertices in those two parts share vi+1. It remains to show that consecutive parts are complete. By symmetry, take x ∈ A0 and y ∈ A1 and suppose xy /∈ E(G). This forces x̸ = v0 and y̸ = v1: every vertex of A1 is adjacent to v0, and every vertex of A0 is adjacent to v1. Now x − v4 − v0 − y − v2 is an induced P5. The four path edges follow from the definitions of the parts; every chord is excluded by the cycle, the prescribed cycle neighborhoods, or the assumption xy /∈ E(G). This contradiction proves that A0 is complete to A1. Rotation gives the result for every consecutive pair. A0 A1 A2A3 A4 each part independent adjacent parts complete Figure 1: The nonbipartite branch: an independent-set blow-up of C5. Lemma 9. Every minimal total dominating set of an independent-set blow-up of C5 has size 3. 3 WOWII Conjecture 314 Private research note - 21 July 2026 Proof. Vertices in one part Ai are false twins: they are nonadjacent and all have open neighbor- hood Ai−1 ∪ Ai+1. A minimal total dominating set D therefore contains at most one vertex from each part. If x, y ∈ D ∩ Ai were distinct, then deleting x would preserve total ********** because every vertex adjacent to x is also adjacent to y. Let S(D) = {i ∈ Z5 : D ∩ Ai̸ = ∅}. A vertex of Ai is dominated by D exactly when S(D) contains i − 1 or i + 1. Thus D is a total dominating set of G precisely when S(D) is a total dominating set of the quotient C5. Since D has at most one vertex in each part, inclusion-minimality is preserved in both directions. The cycle C5 has no total dominating set of size 2. Every three consecutive vertices form a total dominating set. Any total dominating set of size at least 4 contains three consecutive vertices and hence is not minimal. Therefore every minimal total dominating set of C5, and consequently of G, has size 3. The minimal total dominating sets are exactly the choices of one vertex from each of three consecutive parts. Their number is ∑ i∈Z5 |Ai| |Ai+1| |Ai+2|. Proof of theorem 1. The bipartite conclusion follows from theorems 3 and 4. The nonbipartite conclusion follows from theorems 5 to 9. These cases exhaust all connected graphs, and in each case all minimal total dominating sets have one cardinality. 4 Exact computational audit The theorem is proved without computation. The census below was used as an adversarial check on the statement, the classification, and the total-********** argument. Every connected unlabeled graph on 2 through 9 vertices from Brendan McKay’s graph6 catalogues was processed: 273,192 graphs in total. The official catalogue counts and graph6 format are documented by McKay’s ANU Combinatorial Data pages.2 Order Connected Hypotheses Bipartite Nonbipartite Failures 2 1 1 1 0 0 3 2 1 1 0 0 4 6 3 3 0 0 5 21 5 4 1 0 6 112 11 10 1 0 7 853 19 16 3 0 8 11,117 41 36 5 0 9 261,080 74 64 10 0 Total 273,192 155 135 20 0 Table 1: Exhaustive connected-graph census through order 9. All 135 bipartite premise graphs passed the chain-graph classifier and had unique minimal-TDS size 2. All 20 nonbipartite premise graphs passed the independent-C5-blow-up classifier and had unique minimal-TDS size 3. 2B. McKay, Combinatorial Data: Graphs and graph formats, Australian National University; accessed 21 July 2026. 4 WOWII Conjecture 314 Private research note - 21 July 2026 Two independently written implementations were used: 1. a C++20 bitset verifier that directly enumerates induced P5’s and all minimal total domi- nating sets; 2. a Python/NetworkX verifier using induced-subgraph isomorphism and an independent total-********** routine. The C++ verifier was also rebuilt and rerun under AddressSanitizer and UndefinedBehavior- Sanitizer. It produced the same result with no sanitizer errors. The complete sources, all 155 premise graphs, outputs, tool versions, and SHA-256 hashes are included in the accompanying private verification bundle. 5 Public-prior-art assessment The proof and the priority question must be separated. What is clear-cut The mathematical argument in Sections 2–3 is an elementary proof of the precise source-scoped conjecture. It also proves the stronger structural dichotomy and determines γt = Γt exactly. What the audit found As of 21 July 2026: • the current Formal Conjectures source still marks Conjecture 314 open; • exact-name, exact-statement, mathematical-synonym, GitHub code, GitHub issue, and GitHub commit searches found no public resolution; • the principal 2021 WTD paper focuses structurally on total ********** number 2, while the nonbipartite branch here has total ********** number 3;3 • the 2024 recognition paper proves coNP-completeness, not this structural result;4 • the 2026 structural work located is specifically about trees;5 • literature on (P5, K3)-free graphs discusses other invariants, including ordinary ********** and hull number, but no WTD formulation or resolution of Conjecture 314 was located.6 The honest novelty claim No search can prove that an observation is absent from private correspondence, an unindexed document, or an obscure source under different terminology. The structural dichotomy itself may be folklore or implicit in graph-class literature. The defensible statement is: 3S. Bahadir, T. Ekim, and D. Gozupek, “Well-Totally-Dominated Graphs,” Ars Mathematica Contemporanea 20 (2021), 209–222, DOI 10.26493/1855-3974.2465.571. 4A. Agrawal et al., “Recognizing well-dominated graphs is coNP-complete,” Information Processing Letters 183 (2024), 106419, DOI 10.1016/j.ipl.2023.106419. 5J. Lim et al., “Characterization of Well-Totally Dominated Trees,” arXiv:2602.13956 (2026). 6See I. E. Zverovich, “The ********** number of (Kp, P5)-free graphs,” Australasian Journal of Combinatorics 27 (2003), 95–100; and M. C. Dourado et al., “Hull number: P5-free graphs and reduction rules,” Discrete Applied Mathematics 210 (2016), 171–175. 5 WOWII Conjecture 314 Private research note - 21 July 2026 No public prior resolution of WOWII Conjecture 314 was found in the audit completed on 21 July 2026. Nothing in this work has been submitted, posted, uploaded, emailed, or otherwise published. The next correct step, before any public priority claim, is private review by specialists in total ********** and P5-free graph structure. References [1] E. DeLaVina, Written on the Wall II: Conjectures of Graffiti.pc, public problem database. [2] Google DeepMind, Formal Conjectures, WrittenOnTheWallII/GraphConjecture314.lean, accessed 21 July 2026. [3] S. Bahadir, T. Ekim, and D. Gozupek, “Well-Totally-Dominated Graphs,” Ars Mathematica Contemporanea 20 (2021), 209–222. [4] A. Agrawal, H. Fernau, P. Kindermann, K. Mann, and U. S. Souza, “Recognizing well- dominated graphs is coNP-complete,” Information Processing Letters 183 (2024), 106419. [5] J. Lim et al., “Characterization of Well-Totally Dominated Trees,” arXiv:2602.13956 (2026). [6] I. E. Zverovich, “The ********** number of (Kp, P5)-free graphs,” Australasian Journal of Combinatorics 27 (2003), 95–100. [7] M. C. Dourado et al., “Hull number: P5-free graphs and reduction rules,” Discrete Applied Mathematics 210 (2016), 171–175. [8] B. McKay, Combinatorial Data, Australian National Univ

• 
  Vaibhav Sisinty (@VaibhavSisinty) reported 40 minutes ago

  I tested 10 open source AI tools this week. I didn't write a single line of code for any of them. I gave Codex the repo link, said install this, and it picked the folder, checked my disk space and opened the app when it was done. That's the actual story. The tools are just the proof. → OpenMontage, the first open source agentic video production system. One sentence in. It ran the research, went and found real footage, cut it into a timeline, graded it, then wrote and voiced its own narration on top. It was the #1 trending repo on GitHub the day it launched. → Voicebox, MIT licensed, built on Qwen3-TTS. Cloned my voice off a short sample in about a minute. This is what you're paying ElevenLabs for every month, except your voice never leaves your machine. → HyperFrames from HeyGen. Your agent writes HTML and CSS, Chrome and FFmpeg turn it into a deterministic MP4. I asked for liquid glass and chrome ribbons colliding in slow motion. What came back looks like a week of someone's life in After Effects. Apache 2.0, 32,000+ stars. → Nemotron 3 Ultra, NVIDIA's largest open model. 550B total, 55B active, with weights and training data and recipes all published. I pointed a coding agent at it and asked for an EMI calculator in one file. It built it, then reviewed its own output, caught a bug and rebuilt it before it showed me anything. Six more in the video, including a meeting notetaker that never sends your audio anywhere. Installing used to be the hard part. Now it's the part you delegate.

• 
  Caleb Burns (@Code_Fault) reported 40 minutes ago

  @dhof @nikitabier @iamjasonlevin The problem is the key and its location is hidden. A public/private key pair would make more sense. If I setup a passkey, will it invalidate my password or other keys? Why does every website ask for my passkey when it knows I haven't established one (I'm looking at you Github)?

• 
  Marwan Baz (@marwanbz_) reported 41 minutes ago

  Bro didn't fix github, so he quit:(

• 
  Min (@min_aws) reported 41 minutes ago

  @tobimori @icyphox Think of it like this if you can pay for 100$/200$ AI subscriptions you can pay 10$ to host a *** server no? If you can't do that please host it on Github. Again you or me or anyone isn't entitled to a free service. Please try and understand their position as well here.

• 
  Luis Lozano (@luislozanog86) reported 44 minutes ago

  There seems to be an issue with Gemma 4 31B @googlegemma where it hallucinates tool_calls by creating fake outputs that then get mistaken as real memories. I was able to reproduce the error on Cerebras and OpenRouter. Next step: test Gemma 4 directly via GPU. And if this stills happens, I need to reproduce with other Gemma 4 products. I'll share the Github with the errors and the fix once we have it.

• 
  S F (@itchyappendix) reported 45 minutes ago

  @cielikes Github put a 'project successor' field in to help deal with this problem.

• 
  Afilia Frostfang 🌽🔞 (@AfiliaFrostfang) reported 45 minutes ago

  I love it when I get DMs on Discord or Issues on Github, saying "It doesnt work." Thank you Bobbyswagger69HDYT, that tells me everything of what is wrong, I will now proceed to review my Code and fix it.

• 
  Atkins (@atkins_chang) reported 51 minutes ago

  @pvncher Yes. The gate blocks Luna (catalog v1) from `spawn_agent`. Reporting here because the related GitHub issues are either unanswered or mis-triaged as the old "model args not exposed" bug instead of the real mismatch.

• 
  fucory (@FUCORY) reported 53 minutes ago

  Prompt Review Day 2 A very basic real routine Smithers example Harness: Claude Code Model: Fable Context: I had been running a smithers script that opened issues on github for hours before this Prompt: > We have a bunch of open issues. I want you to create a smithers script that uses <Workree> component to fix all of them in parallel max concurrency of 16 putting them through a review > loop with codex implementing and claude opus reviewing > > epics should be broken down into smaller issues where we design smithers scripts and then tickets where we run and monitor them so this smithers script involves building and running > other smithers scripts What I did well: - It got the job done - added back pressure - Gave the agent useful context about the issues that affect orchestration patterns What I did poorly - Some of the issues would have benifited from an agent optionally asking for my approval on design decisions Notes: - A lot of my specification here about how orchestration should work is no longer necessary with the smithers skill

• 
  Admire The Web (@AdmireTheWeb) reported 54 minutes ago

  @cipriangb Is there a GitHub issue for these changes? Or does it just get done in silence. Can't find any background on it.

• 
  Mikyo (@mikeldking) reported 58 minutes ago

  @stanzillaz @cassidoo We have the skill installed - so pretty well. gh skill install github/gh-stack the problem now is that claude and other agents don't know where they are in the stack so it's pretty darn hard to know which stacked diff you're on at any one point in time. The agent switches which stacked diff it's on but you can't tell...

• 
  N8 Programs (@N8Programs) reported 58 minutes ago

  i applaud openai for sharing these reports. but just saying 'oopsie poopsie our internal model isn't vewy aligned' isn't actually solving the issue: "The model circumvented sandbox restrictions designed to block external access and proceeded with the upload to GitHub. It took our model an hour to find a vulnerability in the sandbox in order to make the PR;" literally a few days later: "The models identified and chained vulnerabilities across OpenAI’s research environment and Hugging Face’s production infrastructure to obtain test solutions directly from Hugging Face’s production database."

• 
  Ciprian Popescu (@cipriangb) reported 59 minutes ago

  @AdmireTheWeb There was one, yes, and it was reverted after lots of devs protested. And then they snuck it in, eventually. I can't find it in my GitHub, because closed issues don't appear.

• 
  seeco (@seeconvm) reported 60 minutes ago

  This guy turned his Obsidian vault into an AI auditor for 30+ GitHub repos. Most people star a repo and forget it exists. Months later: dead dependencies. 3 tools solving the same problem. Folders nobody wants to delete. So he let Claude read everything. Every 12 hours it asks: what is unused? what overlaps? what can safely disappear? The graph stops being decoration. It becomes memory. Bookmark this before your GitHub stars become a graveyard.

• 
  Rob Hallam (@robj3d3) reported 1 hour ago

  If you wanna do it yourself, this is how: Buy (~15 min) 1. Cheap VPS from Hetzner or DigitalOcean (~€5-10/mo), Ubuntu 24.04, tick automatic backups at checkout 2. Add your domain to Cloudflare (free plan), switch nameservers at your registrar 3. Install Termius (SSH app) + Tailscale (private network) on laptop and phone, free tiers Lock it down (~20 min) 4. Generate an SSH key in Termius, add it to the VPS at creation. Keys only, never passwords 5. SSH in once via public IP, run updates, install Tailscale on the server, log it in 6. Disable Tailscale key expiry for the server (admin console, one click) 7. Verify you can SSH via the server's Tailscale 100.x address BEFORE the next step 8. Provider firewall: delete all inbound rules, allow only port 443 from Cloudflare's published IP ranges. No public SSH at all. You enter through the tunnel 9. Test from outside: public IP times out on everything, Tailscale IP connects. Server is now invisible 10. One SSH key per device. Phone gets its own key added to authorized_keys Install the brain (~5 min) 11. apt install tmux then install Claude Code (official native installer, one curl command) 12. Run Claude Code inside a tmux session so it survives disconnects and keeps working while your laptop is closed Hand over everything else 13. Write ONE long handover prompt telling Claude Code: the server facts, the security model (so it doesn't "fix" it), folder conventions (/srv/ per project, one tmux session each), your preferences, and standing rules (confirm before destructive actions, new services bind to localhost/Tailscale only) 14. Make it write all of that into CLAUDE.md first, so every future session already knows everything 15. Backups before features: nightly job pushing your data to GitHub, tested, before a single page exists 16. Then let it install the web server (Caddy + Cloudflare DNS plugin plays nicest with the locked firewall), set up SQLite, deploy the first page From then on you never administer the server again. You open Termius from anywhere, on any device, and just say what you want. BOSH

• 
  THE MIST (@KobySamuel) reported 1 hour ago

  @github stop playing with me … sms one time password not working and I didn’t save recovery codes . I didn’t use Authenticator app too… I can’t login. Complaint sent to support team 3 weeks ago.. no response