Repository navigation
Bump flake-parts from 024633c to ea2630b - #1
Open
dependabot[bot] wants to merge 108 commits into
Open
dependabot[bot] wants to merge 108 commits into
dependabot[bot] wants to merge 108 commits into
Conversation
yuval-block
force-pushed
the
main
branch
10 times, most recently
from
October 26, 2026 05:05
1ee57d1 to
8e41ba2
Compare
Co-authored-by: bc1cindy <bc1cindy@proton.me> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The notebook package re-executes the notebook. Execution is deterministic and records no timing metadata, so re-rendering the notebook amounts to copying the build output over it, and a notebook that is already up to date comes back byte-identical. Only editing or executing the notebook needs the scientific python stack, so it stays out of the default shell and the site build. The notebook devshell has the same dependencies as the derivation, plus jupyterlab, whose checkpoint directories are ignored. Every dependency is packaged in nixpkgs, so no uv2nix layer is required. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The saved plots came from Colab, whose environment is not recorded anywhere. Re-executing with the notebook derivation reproduces the same data (the denominations table is unchanged), and the result is a fixed point: building again from the re-rendered notebook leaves it byte-identical. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The last chart counted n^k ordered selections, which overstates the number of size k combinations with replacement from n denominations, (n+k-1 choose k), by orders of magnitude: 30,840,979,456 versus 55,525,372 for k=6. With the correct count the combinations stay below the number of distinct integers in the range for every k. The density axis was scaled by an invisible scatter of the densities, which only lined up with the count axis while the combinations curve set the top of the plot. Derive its limits from the count axis instead. The output is rendered by the notebook derivation. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Split the long conditional sentences, say what Hamming weight 1 means for the denominations in use, and state what the notebook measures before the asymptotic claim about the size of the denomination set. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The sumsets draw k values from the denominations and 0, so they hold the sums of every combination of size at most k. Count those combinations the same way, (n+k choose k) less the empty combination, which makes the two curves agree at k=1. The counted combinations are not limited by their sum, so title the chart by the denominations they are drawn from and attach the range to the distinct sums and integers instead. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The quantile levels are i/20, so the median is i == 10. Skipping i == 5 dropped the first quartile and drew dots under the median markers. Name the number of quantile levels and derive the median's index and the legend's percentile step from it, so they cannot disagree again. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
It introduces the two chapters that evaluate a pure strategy: the structure of the cost function, and its privacy liability terms. It replaces the chapter's review stub. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Tactics generates the decision tree that pure strategy evaluation scores. It covers the wallet state it starts from, the tree it produces, and when to re-evaluate it. The bottom-up construction is a chapter of its own. It replaces the chapter's review stub. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Say which property permutations of equal values preserve and why permutations within a sub-transaction yield no new mappings, name the fee rates whose variance makes k:1 exchanges asymmetric, and use m for multiplicity so that k only ever means combination size. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Improve the introduction, define sub-transaction balance, clarify wallet fingerprint distributions, social graph partitioning and related payments in CoinJoins, and fix typos. Use "topological" rather than "structural" for features of the graph shape, to avoid confusion with features related to transaction structure. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…nditions The conditions under "Coalition formation proposal structure" cover consensus fields, the feerate, the vbytes allocation, and input and output types, but say nothing about the values of inputs. Two kinds of value constraint came up in the review of `cost_function.md` (fungi-protocol/docs#15), whose multiparty section lists the constraints parties must agree on before accepting a proposal: - Nominal values: a required multiplicity of each of a set of standard denominations. These must be specified in terms of prevout values, since effective values also depend on the feerate. Checking them involves no search, so they need no certificate. - Effective values: these determine subset sum densities, and satisfying constraints on them involves a search, so they take the form of a challenge for a subset sum density certificate. The challenge is a target interval and a density requirement ρ. The aggregator picks a concrete feerate within the agreed feerate interval, and responds with ρ pairwise disjoint subsets of all the aggregated inputs whose effective values at that feerate each sum to within the interval, which every party can check before signing just by summing. --- - [x] Add per-denomination multiplicity constraints to the conditions - [x] Add subset sum density challenges to the conditions - [x] Specify the certificate: when the aggregator responds, at which feerate effective values are computed (the concrete feerate the aggregator picks), and how parties check it before signing - [x] Decide whether a challenge can leak which outputs belong to the party posing it - [ ] Link from `cost_function.md` once both are merged --- Notes: - Multiplicities fit the existing numerical intervals under intersection: one interval per denomination, counting the inputs whose prevout value equals it. - Challenges combine by union, since every challenge must still be met. Unlike the intervals, an unsatisfiable combination can't be detected when proposals are aggregated, only when the aggregator fails to produce a certificate. - Unlike the range proofs under "Effective value adjustments", which compute minimal effective values at the highest acceptable feerate, certificates use the concrete feerate the aggregator picks. - If a challenge's interval brackets one of the challenger's own outputs, attaching it to the challenger's proposal may tell peers which output is theirs. Avoiding such leaks is up to the cost function, and only randomly placed narrow intervals, which serve as density estimates, are recommended. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Summarizes each privacy liability term of the cost function: randomization, Sybil resistance, subset sum ambiguity, counterfactual paths, consolidation and siblings, and UTXO pool diversity, which is still open. Each term is specified in its own chapter, and this one says how each behaves in the decision tree. It replaces the chapter's review stub. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Build broadcast to a group or to the world by gossip over peer to peer channels: broadcast domains, neighbor and submission channels, the announce, pull and push messages, anonymous submission, synchronization of the session's message set, dissemination methods and topology. Developed from the peer-messages notes (onwloqro, 1f68a962). Links to the optimistic track and set reconciliation chapters resolve once those follow in this series. It replaces the chapter's review stub. Links to other chapters resolve against their stubs until those land. Co-authored-by: GPT-6.1 Sol <noreply@openai.com> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This includes a high level description of the various components of the protocol suite, focusing on the transaction construction. Unlike the strawman ladder it replaced (previously described as an overview, and now somewhat out of date at any rate) it is scoped to only discuss actual things not strawman constructions which only benefit exposition, to avoid confusion about what is actually being implemented. Closes #21
Two additions to the overview: a paragraph pointing at the channel interfaces, and one relating per-peer trust assumptions to asymmetric distributed trust and Flexible BFT. Kept apart from the overview itself (PR 51) so it can be reviewed on its own. Co-authored-by: GPT-6.1 Sol <noreply@openai.com> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Merge each protocol chapter's bookmark, and the overview with its transport edits, over the book structure and its review stubs. Each chapter replaces only its own stub, so the merge has no conflicts. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The book is assembled from docs/ by contrib/book.py, which only took markdown pages as chapters. Take Jupyter notebooks too. A notebook's frontmatter is a raw cell that opens it, holding what a markdown page's frontmatter would. It is checked, and dropped from the notebook the book is given, as a markdown page's is. Jupyter's autosaves under .ipynb_checkpoints/ are neither chapters nor copied. List the radix CoinJoin notebook in the index, under a new Drafts part, in place of the SUMMARY.md entry it had before the book was assembled from docs/. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
mdbook rewrites links to `.md` chapters into links to their `.html` pages, and into in-page anchors on the print page, but leaves links to `.ipynb` chapters as they are, so they lead to the raw notebook, which isn't part of the built site. After rendering the notebooks, the preprocessor points every relative link that resolves to a notebook chapter at the chapter's `.md` path, so mdbook rewrites it like any other chapter link. Links to other `.ipynb` files, and absolute ones, are left alone. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
mdbook lists separators as the bare string "Separator" and part titles
as {"PartTitle": ...}, and the jupyter preprocessor called .get on every
item, so a book with a separator stopped the build. It now only
descends into chapters.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
mdbook loads additional-js on print.html as well, so the printed book kept only the first page of each table and showed dead page buttons. Showing every row widens the table past the page, because the later rows hold the longest values, so print also tightens font and padding.
The global text colour is a mid grey chosen to read on the page, but these labels sit on the bars, where grey has almost no contrast. They go back to black, as they were before the plot style was added.
With a transparent figure the darkest plasma fills sit directly on the page, and on the dark themes they nearly vanish into it. A grey outline per series keeps each silhouette visible on either theme.
The plot style turns legend frames off and makes their labels grey. Over the dust band of this plot that left the labels unreadable on dark pages, so this legend gets back its white frame and black labels.
With the notebook's own parameters the k=6 sumset still has gaps larger than the dust threshold, including below max_denom, so describe how coverage varies across the range instead. Suggested-by: bc1cindy <bc1cindy@proton.me> Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
powers() dropped every power below min_denom before multiples() scaled them, so the multiples of those powers that do reach min_denom were missing: 2 × 3^5 = 486 and 5 × 10^2 = 500. multiples() already keeps only the values in the denomination range, so powers() now starts at the zeroth power. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The quantiles of the k=6 sumset start with several that are entirely gaps of size 1, but the plot omits gaps of size 1 (min_diff = 2), so its quantiles plateau at 2 and then at 3. The text described the sumset as if it were the plot. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
A sum above c times max_denom does not need c copies of the largest denomination: 100000000 + 86093442 + 20000000 exceeds the cutoff at c = 2 with one. Since no term exceeds max_denom, it needs more than c terms, which is what leaves it fewer free terms. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The paragraph defines the implied fee rate as the nominal input sum minus the output sum, over the weight. A k:1 exchange keeps the nominal sums, so the difference it makes is to the weight, and therefore to the implied fee rate. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
A sub-transaction that uses every copy of a denomination leaves the remaining coins without it, and they may no longer be dense. The argument holds when the multiplicities are high enough that no single sub-transaction does that. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Tag the parameter cells and the cells that build the binary, ternary and decimal sets and their union with show-input, so the rendered chapter gives the code that generates the denominations. The plotting, sumset and gap cells stay hidden. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Tag the cells that compute the sumsets, the gaps and the relative gaps with show-input. The plotting cells stay hidden. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The gap code shown in the chapter filters by min_diff and min_diff_ratio, so tag the cell that sets them with show-input. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The draft is published from its own repository, fungi-protocol/docs-draft, so that nothing has to be merged into main for it to go live. Its Pages site is served from /docs-draft/, not /docs/. Point the 404 page's base and the link check at that path. The Pages workflow is unchanged: it deploys on a push to that repository's main, which is this commit. This commit belongs on draft only. It never goes to main. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Bumps [flake-parts](https://github.com/hercules-ci/flake-parts) from `024633c` to `ea2630b`. - [Commits](hercules-ci/flake-parts@024633c...ea2630b) --- updated-dependencies: - dependency-name: flake-parts dependency-version: 024633cd702b10285db5cb19b40ad48d2399ba60 dependency-type: direct:production ... Signed-off-by: dependabot[bot] <support@github.com>
31729ca to 024633c024633c to ea2630b
dependabot
Bot
force-pushed
the
dependabot/nix/flake-parts-024633c
branch
from
November 10, 2026 18:04
f53caef to
8b65819
Compare
range-diff for force push f53caef4c0 → 8b65819303
|
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Bumps flake-parts from
024633ctoea2630b.Commits
ea2630bMerge pull request #380 from hercules-ci/flake-updated26f978dev/flake.lock: Update5bc9fbcflake.lock: Update