From 7f10154a6880b99b9df1d931c32460720069a98f Mon Sep 17 00:00:00 2001 From: urvishp80 Date: Fri, 15 Nov 2024 03:24:31 +0000 Subject: [PATCH] Updated homepage.json file --- ...-post-processing-O-n-2-fancy-chunking-.xml | 24 ++ ...-post-processing-O-n-2-fancy-chunking-.xml | 20 ++ ...-post-processing-O-n-2-fancy-chunking-.xml | 22 ++ ...-post-processing-O-n-2-fancy-chunking-.xml | 18 ++ ...-post-processing-O-n-2-fancy-chunking-.xml | 18 ++ ...-post-processing-O-n-2-fancy-chunking-.xml | 22 ++ ...-post-processing-O-n-2-fancy-chunking-.xml | 40 ++- static/homepage.json | 237 ++++++++-------- .../Nov_2024/2024-11-15-homepage.json | 258 ++++++++++++++++++ 9 files changed, 521 insertions(+), 138 deletions(-) create mode 100644 static/delvingbitcoin/Nov_2023/432_Linearization-post-processing-O-n-2-fancy-chunking-.xml create mode 100644 static/delvingbitcoin/Nov_2023/433_Linearization-post-processing-O-n-2-fancy-chunking-.xml create mode 100644 static/delvingbitcoin/Nov_2023/438_Linearization-post-processing-O-n-2-fancy-chunking-.xml create mode 100644 static/delvingbitcoin/Nov_2023/439_Linearization-post-processing-O-n-2-fancy-chunking-.xml create mode 100644 static/delvingbitcoin/Nov_2023/443_Linearization-post-processing-O-n-2-fancy-chunking-.xml create mode 100644 static/delvingbitcoin/Nov_2023/445_Linearization-post-processing-O-n-2-fancy-chunking-.xml create mode 100644 static/homepage/Nov_2024/2024-11-15-homepage.json diff --git a/static/delvingbitcoin/Nov_2023/432_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/432_Linearization-post-processing-O-n-2-fancy-chunking-.xml new file mode 100644 index 000000000..b1e1b2f02 --- /dev/null +++ b/static/delvingbitcoin/Nov_2023/432_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -0,0 +1,24 @@ + + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:31.009015+00:00 + + sipa 2023-11-18 19:11:20.969000+00:00 + + python-feedgen + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:31.009046+00:00 + + The process of cluster processing primarily involves running a linearization algorithm on the cluster to output a valid topological ordering for its transactions. This step is crucial as it sets the stage for further processing, including the invocation of a "find high-feerate topologically-valid subset" algorithm. The selected algorithm could be based on ancestor set feerate or employ an exponential search mechanism. The outcome of this phase is integral in ensuring that transactions are added in an efficient and logical order. Following linearization, the transactions undergo chunking, an operation partitioned into manageable chunks through an $\mathcal{O}(n)$ algorithm. This chunking algorithm initiates with each transaction in its individual chunk, progressively merging adjacent chunks based on a comparison of their feerates until no further merging criteria are met. + +However, challenges arise in the chunking process, especially with the advent of per-chunk package Replace-By-Fee (RBF) policies, spotlighting the need for generating "sane" chunks. Instances have been identified where the conventional chunking method produces suboptimal results, linking transactions in a manner that doesn't reflect the most efficient processing order. A notable example highlighted involves transactions with equal size but varying feerates, where the ancestor-set based linearization fails to recognize the optimal transaction order, leading to inefficient chunk formation. + +Addressing these shortcomings, a refined chunking algorithm has been proposed. Unlike its predecessor, this enhanced version not only creates initial chunks for each transaction but also incorporates a mechanism for swapping the positions of chunks based on dependency and feerate comparisons. This approach can execute a significantly higher number of operations, potentially up to $\frac{n(n-1)}{2}$ swaps, categorizing it under $\mathcal{O}(n^2)$ complexity. However, if applied to an already optimal linearization, the complexity remains $\mathcal{O}(n)$. This new algorithm stands out by guaranteeing improvement or maintenance of the feerate diagram without detracting from it, thereby enhancing the overall transaction processing efficiency. + +Furthermore, the advanced algorithm serves a dual purpose. It can function as both an improved chunking mechanism and a post-processing step for linearization. When used post-linearization, it enables the production of a list of transactions that can be easily rechunked by simpler algorithms into correct chunks. This flexibility is particularly beneficial for adjusting linearizations without necessitating a complete overhaul, thereby streamlining the processing of transactions at the end of a block. Despite its advantages, the sophisticated chunking strategy does not eliminate the necessity for careful linearization, underscoring the significance of input quality for achieving optimal outcomes. + 2023-11-18T19:11:20.969000+00:00 + + diff --git a/static/delvingbitcoin/Nov_2023/433_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/433_Linearization-post-processing-O-n-2-fancy-chunking-.xml new file mode 100644 index 000000000..638427415 --- /dev/null +++ b/static/delvingbitcoin/Nov_2023/433_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -0,0 +1,20 @@ + + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:24:13.943332+00:00 + + ajtowns 2023-11-17 02:26:24.154000+00:00 + + python-feedgen + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:24:13.943357+00:00 + + In exploring the efficiency of transaction processing within a blockchain context, a significant focus has been placed on the concepts of linearization and chunking. These processes are typically seen as complementary, with the end goal being to manage transactions in grouped chunks rather than as individual entities. A proposed methodology involves constructing a graph based on single-transaction chunks, subsequently merging these chunks based on a greedy algorithm that considers the ancestor fee rate, a key metric in determining transaction priority. This approach also entails updating the ancestor fee rates throughout the process, which could lead to further chunk merging based on the newly calculated rates, culminating in the sorting of chunks according to their final score. + +Despite the theoretical appeal of building chunks directly from ancestor scoring, practical application reveals complexity. For instance, a scenario was outlined to demonstrate the limitations of both the current and proposed methods in achieving optimal outcomes. In this scenario, transactions are represented in a graph with varying sizes and fees, leading to a specific linearization sequence when processed by the ancestor linearization method. The outlined example specifically highlighted instances where the new algorithm might not yield the most optimal chunk arrangement, suggesting that while the new approach offers potential improvements, it does not guarantee optimal solutions in all cases. This revelation underscores the inherent challenges in designing algorithms for transaction processing that are universally efficient, indicating that there remains room for further refinement and exploration in this area. + 2023-11-17T02:26:24.154000+00:00 + + diff --git a/static/delvingbitcoin/Nov_2023/438_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/438_Linearization-post-processing-O-n-2-fancy-chunking-.xml new file mode 100644 index 000000000..4244e5562 --- /dev/null +++ b/static/delvingbitcoin/Nov_2023/438_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -0,0 +1,22 @@ + + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:24:03.709573+00:00 + + sipa 2023-11-17 03:44:58.790000+00:00 + + python-feedgen + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:24:03.709610+00:00 + + Chunking and linearization are concepts that, while related, are distinct in their application within programming. The discussion highlights an implementation approach where linearizations are directly modified during certain operations, such as splitting clusters. This process is followed by rechunking, eliminating the need for a complete relinearization. This approach underscores a preference for working with chunks, treating linearization primarily as a step towards achieving chunking. The notion is supported by the argument that converting between these representations is generally straightforward, especially given the low computational cost of the O(n) chunking algorithm. + +The dialogue further explores the comparison between different algorithms, suggesting that one proposed method might align closely with an O(n^2) algorithm previously described. This connection is drawn through the processes of combining (cpfp) and swapping, which are integral to both methods. The merging and attachment of chunks in the discussed method resemble pre-sorted combinations of connected components' chunks in the alternative algorithm. The effectiveness of these operations can vary significantly based on the sequence in which merges are executed, indicating the potential impact of input linearization quality on the end results. + +Moreover, there's speculation on the practical efficiency of this approach, suggesting it may require fewer than O(n) swaps per insertion if the data is initially more segmented. However, the increase in efficiency could be offset by a rise in complexity. This balance between efficiency and complexity is crucial when considering the adoption of such methods in programming practices, highlighting the need for thoughtful implementation and optimization strategies. + 2023-11-17T03:44:58.790000+00:00 + + diff --git a/static/delvingbitcoin/Nov_2023/439_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/439_Linearization-post-processing-O-n-2-fancy-chunking-.xml new file mode 100644 index 000000000..889eac865 --- /dev/null +++ b/static/delvingbitcoin/Nov_2023/439_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -0,0 +1,18 @@ + + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:52.778456+00:00 + + ajtowns 2023-11-17 04:37:08.338000+00:00 + + python-feedgen + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:52.778488+00:00 + + The discussion revolves around the comparison between a proposed algorithm and an existing $O(n^2)$ algorithm, with a focus on their equivalence in results. The core of the conversation suggests that there might not be any significant differences in the outcomes produced by both algorithms. This similarity raises questions about the utility of implementing the new algorithm unless it offers simplicity or a substantial increase in efficiency. Furthermore, the mention of ancestor linearization as a current method for creating blocks indicates that this technique is already integrated into processes, implying that any new methodology would need to justify its adoption over established practices. The dialogue hints at a critical evaluation of the proposed algorithm's practicality, especially in terms of its complexity and performance improvements over the existing system. + 2023-11-17T04:37:08.338000+00:00 + + diff --git a/static/delvingbitcoin/Nov_2023/443_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/443_Linearization-post-processing-O-n-2-fancy-chunking-.xml new file mode 100644 index 000000000..aadda9cfe --- /dev/null +++ b/static/delvingbitcoin/Nov_2023/443_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -0,0 +1,18 @@ + + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:46.200736+00:00 + + Greg Sanders 2023-11-17 15:34:53.708000+00:00 + + python-feedgen + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:46.200766+00:00 + + The email emphasizes the significance of reorganizing chunks during the linearization process as a method to enhance the efficiency of diagrams. This approach goes beyond merely introducing new partitions and focuses on the rearrangement of existing chunks. The improvement is presented as a crucial step in optimizing linearization, potentially refining any suboptimal steps within the process. The discussion suggests that this strategy could be widely applicable, offering improvements over traditional methods by ensuring that the structure of diagrams is not only maintained but also enhanced for better performance and clarity. + 2023-11-17T15:34:53.708000+00:00 + + diff --git a/static/delvingbitcoin/Nov_2023/445_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/445_Linearization-post-processing-O-n-2-fancy-chunking-.xml new file mode 100644 index 000000000..ef2731dc7 --- /dev/null +++ b/static/delvingbitcoin/Nov_2023/445_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -0,0 +1,22 @@ + + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:40.651135+00:00 + + sipa 2023-11-17 20:32:10.006000+00:00 + + python-feedgen + + 1 + Linearization post-processing (O(n^2) fancy chunking) + 2024-11-15T03:23:40.651161+00:00 + + Implementing post-processing after linearization offers significant benefits in programming, especially when dealing with data organization and manipulation. This technique ensures that sub-chunk linearization is effectively achieved. It is particularly useful at the end of a block where fitting a full chunk might not be possible. Instead of employing a comprehensive search or skipping clusters to locate ones with smaller chunks, this approach provides a streamlined solution. + +Moreover, the efficiency of re-running post-processing on an already-post-processed linearization is noteworthy. The process operates in \(\mathcal{O}(n)\) time without necessitating swaps, which underscores its computational efficiency. This aspect is crucial for maintaining the integrity and order of clusters in their linearization format, as opposed to a chunked format. + +The strategy of performing post-processing at the time of chunking and preserving the outcome merits attention. By adopting this method, one can ensure that the quality benefits of chunkings are always leveraged. Additionally, this approach guarantees that re-chunkings, when they are sufficiently trivial, remain linear in terms of time complexity. This dual advantage highlights the practicality and effectiveness of incorporating post-processing early in the workflow, thereby enhancing the overall structure and accessibility of the data. + 2023-11-17T20:32:10.006000+00:00 + + diff --git a/static/delvingbitcoin/Nov_2023/combined_Linearization-post-processing-O-n-2-fancy-chunking-.xml b/static/delvingbitcoin/Nov_2023/combined_Linearization-post-processing-O-n-2-fancy-chunking-.xml index d4e05fe31..1961f7004 100644 --- a/static/delvingbitcoin/Nov_2023/combined_Linearization-post-processing-O-n-2-fancy-chunking-.xml +++ b/static/delvingbitcoin/Nov_2023/combined_Linearization-post-processing-O-n-2-fancy-chunking-.xml @@ -2,28 +2,52 @@ 2 Combined summary - Linearization post-processing (O(n^2) fancy chunking) - 2023-12-29T19:26:28.359985+00:00 + 2024-11-15T03:24:28.919470+00:00 - sipa 2023-11-30 04:25:45.567000+00:00 + sipa . 2023-11-30 04:25:45.567000+00:00 - sipa 2023-11-29 22:52:59.338000+00:00 + sipa . 2023-11-29 22:52:59.338000+00:00 + + + sipa 2023-11-18 19:11:20.969000+00:00 + + + sipa 2023-11-17 20:32:10.006000+00:00 + + + Greg Sanders 2023-11-17 15:34:53.708000+00:00 + + + ajtowns 2023-11-17 04:37:08.338000+00:00 + + + sipa 2023-11-17 03:44:58.790000+00:00 + + + ajtowns 2023-11-17 02:26:24.154000+00:00 + + + + + + python-feedgen 2 Combined summary - Linearization post-processing (O(n^2) fancy chunking) - 2023-12-29T19:26:28.359985+00:00 + 2024-11-15T03:24:28.919545+00:00 - In an experimental analysis, it was observed that the ancestor sort algorithm effectively organized clusters of up to four transactions. However, its efficiency diminished with larger clusters. A specific cluster example demonstrated the limitation of the algorithm: + An experimental evaluation highlights the limitations of the ancestor sort algorithm in sorting complex transaction clusters within Bitcoin networks. The algorithm is efficient for simpler clusters up to four transactions but struggles with more intricate configurations, as demonstrated through a specific structure where it fails to achieve optimal sorting. The provided mermaid graph illustrates a scenario where the algorithm inaccurately groups transactions, contrasting the identified optimal sequence. This discrepancy underscores the need for further development or refinement of algorithms to efficiently handle complex transaction cluster structures. -A complex transaction graph involving five transactions labeled from 'A' to 'E' with their respective weights was presented in a Mermaid graph format. This graph illustrated the suboptimal sorting result produced by the ancestor sort algorithm. The algorithm sorted the transactions as [A,C,D,E,B], which resulted in them being grouped into a single chunk [ACDEB]. This occurs because the algorithm first selects [ACDE] and then appends 'B' to this initial chunk. +The blog post introduces an insight from @sdaftuar on applying the gathering theorem to Bitcoin transaction sequencing. This theorem, rooted in prefix-intersection merging, suggests that reordering transactions can optimize fee rates and thus improve block space utilization and miner revenue. The discussion emphasizes the potential benefits of careful transaction ordering for mining operations' efficiency and profitability, inviting developers and researchers to explore this area further. For a deeper understanding of the gathering theorem and its implications, resources are available at DelvingBitcoin.org, offering extensive discussions on merging incomparable linearizations and related topics. -In contrast, the optimal sorting for this cluster should be [A,B,C,D,E], which would ideally be chunked as [ABC, DE], maintaining a separation between the two subsets based on their transaction ordering. +In addressing the process of processing transaction clusters, a detailed method involving linearization algorithms and chunking algorithms is outlined. These algorithms aim to produce a valid topological ordering of transactions, with the chunking algorithm further optimizing this order based on fee rates. However, challenges arise in achieving "sane" chunk outcomes, particularly with the application of per-chunk package RBF policies. An alternative chunking approach is proposed to address these challenges, focusing on optimizing the ordering and chunking of transactions to enhance feerate outcomes without compromising the structural integrity of the transaction sequence. This new method demonstrates improvements over traditional approaches but also highlights the importance of input quality in achieving optimal results. -Additionally, it was noted that the gathering theorem, found within the context of prefix-intersection merging, is relevant here as well. This theorem explains why swapping adjacent unconnected transaction sequences—where each sequence would typically be chunked together—in favor of a sequence with a higher fee rate results in improved sorting. This improvement holds true even when the swapped sequences are not directly related within the linearization. This concept supports the notion that tweaking the order of independent transaction groups can lead to more optimal sorting outcomes when considering the fee rates. The gathering theorem's principles can be further explored through the links provided to delve deeper into the strategies for merging incomparable linearizations. +Furthermore, the discussion explores the conceptual overlap between linearization and chunking processes, suggesting that they are often synonymous in practice. The conversation indicates a preference for operations to work primarily in chunks, treating linearization as an intermediary step. Despite this, the complexity and efficiency of the proposed algorithms remain significant considerations, underscoring the ongoing need for innovative solutions in transaction processing protocols. 2023-11-30T04:25:45.567000+00:00 diff --git a/static/homepage.json b/static/homepage.json index 7a2bccc2b..7ed94c963 100644 --- a/static/homepage.json +++ b/static/homepage.json @@ -1,101 +1,82 @@ { - "header_summary": "Ethan Heilman detailed a Bitcoin development process known as transaction grinding, crucial for ensuring the equality of specific transaction values through a deterministic generation method, which is essential for security against attackers who may exploit transaction staticness. This grinding process, pivotal for covenant spending, emphasizes the importance of randomness in thwarting potential collision attacks by attackers, furthering the ongoing efforts to safeguard Bitcoin transactions ([source](https://gnusha.org/pi/bitcoindev/CAEM=y+W2jyFoJAq9XrE9whQ7EZG4HRST01TucWHJtBhQiRTSNQ@mail.gmail.com/T/#m4278899c5d3fed1b1537d899f7445bed0389bcf6)).\n\nWeikeng Chen advocated for the Bitcoin mailing lists to secure their domain, highlighting the risks of dependency on external organizations for hosting critical communications and the Linux Foundation's commitment to maintaining the pipermail archives as a gesture of support. This discussion underscores the importance of ensuring the continuity and independence of Bitcoin development communication channels, suggesting potential collaboration with the Linux Foundation for a smoother transition ([source](https://gnusha.org/pi/bitcoindev/CABaSBaz13bUoHCupXYhmX+yS0dn89f80yx8ZD3uO5-1RiLZJCQ@mail.gmail.com/T/#m120c03443cd1d55488c85ee654bc236d01fc50b0)).\n\nMatt Corallo introduced a new Bitcoin Improvement Proposal (BIP) featuring a \"payment info callback\" to enhance transaction functionalities without disrupting current wallet operations, aimed at improving security and usability in various applications. This advancement showcases the Bitcoin community's dedication to innovation, addressing evolving user needs while emphasizing security through specific payment information formats for diverse transaction methods ([source](https://gnusha.org/pi/bitcoindev/93c14d4f-10f3-48af-9756-7e39d61ba3d4@mattcorallo.com/T/#u#mbd868eaf7d663bd32e4fcfd5bc8b8888f342b210)).\n\nLastly, the removal of Antoine Riard from the GitHub lightning organization due to a violation of the Code of Conduct (CoC) reflects the community's commitment to maintaining a respectful and positive environment. This action, based on principles of diversity, tolerance, and mutual respect, highlights the seriousness with which the community approaches adherence to its foundational values, ensuring a constructive space for all members ([source](https://delvingbitcoin.org/t/code-of-conduct-violation-banning-antoine-riard-for-3-months/1254)).", + "header_summary": "A new opcode, `OP_PAIRCOMMIT`, is proposed for tapscript to enhance Lightning Network (LN) symmetry and efficiency, representing an alternative to the `CAT` opcode. Its introduction is aimed at optimizing rebindable channels through efficient hash computations, detailed in the proposal by moonsettler et al. in a [GitHub gist](https://gist.github.com/moonsettler/d7f1fb88e3e54ee7ecb6d69ff126433b) and submitted as a pull request to the [bitcoin/bips repository](https://github.com/bitcoin/bips).\n\nBrandon Black discusses the implications of including the `CHECKSIGFROMSTACKVERIFY` (CSFSV) opcode in pre-tapscript Bitcoin versions, emphasizing the debate over its necessity and potential to enhance script functionality. This debate highlights the broader conversation within the community on optimizing Bitcoin's scripting capabilities through strategic opcode additions, as seen in the discussions hosted on [gnusha.org](https://gnusha.org/pi/bitcoindev/ZzZziZOy4IrTNbNG@console/T/#u#mfe9c974e575666fb49b475a9d6fa184bf8f55ab1).\n\nBitcoin Improvement Proposals (BIPs) 118, 119, and 347 mark significant advancements in scripting, with `SIGHASH_ANYPREVOUT`, `OP_CHECKTEMPLATEVERIFY` (CTV), and `OP_CAT` activation demonstrating varied applications from enhancing transaction flexibility to enabling complex spend conditions. The analysis by ajtowns on signet transactions reveals strategic use cases and experimentation within the ecosystem, suggesting a vibrant exploration of Bitcoin's scripting potential as detailed in [delvingbitcoin.org](https://delvingbitcoin.org/t/ctv-apo-cat-activity-on-signet/1257).\n\nZmnSCPxj and ajtowns bring to light the evolving discussion on channel factory monitoring and the innovative use of WOTS+ (Winternitz One-Time Signature Plus) in Bitcoin transactions. These discussions underscore the ongoing efforts to refine off-chain channel mechanisms and explore advanced scripting functionalities, showcasing the community's commitment to leveraging Bitcoin's underlying technology for improved scalability and security, as shared on [delvingbitcoin.org](https://delvingbitcoin.org/t/pluggable-channel-factories/1252/3) and [another page](https://delvingbitcoin.org/t/winternitz-one-time-signatures-contrasting-between-lisp-and-script/1255).", "recent_posts": [ { - "id": "m4278899c5d3fed1b1537d899f7445bed0389bcf6", - "title": "ColliderScript: Covenants in Bitcoin via 160-bit hash collisions", - "link": "https://gnusha.org/pi/bitcoindev/CAEM=y+W2jyFoJAq9XrE9whQ7EZG4HRST01TucWHJtBhQiRTSNQ@mail.gmail.com/T/#m4278899c5d3fed1b1537d899f7445bed0389bcf6", + "id": "m53078da2568e93a70d05c6be71ec0951c3a5786f", + "title": "OP_PAIRCOMMIT", + "link": "https://gnusha.org/pi/bitcoindev/xyv6XTAFIPmbG1yvB0l2N3c9sWAt6lDTG-xjIbogOZ-lc9RfsFeJ-JPuXuXKzVea8T9TztlCvSrxZOWXKCwogCy9tqa49l3LXjF5K2cLtP4=@protonmail.com/T/#u#m53078da2568e93a70d05c6be71ec0951c3a5786f", "authors": [ - "Ethan Heilman" + "moonsettler" ], - "published_at": "2024-11-13T22:06:00+00:00", - "summary": "- The discussion explains transaction grinding for specific data inclusion in Bitcoin transactions.\n- It details a deterministic generation process ensuring transaction modification through grinding.\n- Highlighting security, randomness in grinding thwarts attackers from finding transaction collisions.", - "n_threads": 2, + "published_at": "2024-11-15T00:00:00+00:00", + "summary": "- A new opcode, `OP_PAIRCOMMIT`, is proposed for tapscript to enhance LN-Symmetry.\n- It aims to reduce SHA256 iterations in unilateral closes by using a specific sequence of operations.\n- The proposal, supported by several contributors, is detailed in a GitHub gist and seeks further community input.", + "n_threads": 0, "dev_name": "bitcoin-dev", - "contributors": [ - "Antoine Riard" - ], - "file_path": "static/bitcoin-dev/Nov_2024/m4278899c5d3fed1b1537d899f7445bed0389bcf6_ColliderScript-Covenants-in-Bitcoin-via-160-bit-hash-collisions.xml", - "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_ColliderScript-Covenants-in-Bitcoin-via-160-bit-hash-collisions.xml" + "contributors": [], + "file_path": "static/bitcoin-dev/Nov_2024/m53078da2568e93a70d05c6be71ec0951c3a5786f_OP-PAIRCOMMIT.xml", + "combined_summ_file_path": "" }, { - "id": "m120c03443cd1d55488c85ee654bc236d01fc50b0", - "title": "Broken links to the previous mailing list archive", - "link": "https://gnusha.org/pi/bitcoindev/CABaSBaz13bUoHCupXYhmX+yS0dn89f80yx8ZD3uO5-1RiLZJCQ@mail.gmail.com/T/#m120c03443cd1d55488c85ee654bc236d01fc50b0", + "id": "mfe9c974e575666fb49b475a9d6fa184bf8f55ab1", + "title": "CHECKSIGFROMSTACK(VERIFY/ADD)", + "link": "https://gnusha.org/pi/bitcoindev/ZzZziZOy4IrTNbNG@console/T/#u#mfe9c974e575666fb49b475a9d6fa184bf8f55ab1", "authors": [ - "Weikeng Chen" + "Brandon Black" ], - "published_at": "2024-11-13T02:35:00+00:00", - "summary": "- The discussion underlines acquiring a domain for Bitcoin mailing lists for their autonomy.\n- Linux Foundation may support Bitcoin's development, especially by maintaining archives.\n- Moving to a new domain could benefit from collaboration between Bitcoin and the Linux Foundation.", - "n_threads": 1, - "dev_name": "bitcoin-dev", - "contributors": [ - "Bryan Bishop" - ], - "file_path": "static/bitcoin-dev/Nov_2024/m120c03443cd1d55488c85ee654bc236d01fc50b0_Broken-links-to-the-previous-mailing-list-archive.xml", - "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_Broken-links-to-the-previous-mailing-list-archive.xml" - }, - { - "id": "mbd868eaf7d663bd32e4fcfd5bc8b8888f342b210", - "title": "BIP 21 Updates", - "link": "https://gnusha.org/pi/bitcoindev/93c14d4f-10f3-48af-9756-7e39d61ba3d4@mattcorallo.com/T/#u#mbd868eaf7d663bd32e4fcfd5bc8b8888f342b210", - "authors": [ - "Matt Corallo" - ], - "published_at": "2024-11-12T16:07:00+00:00", - "summary": "- A new Bitcoin Improvement Proposal introduces a \"payment info callback\" feature.\n- It incorporates a \"pop\" parameter for wallets to prove payment, adhering to RFC 3986.\n- The proposal aims for security and adaptability in Bitcoin transactions and payment verification.", - "n_threads": 1, + "published_at": "2024-11-14T22:02:00+00:00", + "summary": "- Discussions on CSFS BIP highlight debate over including CSFSV in pre-tapscript versions.\n- Debate extends to adding CSFSA, potentially easing script multisigs and reducing weight units.\n- Brandon Black seeks community feedback to fine-tune BIP and CSFS(V/A) implementations.", + "n_threads": 0, "dev_name": "bitcoin-dev", "contributors": [], - "file_path": "static/bitcoin-dev/Nov_2024/mbd868eaf7d663bd32e4fcfd5bc8b8888f342b210_BIP-21-Updates.xml", - "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_BIP-21-Updates.xml" + "file_path": "static/bitcoin-dev/Nov_2024/mfe9c974e575666fb49b475a9d6fa184bf8f55ab1_CHECKSIGFROMSTACK-VERIFY-ADD-.xml", + "combined_summ_file_path": "" }, { - "id": "3512", - "title": "Winternitz One Time Signatures, contrasting between Lisp and Script", - "link": "https://delvingbitcoin.org/t/winternitz-one-time-signatures-contrasting-between-lisp-and-script/1255", + "id": "3521", + "title": "CTV, APO, CAT activity on signet", + "link": "https://delvingbitcoin.org/t/ctv-apo-cat-activity-on-signet/1257", "authors": [ "ajtowns" ], - "published_at": "2024-11-13T08:07:02.515000+00:00", - "summary": "- Jonas Nick demonstrated a WOTS+ application in Bitcoin, generating verifiable signatures.\n- The method highlights Bitcoin scripting language limitations, like inefficient looping.\n- It suggests functional lean4 implementation for simpler, verifiable Bitcoin transactions.", + "published_at": "2024-11-14T17:34:11.568000+00:00", + "summary": "- BIPs 118, 119, and 347 have brought advanced changes to Bitcoin scripting.\n- Key observations include APO's use in transactions and CTV's application for secure vaults.\n- OP_CAT's adoption exceeds APO and CTV, showing significant utility in Bitcoin contracts.", "n_threads": 0, "dev_name": "delvingbitcoin", "contributors": [], - "file_path": "static/delvingbitcoin/Nov_2024/3512_Winternitz-One-Time-Signatures-contrasting-between-Lisp-and-Script.xml", + "file_path": "static/delvingbitcoin/Nov_2024/3521_CTV-APO-CAT-activity-on-signet.xml", "combined_summ_file_path": "" }, { - "id": "3511", - "title": "Code of Conduct Violation: Banning Antoine Riard for 3 months", - "link": "https://delvingbitcoin.org/t/code-of-conduct-violation-banning-antoine-riard-for-3-months/1254", + "id": "3515", + "title": "Pluggable Channel Factories", + "link": "https://delvingbitcoin.org/t/pluggable-channel-factories/1252/3", "authors": [ - "rustyrussell" + "ZmnSCPxj" ], - "published_at": "2024-11-13T03:10:29.411000+00:00", - "summary": "- Antoine Riard was removed from GitHub lightning for harassment, following the CoC.\n- His contributions are blocked for three months to uphold community values.\n- The action supports the community's foundation of mutual respect and excellence.", - "n_threads": 0, + "published_at": "2024-11-14T15:04:03.807000+00:00", + "summary": "- Implementing a monitoring mechanism in plugin software for blockchain channel exits is emphasized.\n- It mentions the need for foundational gossip protocol adjustments before enhancing factory-hosted channels.\n- Introduces \"sidepools\" as a hybrid approach to improve liquidity management and channel efficiency.", + "n_threads": 2, "dev_name": "delvingbitcoin", - "contributors": [], - "file_path": "static/delvingbitcoin/Nov_2024/3511_Code-of-Conduct-Violation-Banning-Antoine-Riard-for-3-months.xml", - "combined_summ_file_path": "" + "contributors": [ + "renepickhardt" + ], + "file_path": "static/delvingbitcoin/Nov_2024/3515_Pluggable-Channel-Factories.xml", + "combined_summ_file_path": "static/delvingbitcoin/Nov_2024/combined_Pluggable-Channel-Factories.xml" }, { - "id": "3508", - "title": "Expanding on BOLT12", - "link": "https://delvingbitcoin.org/t/expanding-on-bolt12/1167/5", + "id": "3512", + "title": "Winternitz One Time Signatures, contrasting between Lisp and Script", + "link": "https://delvingbitcoin.org/t/winternitz-one-time-signatures-contrasting-between-lisp-and-script/1255", "authors": [ - "andyschroder" + "ajtowns" ], - "published_at": "2024-11-12T00:26:55.435000+00:00", - "summary": "- BIP70 introduced a refund feature for Bitcoin, enhancing transaction reversals.\n- The feature supports projects like the Bitcoin Fluid Dispenser, detailed on Andy Schroder's site.\n- This advancement improves Bitcoin's financial versatility, accommodating diverse transactional needs.", - "n_threads": 4, + "published_at": "2024-11-13T08:07:02.515000+00:00", + "summary": "- Jonas Nick showcased WOTS+ application in Bitcoin transactions using expanded script opcodes.\n- Critical discussion on Bitcoin script's limitations in handling loops and structured data.\n- WOTS+ implementation suggests improvements for Bitcoin's scripting capabilities and efficiency.", + "n_threads": 0, "dev_name": "delvingbitcoin", - "contributors": [ - "accumulator" - ], - "file_path": "static/delvingbitcoin/Nov_2024/3508_Expanding-on-BOLT12.xml", - "combined_summ_file_path": "static/delvingbitcoin/Nov_2024/combined_Expanding-on-BOLT12.xml" + "contributors": [], + "file_path": "static/delvingbitcoin/Nov_2024/3512_Winternitz-One-Time-Signatures-contrasting-between-Lisp-and-Script.xml", + "combined_summ_file_path": "" } ], "active_posts": [ @@ -107,7 +88,7 @@ "Ethan Heilman" ], "published_at": "2024-11-07T17:44:00+00:00", - "summary": "- The new method enables creating Bitcoin covenants without soft forks, using Tapscript.\n- Covenant spending demands computational resources exceeding current Bitcoin block mining efforts.\n- This advancement allows arbitrary computations within Bitcoin, potentially enhancing quantum resistance.", + "summary": "- The team introduces a novel Bitcoin covenant creation method, avoiding soft forks via Tapscript.\n- This method's spending process is computationally intense, requiring resources akin to 33 hours of Bitcoin network activity.\n- It enables advanced transactions like quantum-resistant Lamport signatures within Bitcoin's 4MB limit, expanding scripting capabilities.", "n_threads": 2, "dev_name": "bitcoin-dev", "contributors": [ @@ -116,21 +97,6 @@ "file_path": "static/bitcoin-dev/Nov_2024/m22239cd0ba6fec6bb835522be315d50496fefa1c_ColliderScript-Covenants-in-Bitcoin-via-160-bit-hash-collisions.xml", "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_ColliderScript-Covenants-in-Bitcoin-via-160-bit-hash-collisions.xml" }, - { - "id": "mbf2be36cc056f66fddd8e59f0794a9680716982f", - "title": "BIP 21 Updates", - "link": "https://gnusha.org/pi/bitcoindev/93c14d4f-10f3-48af-9756-7e39d61ba3d4@mattcorallo.com/T/#u#mbf2be36cc056f66fddd8e59f0794a9680716982f", - "authors": [ - "Matt Corallo" - ], - "published_at": "2024-05-30T21:54:00+00:00", - "summary": "- The discussion suggests updating BIP 21 for modern Bitcoin payment methods.\n- A change proposal for BIP 21 aims to support advanced payment instructions.\n- This proposal seeks to maintain compatibility with existing and future technologies.", - "n_threads": 1, - "dev_name": "bitcoin-dev", - "contributors": [], - "file_path": "static/bitcoin-dev/May_2024/mbf2be36cc056f66fddd8e59f0794a9680716982f_BIP-21-Updates.xml", - "combined_summ_file_path": "static/bitcoin-dev/May_2024/combined_BIP-21-Updates.xml" - }, { "id": "mf020da837a496d9f1d33bfe338dc2edb6f5468cb", "title": "Broken links to the previous mailing list archive", @@ -139,15 +105,31 @@ "Bryan Bishop" ], "published_at": "2024-11-12T19:54:00+00:00", - "summary": "- The Linux Foundation stopped hosting bitcoin-dev HTML email archives, breaking numerous links.\n- Alternatives like gnusha.org's redirect service and a GitHub Python script help maintain access.\n- These efforts emphasize the importance of preserving the archived content for Bitcoin's history.", - "n_threads": 1, + "summary": "- The Linux Foundation halted hosting bitcoin-dev HTML email archives, breaking many links.\n- Gnusha.org's redirect service and a GitHub Python script offer solutions for accessing old content.\n- These efforts highlight the community's commitment to preserving Bitcoin's historical records.", + "n_threads": 2, "dev_name": "bitcoin-dev", "contributors": [ + "Andrew Poelstra", "Weikeng Chen" ], "file_path": "static/bitcoin-dev/Nov_2024/mf020da837a496d9f1d33bfe338dc2edb6f5468cb_Broken-links-to-the-previous-mailing-list-archive.xml", "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_Broken-links-to-the-previous-mailing-list-archive.xml" }, + { + "id": "mbf2be36cc056f66fddd8e59f0794a9680716982f", + "title": "BIP 21 Updates", + "link": "https://gnusha.org/pi/bitcoindev/93c14d4f-10f3-48af-9756-7e39d61ba3d4@mattcorallo.com/T/#u#mbf2be36cc056f66fddd8e59f0794a9680716982f", + "authors": [ + "Matt Corallo" + ], + "published_at": "2024-05-30T21:54:00+00:00", + "summary": "- The email discusses updating BIP 21 for modern Bitcoin payments, including Segwit and Taproot.\n- It acknowledges the use of Silent Payments and BOLT 12, suggesting BIP 21 could embed additional instructions.\n- A change proposal for BIP 21 aims to document current payment methods while ensuring backwards compatibility.", + "n_threads": 1, + "dev_name": "bitcoin-dev", + "contributors": [], + "file_path": "static/bitcoin-dev/May_2024/mbf2be36cc056f66fddd8e59f0794a9680716982f_BIP-21-Updates.xml", + "combined_summ_file_path": "static/bitcoin-dev/May_2024/combined_BIP-21-Updates.xml" + }, { "id": "1996", "title": "Great Consensus Cleanup Revival", @@ -156,7 +138,7 @@ "AntoineP" ], "published_at": "2024-03-24T19:53:27.073000+00:00", - "summary": "- The analysis reveals vulnerabilities and inefficiencies in Bitcoin, suggesting improvements for security.\n- It proposes solutions for the timewarp exploit, malicious transactions, and merkle root vulnerabilities.\n- Community debate arises over proposals like block size reduction, highlighting scalability concerns.", + "summary": "- The Great Consensus Cleanup targets Bitcoin's vulnerabilities, aiming to improve security and performance.\n- It proposes adjustments to mining mechanisms and transaction constraints to protect network integrity.\n- Community debate surrounds the block size reduction's impact on scalability and efficiency.", "n_threads": 49, "dev_name": "delvingbitcoin", "contributors": [ @@ -183,8 +165,8 @@ "JohnLaw" ], "published_at": "2024-10-31T22:50:15.637000+00:00", - "summary": "- The OPR protocol enhances Lightning network payments, ensuring rapid, size-invariant resolution without on-chain transactions.\n- It introduces a burn output mechanism for secure, scalable off-chain payment resolution, aiming to deter dishonest behavior.\n- The protocol offers solutions to operational risks and supports scalability, promising improvements in efficiency and security for small transactions.", - "n_threads": 8, + "summary": "- The OPR protocol enhances Lightning network payments, ensuring quick resolution without on-chain transactions.\n- It introduces a burn output mechanism to deter dishonest behavior and improve system trust.\n- The protocol aims to increase scalability and security, offering solutions for operational risks and node failures.", + "n_threads": 9, "dev_name": "delvingbitcoin", "contributors": [ "harding", @@ -201,7 +183,7 @@ "andyschroder" ], "published_at": "2024-09-14T07:01:38.506000+00:00", - "summary": "- Devices can authorize payments offline, ensuring secure and efficient transactions.\n- The process uses pre-computed identifiers and secret keys stored on mobile devices.\n- A proposed BOLT12 modification enhances transaction security by verifying invoice authenticity.", + "summary": "- The concept allows secure, efficient payments without direct internet on the device using pre-computed IDs.\n- Transactions proceed with the seller's internet-connected point of sale issuing a BOLT12 offer, ensuring privacy.\n- A proposed BOLT12 adjustment enhances security by verifying invoice authenticity, reducing computational load on nodes.", "n_threads": 5, "dev_name": "delvingbitcoin", "contributors": [ @@ -214,68 +196,63 @@ ], "today_in_history_posts": [ { - "id": "013275", - "title": "[BIP Proposal] Buried Deployments", - "link": "https://gnusha.org/url/https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2016-November/013275.html", + "id": "019603", + "title": "Mock introducing vulnerability in important Bitcoin projects", + "link": "https://gnusha.org/url/https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2021-November/019603.html", "authors": [ - "Suhas Daftuar" + "Prayank" ], - "published_at": "2016-11-14T18:17:25+00:00", - "summary": "- Bitcoin Core has simplified consensus rules for BIPs 34, 66, and 65.\n- The simplification was documented in a BIP, focusing on historical activation.\n- Now, enforcement is based on caching block heights, not miner signaling.", - "n_threads": 23, + "published_at": "2021-11-18T20:29:24+00:00", + "summary": "- The email outlines the importance of a routinely checked review process in Bitcoin projects.\n- It mentions an exercise to test review processes on Bitcoin Core, LND, and Bisq by introducing vulnerabilities.\n- The goal is to enhance security by publicly announcing caught vulnerabilities or privately addressing failures.", + "n_threads": 13, "dev_name": "bitcoin-dev", "contributors": [ - "Eric Voskuil", - "Alex Morcos", - "Jorge Tim\u00f3n", - "Pieter Wuille", - "Btc Drak", - "Jameson Lopp", + "ZmnSCPxj", + "Anthony Towns", "Luke Dashjr", - "Peter Todd", - "Thomas Kerin", - "Tier Nolan", - "Tom Zander" + "Manuel Costa", + "Ruben Somsen", + "Ryan Grant" ], - "file_path": "static/bitcoin-dev/Nov_2016/013275_-BIP-Proposal-Buried-Deployments.xml", - "combined_summ_file_path": "static/bitcoin-dev/Nov_2016/combined_-BIP-Proposal-Buried-Deployments.xml" + "file_path": "static/bitcoin-dev/Nov_2021/019603_Mock-introducing-vulnerability-in-important-Bitcoin-projects.xml", + "combined_summ_file_path": "static/bitcoin-dev/Nov_2021/combined_Mock-introducing-vulnerability-in-important-Bitcoin-projects.xml" }, { - "id": "000652", - "title": "LN without SegWit: less efficient or less secure?", - "link": "https://gnusha.org/url/https://lists.linuxfoundation.org/pipermail/lightning-dev/2017-January/000652.html", + "id": "003354", + "title": "INTEROPERABILITY", + "link": "https://gnusha.org/url/https://lists.linuxfoundation.org/pipermail/lightning-dev/2021-November/003354.html", "authors": [ - "Andr\u00e9s G. Aragoneses" + "x raid" ], - "published_at": "2017-01-14T10:17:40+00:00", - "summary": "- The writer inquires about SegWit's effect on Lightning Network and its levels.\n- Concerns were raised about level 2's security and efficiency compared to level 3.\n- The writer questions if outsourcing channel monitoring could solve level 2's security issues.", - "n_threads": 9, + "published_at": "2021-11-23T09:15:30+00:00", + "summary": "- The proposal introduces a decentralized integration lab for Lightning Network implementations.\n- Different implementations will have their own \"box\" setups with interconnected channels for testing.\n- This effort ensures thorough pre-release testing critical to the Lightning Network's success.", + "n_threads": 12, "dev_name": "lightning-dev", "contributors": [ - "Anthony Towns", + "ZmnSCPxj", "Christian Decker", - "Rusty Russell", - "Stefano Pepe" + "Pierre" ], - "file_path": "static/lightning-dev/Jan_2017/000652_LN-without-SegWit-less-efficient-or-less-secure-.xml", - "combined_summ_file_path": "static/lightning-dev/Jan_2017/combined_LN-without-SegWit-less-efficient-or-less-secure-.xml" + "file_path": "static/lightning-dev/Nov_2021/003354_INTEROPERABILITY.xml", + "combined_summ_file_path": "static/lightning-dev/Nov_2021/combined_INTEROPERABILITY.xml" }, { - "id": "448", - "title": "Differential Fuzzing of Bitcoin implementations", - "link": "https://delvingbitcoin.org/t/differential-fuzzing-of-bitcoin-implementations/208", + "id": "432", + "title": "Linearization post-processing (O(n^2) fancy chunking)", + "link": "https://delvingbitcoin.org/t/linearization-post-processing-o-n-2-fancy-chunking/201", "authors": [ - "bruno" + "sipa" ], - "published_at": "2023-11-18T15:06:59.397000+00:00", - "summary": "- The project focuses on differential fuzzing of Bitcoin implementations, especially miniscript.\n- It targets Core's and rust-miniscript, seeking community feedback to improve fuzzing strategies.\n- The effort encourages contributions on GitHub to boost Bitcoin technology's security and reliability.", - "n_threads": 6, + "published_at": "2023-11-18T19:11:20.969000+00:00", + "summary": "- Cluster processing starts with a linearization algorithm to organize transactions efficiently.\n- An improved chunking algorithm proposing up to $\\frac{n(n-1)}{2}$ swaps enhances processing efficiency.\n- This advanced algorithm offers flexibility by functioning both as a chunking and post-linearization tool.", + "n_threads": 7, "dev_name": "delvingbitcoin", "contributors": [ - "sipa" + "ajtowns", + "Greg Sanders" ], - "file_path": "static/delvingbitcoin/Nov_2023/448_Differential-Fuzzing-of-Bitcoin-implementations.xml", - "combined_summ_file_path": "static/delvingbitcoin/Nov_2023/combined_Differential-Fuzzing-of-Bitcoin-implementations.xml" + "file_path": "static/delvingbitcoin/Nov_2023/432_Linearization-post-processing-O-n-2-fancy-chunking-.xml", + "combined_summ_file_path": "static/delvingbitcoin/Nov_2023/combined_Linearization-post-processing-O-n-2-fancy-chunking-.xml" } ] } \ No newline at end of file diff --git a/static/homepage/Nov_2024/2024-11-15-homepage.json b/static/homepage/Nov_2024/2024-11-15-homepage.json new file mode 100644 index 000000000..7ed94c963 --- /dev/null +++ b/static/homepage/Nov_2024/2024-11-15-homepage.json @@ -0,0 +1,258 @@ +{ + "header_summary": "A new opcode, `OP_PAIRCOMMIT`, is proposed for tapscript to enhance Lightning Network (LN) symmetry and efficiency, representing an alternative to the `CAT` opcode. Its introduction is aimed at optimizing rebindable channels through efficient hash computations, detailed in the proposal by moonsettler et al. in a [GitHub gist](https://gist.github.com/moonsettler/d7f1fb88e3e54ee7ecb6d69ff126433b) and submitted as a pull request to the [bitcoin/bips repository](https://github.com/bitcoin/bips).\n\nBrandon Black discusses the implications of including the `CHECKSIGFROMSTACKVERIFY` (CSFSV) opcode in pre-tapscript Bitcoin versions, emphasizing the debate over its necessity and potential to enhance script functionality. This debate highlights the broader conversation within the community on optimizing Bitcoin's scripting capabilities through strategic opcode additions, as seen in the discussions hosted on [gnusha.org](https://gnusha.org/pi/bitcoindev/ZzZziZOy4IrTNbNG@console/T/#u#mfe9c974e575666fb49b475a9d6fa184bf8f55ab1).\n\nBitcoin Improvement Proposals (BIPs) 118, 119, and 347 mark significant advancements in scripting, with `SIGHASH_ANYPREVOUT`, `OP_CHECKTEMPLATEVERIFY` (CTV), and `OP_CAT` activation demonstrating varied applications from enhancing transaction flexibility to enabling complex spend conditions. The analysis by ajtowns on signet transactions reveals strategic use cases and experimentation within the ecosystem, suggesting a vibrant exploration of Bitcoin's scripting potential as detailed in [delvingbitcoin.org](https://delvingbitcoin.org/t/ctv-apo-cat-activity-on-signet/1257).\n\nZmnSCPxj and ajtowns bring to light the evolving discussion on channel factory monitoring and the innovative use of WOTS+ (Winternitz One-Time Signature Plus) in Bitcoin transactions. These discussions underscore the ongoing efforts to refine off-chain channel mechanisms and explore advanced scripting functionalities, showcasing the community's commitment to leveraging Bitcoin's underlying technology for improved scalability and security, as shared on [delvingbitcoin.org](https://delvingbitcoin.org/t/pluggable-channel-factories/1252/3) and [another page](https://delvingbitcoin.org/t/winternitz-one-time-signatures-contrasting-between-lisp-and-script/1255).", + "recent_posts": [ + { + "id": "m53078da2568e93a70d05c6be71ec0951c3a5786f", + "title": "OP_PAIRCOMMIT", + "link": "https://gnusha.org/pi/bitcoindev/xyv6XTAFIPmbG1yvB0l2N3c9sWAt6lDTG-xjIbogOZ-lc9RfsFeJ-JPuXuXKzVea8T9TztlCvSrxZOWXKCwogCy9tqa49l3LXjF5K2cLtP4=@protonmail.com/T/#u#m53078da2568e93a70d05c6be71ec0951c3a5786f", + "authors": [ + "moonsettler" + ], + "published_at": "2024-11-15T00:00:00+00:00", + "summary": "- A new opcode, `OP_PAIRCOMMIT`, is proposed for tapscript to enhance LN-Symmetry.\n- It aims to reduce SHA256 iterations in unilateral closes by using a specific sequence of operations.\n- The proposal, supported by several contributors, is detailed in a GitHub gist and seeks further community input.", + "n_threads": 0, + "dev_name": "bitcoin-dev", + "contributors": [], + "file_path": "static/bitcoin-dev/Nov_2024/m53078da2568e93a70d05c6be71ec0951c3a5786f_OP-PAIRCOMMIT.xml", + "combined_summ_file_path": "" + }, + { + "id": "mfe9c974e575666fb49b475a9d6fa184bf8f55ab1", + "title": "CHECKSIGFROMSTACK(VERIFY/ADD)", + "link": "https://gnusha.org/pi/bitcoindev/ZzZziZOy4IrTNbNG@console/T/#u#mfe9c974e575666fb49b475a9d6fa184bf8f55ab1", + "authors": [ + "Brandon Black" + ], + "published_at": "2024-11-14T22:02:00+00:00", + "summary": "- Discussions on CSFS BIP highlight debate over including CSFSV in pre-tapscript versions.\n- Debate extends to adding CSFSA, potentially easing script multisigs and reducing weight units.\n- Brandon Black seeks community feedback to fine-tune BIP and CSFS(V/A) implementations.", + "n_threads": 0, + "dev_name": "bitcoin-dev", + "contributors": [], + "file_path": "static/bitcoin-dev/Nov_2024/mfe9c974e575666fb49b475a9d6fa184bf8f55ab1_CHECKSIGFROMSTACK-VERIFY-ADD-.xml", + "combined_summ_file_path": "" + }, + { + "id": "3521", + "title": "CTV, APO, CAT activity on signet", + "link": "https://delvingbitcoin.org/t/ctv-apo-cat-activity-on-signet/1257", + "authors": [ + "ajtowns" + ], + "published_at": "2024-11-14T17:34:11.568000+00:00", + "summary": "- BIPs 118, 119, and 347 have brought advanced changes to Bitcoin scripting.\n- Key observations include APO's use in transactions and CTV's application for secure vaults.\n- OP_CAT's adoption exceeds APO and CTV, showing significant utility in Bitcoin contracts.", + "n_threads": 0, + "dev_name": "delvingbitcoin", + "contributors": [], + "file_path": "static/delvingbitcoin/Nov_2024/3521_CTV-APO-CAT-activity-on-signet.xml", + "combined_summ_file_path": "" + }, + { + "id": "3515", + "title": "Pluggable Channel Factories", + "link": "https://delvingbitcoin.org/t/pluggable-channel-factories/1252/3", + "authors": [ + "ZmnSCPxj" + ], + "published_at": "2024-11-14T15:04:03.807000+00:00", + "summary": "- Implementing a monitoring mechanism in plugin software for blockchain channel exits is emphasized.\n- It mentions the need for foundational gossip protocol adjustments before enhancing factory-hosted channels.\n- Introduces \"sidepools\" as a hybrid approach to improve liquidity management and channel efficiency.", + "n_threads": 2, + "dev_name": "delvingbitcoin", + "contributors": [ + "renepickhardt" + ], + "file_path": "static/delvingbitcoin/Nov_2024/3515_Pluggable-Channel-Factories.xml", + "combined_summ_file_path": "static/delvingbitcoin/Nov_2024/combined_Pluggable-Channel-Factories.xml" + }, + { + "id": "3512", + "title": "Winternitz One Time Signatures, contrasting between Lisp and Script", + "link": "https://delvingbitcoin.org/t/winternitz-one-time-signatures-contrasting-between-lisp-and-script/1255", + "authors": [ + "ajtowns" + ], + "published_at": "2024-11-13T08:07:02.515000+00:00", + "summary": "- Jonas Nick showcased WOTS+ application in Bitcoin transactions using expanded script opcodes.\n- Critical discussion on Bitcoin script's limitations in handling loops and structured data.\n- WOTS+ implementation suggests improvements for Bitcoin's scripting capabilities and efficiency.", + "n_threads": 0, + "dev_name": "delvingbitcoin", + "contributors": [], + "file_path": "static/delvingbitcoin/Nov_2024/3512_Winternitz-One-Time-Signatures-contrasting-between-Lisp-and-Script.xml", + "combined_summ_file_path": "" + } + ], + "active_posts": [ + { + "id": "m22239cd0ba6fec6bb835522be315d50496fefa1c", + "title": "ColliderScript: Covenants in Bitcoin via 160-bit hash collisions", + "link": "https://gnusha.org/pi/bitcoindev/CAEM=y+W2jyFoJAq9XrE9whQ7EZG4HRST01TucWHJtBhQiRTSNQ@mail.gmail.com/T/#u#m22239cd0ba6fec6bb835522be315d50496fefa1c", + "authors": [ + "Ethan Heilman" + ], + "published_at": "2024-11-07T17:44:00+00:00", + "summary": "- The team introduces a novel Bitcoin covenant creation method, avoiding soft forks via Tapscript.\n- This method's spending process is computationally intense, requiring resources akin to 33 hours of Bitcoin network activity.\n- It enables advanced transactions like quantum-resistant Lamport signatures within Bitcoin's 4MB limit, expanding scripting capabilities.", + "n_threads": 2, + "dev_name": "bitcoin-dev", + "contributors": [ + "Antoine Riard" + ], + "file_path": "static/bitcoin-dev/Nov_2024/m22239cd0ba6fec6bb835522be315d50496fefa1c_ColliderScript-Covenants-in-Bitcoin-via-160-bit-hash-collisions.xml", + "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_ColliderScript-Covenants-in-Bitcoin-via-160-bit-hash-collisions.xml" + }, + { + "id": "mf020da837a496d9f1d33bfe338dc2edb6f5468cb", + "title": "Broken links to the previous mailing list archive", + "link": "https://gnusha.org/pi/bitcoindev/CABaSBaz13bUoHCupXYhmX+yS0dn89f80yx8ZD3uO5-1RiLZJCQ@mail.gmail.com/T/#u#mf020da837a496d9f1d33bfe338dc2edb6f5468cb", + "authors": [ + "Bryan Bishop" + ], + "published_at": "2024-11-12T19:54:00+00:00", + "summary": "- The Linux Foundation halted hosting bitcoin-dev HTML email archives, breaking many links.\n- Gnusha.org's redirect service and a GitHub Python script offer solutions for accessing old content.\n- These efforts highlight the community's commitment to preserving Bitcoin's historical records.", + "n_threads": 2, + "dev_name": "bitcoin-dev", + "contributors": [ + "Andrew Poelstra", + "Weikeng Chen" + ], + "file_path": "static/bitcoin-dev/Nov_2024/mf020da837a496d9f1d33bfe338dc2edb6f5468cb_Broken-links-to-the-previous-mailing-list-archive.xml", + "combined_summ_file_path": "static/bitcoin-dev/Nov_2024/combined_Broken-links-to-the-previous-mailing-list-archive.xml" + }, + { + "id": "mbf2be36cc056f66fddd8e59f0794a9680716982f", + "title": "BIP 21 Updates", + "link": "https://gnusha.org/pi/bitcoindev/93c14d4f-10f3-48af-9756-7e39d61ba3d4@mattcorallo.com/T/#u#mbf2be36cc056f66fddd8e59f0794a9680716982f", + "authors": [ + "Matt Corallo" + ], + "published_at": "2024-05-30T21:54:00+00:00", + "summary": "- The email discusses updating BIP 21 for modern Bitcoin payments, including Segwit and Taproot.\n- It acknowledges the use of Silent Payments and BOLT 12, suggesting BIP 21 could embed additional instructions.\n- A change proposal for BIP 21 aims to document current payment methods while ensuring backwards compatibility.", + "n_threads": 1, + "dev_name": "bitcoin-dev", + "contributors": [], + "file_path": "static/bitcoin-dev/May_2024/mbf2be36cc056f66fddd8e59f0794a9680716982f_BIP-21-Updates.xml", + "combined_summ_file_path": "static/bitcoin-dev/May_2024/combined_BIP-21-Updates.xml" + }, + { + "id": "1996", + "title": "Great Consensus Cleanup Revival", + "link": "https://delvingbitcoin.org/t/great-consensus-cleanup-revival/710", + "authors": [ + "AntoineP" + ], + "published_at": "2024-03-24T19:53:27.073000+00:00", + "summary": "- The Great Consensus Cleanup targets Bitcoin's vulnerabilities, aiming to improve security and performance.\n- It proposes adjustments to mining mechanisms and transaction constraints to protect network integrity.\n- Community debate surrounds the block size reduction's impact on scalability and efficiency.", + "n_threads": 49, + "dev_name": "delvingbitcoin", + "contributors": [ + "ajtowns", + "evoskuil", + "David Harding", + "sjors", + "MattCorallo", + "recent798", + "1440000bytes", + "ariard", + "benthecarman", + "kcalvinalvin", + "plebhash" + ], + "file_path": "static/delvingbitcoin/March_2024/1996_Great-Consensus-Cleanup-Revival.xml", + "combined_summ_file_path": "static/delvingbitcoin/March_2024/combined_Great-Consensus-Cleanup-Revival.xml" + }, + { + "id": "3457", + "title": "A Fast, Scalable Protocol For Resolving Lightning Payments", + "link": "https://delvingbitcoin.org/t/a-fast-scalable-protocol-for-resolving-lightning-payments/1233", + "authors": [ + "JohnLaw" + ], + "published_at": "2024-10-31T22:50:15.637000+00:00", + "summary": "- The OPR protocol enhances Lightning network payments, ensuring quick resolution without on-chain transactions.\n- It introduces a burn output mechanism to deter dishonest behavior and improve system trust.\n- The protocol aims to increase scalability and security, offering solutions for operational risks and node failures.", + "n_threads": 9, + "dev_name": "delvingbitcoin", + "contributors": [ + "harding", + "morehouse" + ], + "file_path": "static/delvingbitcoin/Oct_2024/3457_A-Fast-Scalable-Protocol-For-Resolving-Lightning-Payments.xml", + "combined_summ_file_path": "static/delvingbitcoin/Oct_2024/combined_A-Fast-Scalable-Protocol-For-Resolving-Lightning-Payments.xml" + }, + { + "id": "3185", + "title": "Privately sending payments while offline with BOLT12", + "link": "https://delvingbitcoin.org/t/privately-sending-payments-while-offline-with-bolt12/1134", + "authors": [ + "andyschroder" + ], + "published_at": "2024-09-14T07:01:38.506000+00:00", + "summary": "- The concept allows secure, efficient payments without direct internet on the device using pre-computed IDs.\n- Transactions proceed with the seller's internet-connected point of sale issuing a BOLT12 offer, ensuring privacy.\n- A proposed BOLT12 adjustment enhances security by verifying invoice authenticity, reducing computational load on nodes.", + "n_threads": 5, + "dev_name": "delvingbitcoin", + "contributors": [ + "ZmnSCPxj", + "t-bast" + ], + "file_path": "static/delvingbitcoin/Sept_2024/3185_Privately-sending-payments-while-offline-with-BOLT12.xml", + "combined_summ_file_path": "static/delvingbitcoin/Sept_2024/combined_Privately-sending-payments-while-offline-with-BOLT12.xml" + } + ], + "today_in_history_posts": [ + { + "id": "019603", + "title": "Mock introducing vulnerability in important Bitcoin projects", + "link": "https://gnusha.org/url/https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2021-November/019603.html", + "authors": [ + "Prayank" + ], + "published_at": "2021-11-18T20:29:24+00:00", + "summary": "- The email outlines the importance of a routinely checked review process in Bitcoin projects.\n- It mentions an exercise to test review processes on Bitcoin Core, LND, and Bisq by introducing vulnerabilities.\n- The goal is to enhance security by publicly announcing caught vulnerabilities or privately addressing failures.", + "n_threads": 13, + "dev_name": "bitcoin-dev", + "contributors": [ + "ZmnSCPxj", + "Anthony Towns", + "Luke Dashjr", + "Manuel Costa", + "Ruben Somsen", + "Ryan Grant" + ], + "file_path": "static/bitcoin-dev/Nov_2021/019603_Mock-introducing-vulnerability-in-important-Bitcoin-projects.xml", + "combined_summ_file_path": "static/bitcoin-dev/Nov_2021/combined_Mock-introducing-vulnerability-in-important-Bitcoin-projects.xml" + }, + { + "id": "003354", + "title": "INTEROPERABILITY", + "link": "https://gnusha.org/url/https://lists.linuxfoundation.org/pipermail/lightning-dev/2021-November/003354.html", + "authors": [ + "x raid" + ], + "published_at": "2021-11-23T09:15:30+00:00", + "summary": "- The proposal introduces a decentralized integration lab for Lightning Network implementations.\n- Different implementations will have their own \"box\" setups with interconnected channels for testing.\n- This effort ensures thorough pre-release testing critical to the Lightning Network's success.", + "n_threads": 12, + "dev_name": "lightning-dev", + "contributors": [ + "ZmnSCPxj", + "Christian Decker", + "Pierre" + ], + "file_path": "static/lightning-dev/Nov_2021/003354_INTEROPERABILITY.xml", + "combined_summ_file_path": "static/lightning-dev/Nov_2021/combined_INTEROPERABILITY.xml" + }, + { + "id": "432", + "title": "Linearization post-processing (O(n^2) fancy chunking)", + "link": "https://delvingbitcoin.org/t/linearization-post-processing-o-n-2-fancy-chunking/201", + "authors": [ + "sipa" + ], + "published_at": "2023-11-18T19:11:20.969000+00:00", + "summary": "- Cluster processing starts with a linearization algorithm to organize transactions efficiently.\n- An improved chunking algorithm proposing up to $\\frac{n(n-1)}{2}$ swaps enhances processing efficiency.\n- This advanced algorithm offers flexibility by functioning both as a chunking and post-linearization tool.", + "n_threads": 7, + "dev_name": "delvingbitcoin", + "contributors": [ + "ajtowns", + "Greg Sanders" + ], + "file_path": "static/delvingbitcoin/Nov_2023/432_Linearization-post-processing-O-n-2-fancy-chunking-.xml", + "combined_summ_file_path": "static/delvingbitcoin/Nov_2023/combined_Linearization-post-processing-O-n-2-fancy-chunking-.xml" + } + ] +} \ No newline at end of file