Cross-community point settlement and reserve fund coverage control method, device and equipment based on double account books and state channel, and storage medium
By adopting a dual-ledger and state channel-based approach, the problems of high capital occupation, static reserves, and weak reconciliation links in cross-community points clearing were solved, achieving low capital occupation, dynamic reserve coverage, and strong auditing, thereby enhancing the stability and reliability of the system.
Patent Information
- Application Number
- CN202511260958.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-09-04
- Publication Date
- 2025-12-05
AI Technical Summary
In cross-community points clearing scenarios, existing technologies suffer from problems such as high capital occupation, poor real-time performance, static reserves with a lack of dynamic coverage, weak reconciliation and proof links, and a lack of snapshot rollback and downgrade measures when clearing fails.
This method employs a dual-ledger and state channel approach. Requests are received and written into the state channel via a transaction access gateway. Net amount calculation, reserve coverage ratio calculation, batch digest generation and signature confirmation via joint signature are performed. Combined with snapshot generation and rollback mechanisms, and through monitoring and alarm units, the technical means are implemented. The application scenarios of the implementation and examples are illustrated in Figure 1. Technical Application: This method, apparatus, device, and storage medium combining state channels are implemented. The technical application phrase is: This method, apparatus, device, and storage medium combining state channels for cross-community points clearing and reserve coverage control are implemented.
It has achieved a cross-community points clearing architecture with low capital occupation, dynamic reserve coverage, strong auditing and rollback capability, which solves the problems of high capital occupation, poor real-time performance, static reserves and weak reconciliation links, and enhances the stability and reliability of the system.
Smart Images
Figure CN121073552A_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the field of community credit clearing and financial technology, in particular to a method and device for cross-community credit clearing and reserve coverage control based on double-ledger and state channel, equipment and storage medium. BACKGROUND
[0002] In the cross-community credit clearing scenario, transactions are frequent and there are many participants, which has the following problems: The traditional clearing architecture needs to be confirmed one by one, resulting in high capital occupation and poor real-time performance; Reserves are mostly dependent on static ratios, lacking dynamic coverage and hard constraints; The reconciliation and proof link is weak, making it difficult to form strong evidence; There is a lack of snapshot rollback and degradation measures when clearing fails or is abnormal.
[0003] Therefore, there is an urgent need for a cross-community credit clearing architecture that takes into account low occupation, strong constraints, auditability, and rollback. SUMMARY
[0004] PURPOSE The present application aims to provide a method and system for cross-community credit clearing and reserve coverage control based on double-ledger and state channel, achieving low capital occupation, dynamic coverage, strong auditability, and rollback.
[0005] TECHNICAL SCHEME In the method aspect, the following steps are included: S1: The transaction access gateway (101) receives the cross-community credit transaction request and writes it into the state channel (105); S2: The clearing engine (102) performs netting calculation (103) within a Δt time window, Δt range [1,1440] minutes; S3: Classify transactions according to the SCOPE field in the parameter table (109) and calculate the reserve coverage ratio; S4: If the reserve ratio is lower than the threshold r_min ∈ [0.2,0.6], trigger flow control or only receive but not pay; when it is higher than r_tar ∈ [0.6,1.0], restore normality; S5: When the reserve is found to be insufficient, generate a supplementary payment instruction, with a supplementary payment ratio λ ∈ [0.3,0.8]; S6: During execution, fees are calculated at a proportion h ∈ [0,0.2] and f ∈ [0,0.02]; S7: The reconciliation and proof generation unit (106) generates a batch summary Com_k (transaction batch Merkle root) and is confirmed by a sig_set signature set, which includes at least ≥2 / 3 community node signatures; S8: The settlement gateway (107) performs batch settlement according to the summary and signature to generate a snapshot Snapshot_k; S9: When performance degradation δ% ∈ [0.01, 0.03] is monitored and lasts for M ∈ [3, 10] batches, the rollback module is triggered to restore to the previous snapshot; S10: The monitoring and alarm unit (110) monitors thresholds and abnormal events in real time and pushes alarm information.
[0006] System aspects include: - A transaction access gateway (101); - A settlement engine (102); - A net amount calculation unit (103); - A reserve management module (104); - A state channel management module (105); - A reconciliation and proof generation unit (106); - A settlement gateway (107); - A ledger storage module (108), including a main ledger and a snapshot area; - A parameter table storage unit (109); - A monitoring and alarm unit (110).
[0007] Preferred embodiments 1. State channel mechanism: transaction requests are first written to the state channel, and periodic batch settlement reduces the number of interactions on the chain.
[0008] 2. Reserve coverage: when the reserve ratio is lower than 30%, trigger flow control and freeze part of the request; when it is higher than 80%, restore normal.
[0009] 3. Joint signature: each batch summary Com_k is confirmed by a sig_set signature, using the BLS multi-signature scheme, with at least 2 / 3 community nodes participating.
[0010] 4. Rollback mechanism: when the cumulative degradation rate is ≥2% within 5 batches, rollback to Snapshot_{k-1}.
[0011] 5. Audit compliance: all snapshots and signatures are stored in the ledger storage module (108), supporting external audit verification.
[0012] Benefits 1. Low occupancy: state channel and net calculation reduce capital freezing; 2. Strong constraints: reserve coverage and dynamic threshold form hard constraints to avoid excessive clearing; 3. Strong audit: Com_k and sig_set joint signature form a verifiable certificate; 4. Rollbackable: snapshots and rollback mechanisms enhance disaster recovery and stability; 5. Combined technical effects: double ledger + state channel + SCOPE parameter classification + joint signature + snapshot rollback → non-obvious engineering closed loop, solving the traditional pain points of "high occupancy, low constraints, weak audit, and no rollback". BRIEF DESCRIPTION OF DRAWINGS
[0013] Figure 1 : System overall structure block diagram; Figure 2 : Community account ledger and state channel interaction structure diagram; Figure 3 : Cross-community points clearing process diagram; Figure 4 : Ledger and snapshot structure logic diagram; Figure 5 : Points exchange rate and exchange logic structure diagram. DETAILED DESCRIPTION
[0014] See method steps and preferred embodiments.
[0015] CONTRAST TABLE OF REFERENCE NUMBERS Figure 1 : 101 —— transaction access gateway 102 —— clearing engine 103 —— net calculation unit 104 —— reserve management module 105 —— state channel management module 106 —— reconciliation and proof generation unit 107 —— settlement gateway 108 —— ledger storage module 109 —— parameter table storage unit 110 —— monitoring and alarm unit Figure 2 : 201 —— community account ledger 202 —— state channel interaction interface 203 —— transaction buffer zone Figure 3 : 301 —— Batch clearing process 302 —— Threshold detection subunit 303 —— Dynamic triggering subunit Figure 4 : 401 —— Master ledger area 402 —— Snapshot area 403 —— Rollback module Figure 5 : 501 —— Exchange rate parameter table 502 —— Exchange logic unit 503 —— Fee accrual unit 507 —— Audit and archival unit
Claims
1. A method for cross-community points clearing and reserve coverage control based on dual ledgers and state channels, comprising: 1) Perform netting calculations for cross-community transactions within the Δt time window; 2) Perform reserve coverage validation based on the SCOPE field classification; 3) When the reserve ratio is lower than r_min ∈ [0.2,0.6], rate limiting or only receiving without paying is triggered; when it is higher than r_tar ∈ [0.6,1.0], it is restored. 4) When reserves are insufficient, a replenishment instruction is generated, with a replenishment ratio λ ∈ [0.3, 0.8]; 5) Accrue expenses proportionally to h ∈ [0,0.2] and f ∈ [0,0.02]; 6) Generate a batch digest Com_k, and have it signed and confirmed by nodes with sig_set ≥ 2 / 3; 7) Perform batch liquidation based on snapshots. When the degradation δ% ∈ [0.01,0.03] and the duration M ∈ [3,10] batches, trigger a rollback.
2. The method according to claim 1, wherein, Com_k is the Merkle root digest of the batch transaction, and sig_set is the set of multi-party joint signatures using BLS signatures.
3. A system for cross-community points clearing and reserve coverage control based on dual ledgers and state channels, comprising: The system includes a transaction access gateway, a clearing engine, a net amount calculation unit, a reserve management module, a status channel management module, a reconciliation and proof generation unit, a settlement gateway, a ledger storage module, a parameter table storage unit, and a monitoring and alarm unit.
4. The system according to claim 3, wherein, The ledger storage module includes a main ledger area and a snapshot area, and supports snapshot rollback.
5. A computer-readable storage medium having a program stored thereon that, when executed by a processor, implements the method of claims 1–2.
6. An electronic device comprising a processor and a memory, wherein the memory stores a program that, when executed by the processor, implements the method of claims 1–2.