【git】WARNING: connection is not using a post-quantum key exchange algorithm.

【git】WARNING: connection is not using a post-quantum key exchange algorithm.

问题:

推送代码提示下面信息:

16:22:54.422: [C:\git\yang-teambition] git -c credential.helper= -c core.quotepath=false -c log.showSignature=false push --progress --porcelain origin refs/heads/dev_tianzhi:dev_tianzhi ** WARNING: connection is not using a post-quantum key exchange algorithm. ** This session may be vulnerable to "store now, decrypt later" attacks. ** The server may need to be upgraded. See https://openssh.com/pq.html Enumerating objects: 59, done. Counting objects: 1% (1/59) Counting objects: 3% (2/59) Counting objects: 5% (3/59) Counting objects: 6% (4/59) Counting objects: 8% (5/59) Counting objects: 10% (6/59) Counting objects: 11% (7/59) Counting objects: 13% (8/59) Counting objects: 15% (9/59) Counting objects: 16% (10/59) Counting objects: 18% (11/59) Counting objects: 20% (12/59) Counting objects: 22% (13/59) Counting objects: 23% (14/59) Counting objects: 25% (15/59) Counting objects: 27% (16/59) Counting objects: 28% (17/59) Counting objects: 30% (18/59) Counting objects: 32% (19/59) Counting objects: 33% (20/59) Counting objects: 35% (21/59) Counting objects: 37% (22/59) Counting objects: 38% (23/59) Counting objects: 40% (24/59) Counting objects: 42% (25/59) Counting objects: 44% (26/59) Counting objects: 45% (27/59) Counting objects: 47% (28/59) Counting objects: 49% (29/59) Counting objects: 50% (30/59) Counting objects: 52% (31/59) Counting objects: 54% (32/59) Counting objects: 55% (33/59) Counting objects: 57% (34/59) Counting objects: 59% (35/59) Counting objects: 61% (36/59) Counting objects: 62% (37/59) Counting objects: 64% (38/59) Counting objects: 66% (39/59) Counting objects: 67% (40/59) Counting objects: 69% (41/59) Counting objects: 71% (42/59) Counting objects: 72% (43/59) Counting objects: 74% (44/59) Counting objects: 76% (45/59) Counting objects: 77% (46/59) Counting objects: 79% (47/59) Counting objects: 81% (48/59) Counting objects: 83% (49/59) Counting objects: 84% (50/59) Counting objects: 86% (51/59) Counting objects: 88% (52/59) Counting objects: 89% (53/59) Counting objects: 91% (54/59) Counting objects: 93% (55/59) Counting objects: 94% (56/59) Counting objects: 96% (57/59) Counting objects: 98% (58/59) Counting objects: 100% (59/59) Counting objects: 100% (59/59), done. Delta compression using up to 20 threads Compressing objects: 3% (1/27) Compressing objects: 7% (2/27) Compressing objects: 11% (3/27) Compressing objects: 14% (4/27) Compressing objects: 18% (5/27) Compressing objects: 22% (6/27) Compressing objects: 25% (7/27) Compressing objects: 29% (8/27) Compressing objects: 33% (9/27) Compressing objects: 37% (10/27) Compressing objects: 40% (11/27) Compressing objects: 44% (12/27) Compressing objects: 48% (13/27) Compressing objects: 51% (14/27) Compressing objects: 55% (15/27) Compressing objects: 59% (16/27) Compressing objects: 62% (17/27) Compressing objects: 66% (18/27) Compressing objects: 70% (19/27) Compressing objects: 74% (20/27) Compressing objects: 77% (21/27) Compressing objects: 81% (22/27) Compressing objects: 85% (23/27) Compressing objects: 88% (24/27) Compressing objects: 92% (25/27) Compressing objects: 96% (26/27) Compressing objects: 100% (27/27) Compressing objects: 100% (27/27), done. Writing objects: 2% (1/37) Writing objects: 5% (2/37) Writing objects: 8% (3/37) Writing objects: 10% (4/37) Writing objects: 13% (5/37) Writing objects: 16% (6/37) Writing objects: 18% (7/37) Writing objects: 21% (8/37) Writing objects: 24% (9/37) Writing objects: 27% (10/37) Writing objects: 29% (11/37) Writing objects: 32% (12/37) Writing objects: 35% (13/37) Writing objects: 37% (14/37) Writing objects: 40% (15/37) Writing objects: 43% (16/37) Writing objects: 45% (17/37) Writing objects: 51% (19/37) Writing objects: 54% (20/37) Writing objects: 56% (21/37) Writing objects: 59% (22/37) Writing objects: 62% (23/37) Writing objects: 64% (24/37) Writing objects: 67% (25/37) Writing objects: 70% (26/37) Writing objects: 72% (27/37) Writing objects: 75% (28/37) Writing objects: 78% (29/37) Writing objects: 81% (30/37) Writing objects: 83% (31/37) Writing objects: 86% (32/37) Writing objects: 89% (33/37) Writing objects: 91% (34/37) Writing objects: 94% (35/37) Writing objects: 97% (36/37) Writing objects: 100% (37/37) Writing objects: 100% (37/37), 3.62 KiB | 463.00 KiB/s, done. Total 37 (delta 18), reused 0 (delta 0), pack-reused 0 (from 0) Read from remote host gitlab.xxx.com: Connection reset by peer client_loop: send disconnect: Connection reset by peer send-pack: unexpected disconnect while reading sideband packet fatal: the remote end hung up unexpectedly 

这是 Git 在推送代码到远程仓库时,连接被远端强制断开Connection reset by peer)导致的失败。常见原因和解决方式如下:


✅ 可能原因与对应处理

原因说明解决方式
1. 大文件或提交过多你这次推送了 37 个对象,虽然不算特别大,但如果包含大文件(如 PDF、图片、jar 包),容易触发 GitLab 的限制。检查是否有大文件被提交:
`git rev-list --objects --all
grep -E '.(pdf|jar|zip|png|jpg)'<br>如有,用 git filter-repoBFG` 清理历史。
2. 网络不稳定 / VPN 中断你公司 GitLab 地址是 gitlab.hezhihulian.com,可能是内网或 VPN 环境,连接中断。重试几次:
git push origin dev_tianzhi
或换网络 / 换 SSH 端口。
3. GitLab 服务器限制服务端配置了超时或最大包大小限制(如 Nginx、GitLab 本身的 git timeout)。联系运维确认 GitLab 日志 /var/log/gitlab/gitlab-workhorse/current 是否报错。
4. SSH 密钥或权限问题虽然报错不是权限拒绝,但某些 GitLab 版本在权限异常时会直接断连。确认你有 dev_tianzhi 分支的推送权限,且 SSH key 已正确配置。

你可以立即尝试的排查/修复步骤

检查是否有大文件

git ls-tree -r -l dev_tianzhi | sort -k4 -n | tail -10

使用 HTTPS 推送测试(排除 SSH 问题):

git remote set-url origin https://gitlab.yang.com/xxx/xxx.git git push origin dev_tianzhi

减小包大小(分批推送): 如果你本地有多个提交,可以尝试分批次推送:

git rebase -i HEAD~10 # 把多个提交合并成1~2个 git push origin dev_tianzhi

重试推送(最简单):

git push origin dev_tianzhi



Read more

基于C++11手撸前端Promise

基于C++11手撸前端Promise

文章导航 * 引言 * 前端Promise的应用与优势 * 常见应用场景 * 并发请求 * Promise 解决的问题 * 手写 C++ Promise 实现 * 类结构与成员变量 * 构造函数 * resolve 方法 * reject 方法 * then 方法 * onCatch 方法 * 链式调用 * 使用示例 * `std::promise` 与 `CProimse` 对比 * 1. 基础功能对比 * 2. 实现细节对比 * (1) 状态管理 * (2) 回调注册与执行 * (3) 异步支持 * (4) 链式调用 * 3. 代码示例对比 * (1) `CProimse` 示例 * (2) `std::promise` 示例 * 4.

By Ne0inhk
HDFS NameNode高可用(HA)完全指南:原理、组件与实现

HDFS NameNode高可用(HA)完全指南:原理、组件与实现

HDFS NameNode高可用(HA)完全指南:原理、组件与实现 * 引言 * 一、NameNode HA架构总览 * 1.1 架构目标 * 1.2 架构图 * 1.3 核心设计思想 * 二、核心组件详解 * 2.1 组件一览表 * 2.2 JournalNode:共享存储的核心 * 工作原理 * 2.3 ZooKeeper:分布式协调者 * 2.4 ZKFC:故障转移控制器 * 2.5 DataNode的特殊角色 * 三、元数据同步机制:QJM详解 * 3.1 QJM是什么? * 3.2 写入流程 * 3.

By Ne0inhk
LeetCode算法日记 - Day 5: 长度最小的子数组、无重复字符的最长子串

LeetCode算法日记 - Day 5: 长度最小的子数组、无重复字符的最长子串

目录 1. 长度最小的子数组 1.1 题目解析 1.2 解法 1.3 代码实现 2. 无重复字符的最长子串 2.1 题目解析 2.2 解法 2.3 代码实现 1. 长度最小的子数组 209. 长度最小的子数组 - 力扣(LeetCode) 给定一个含有 n 个正整数的数组和一个正整数 target 。 找出该数组中满足其总和大于等于 target 的长度最小的 子数组 [numsl, numsl+1, ..., numsr-1, numsr] ,并返回其长度。如果不存在符合条件的子数组,返回 0 。 示例 1: 输入:

By Ne0inhk
《算法题讲解指南:优选算法-前缀和》--31.连续数组,32.矩阵区域和

《算法题讲解指南:优选算法-前缀和》--31.连续数组,32.矩阵区域和

🔥小叶-duck:个人主页 ❄️个人专栏:《Data-Structure-Learning》 《C++入门到进阶&自我学习过程记录》《算法题讲解指南》--从优选到贪心 ✨未择之路,不须回头 已择之路,纵是荆棘遍野,亦作花海遨游 目录 31. 连续数组 题目链接: 题目描述: 题目示例: 解法(前缀和+哈希表): 算法思路: C++算法代码: 算法总结及流程解析: 32. 矩阵区域和 题目链接: 题目描述: 题目示例: 解法: 算法思路: C++算法代码: 算法总结及流程解析: 结束语 31. 连续数组 题目链接: 525. 连续数组 - 力扣(LeetCode) 题目描述: 题目示例: 解法(

By Ne0inhk