Skip to content

Bump nixpkgs from 08d3a97 to c56a87d - #2

Open
dependabot[bot] wants to merge 108 commits into
mainfrom
dependabot/nix/nixpkgs-cd4ea8d
Open

dependabot[bot] wants to merge 108 commits into
mainfrom
dependabot/nix/nixpkgs-cd4ea8d

Conversation

@dependabot

@dependabot dependabot Bot commented on behalf of github Oct 23, 2026 •

Copy link
Copy Markdown
Contributor

Bumps nixpkgs from 08d3a97 to c56a87d.

Commits
  • c56a87d [Backport release-26.05] keepassxc: __structuredAttrs and split outputs (#5...
  • d9e5cdf keepassxc: split doc & man outputs
  • d2347fa keepasscx: __structuredAttrs
  • 7e382b0 [Backport release-26.05] xen: patch with XSA-523 (#583496)
  • 02ac549 xen: patch with XSA-523
  • 16c1a07 [Backport release-26.05] keepassxc: 2.7.12 -> 2.8.0, add chromium native mess...
  • 8f8c5ee [Backport release-26.05] eza: 0.23.4 -> 0.23.5 (#582825)
  • f7e8043 [Backport release-26.05] chromium,chromedriver: 156.0.8078.79 -> 157.0.8103.3...
  • 786d085 [Backport release-26.05] sniproxy: 0.24.2 -> 0.25.0 (#583242)
  • 05ce852 sniproxy: 0.24.2 -> 0.25.0
  • Additional commits viewable in compare view

@dependabot dependabot Bot added dependencies Pull requests that update a dependency file nix Pull requests that update nix code labels Oct 23, 2026
@yuval-block
yuval-block force-pushed the main branch 10 times, most recently from 1ee57d1 to 8e41ba2 Compare October 26, 2026 05:05
@dependabot @github

dependabot Bot commented on behalf of github Nov 1, 2026

Copy link
Copy Markdown
Contributor Author

A newer version of nixpkgs exists, but since this PR has been edited by someone other than Dependabot I haven't updated it. You'll get a PR for the updated version as normal once this PR is merged.

nothingmuch and others added 17 commits November 10, 2026 02:00
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>
nothingmuch and others added 24 commits November 10, 2026 02:00
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 [nixpkgs](https://github.com/NixOS/nixpkgs) from `08d3a97` to `c56a87d`.
- [Commits](NixOS/nixpkgs@08d3a97...c56a87d)

---
updated-dependencies:
- dependency-name: nixpkgs
  dependency-version: cd4ea8d57de16f4810bc5f14207bac45fbf19f67
  dependency-type: direct:production
...

Signed-off-by: dependabot[bot] <support@github.com>
@dependabot dependabot Bot changed the title Bump nixpkgs from cf5e765 to cd4ea8d Bump nixpkgs from 08d3a97 to c56a87d Nov 10, 2026
@dependabot
dependabot Bot force-pushed the dependabot/nix/nixpkgs-cd4ea8d branch from cfdb157 to 04f5014 Compare November 10, 2026 18:04
@github-actions

Copy link
Copy Markdown
range-diff for force push cfdb157560 → 04f501487c November 10, 2026 18:05 UTC: 111 dropped, 1 added

reproduce: git range-diff 5e034ba..cfdb157 caf9db3..04f5014

  1:  e8823d9851 <   -:  ---------- Concurrent PSBT spec
  2:  323149ce49 <   -:  ---------- Move the cost function framework stub to optimization_framework.md
  3:  608d4fa636 <   -:  ---------- Arrange the index into the parts proposed in #19
  4:  22f7e64f16 <   -:  ---------- Radix coinjoin denominations notebook
  5:  208e53a3b7 <   -:  ---------- add a notebook derivation and a devshell for editing the notebook
  6:  94555dd52f <   -:  ---------- re-render notebook outputs with the notebook derivation
  7:  700cfc616a <   -:  ---------- count combinations with replacement as multisets
  8:  3d060fed2f <   -:  ---------- clarify the notebook introduction
  9:  b4a35396b6 <   -:  ---------- count combinations of up to k denominations, as the sumsets do
 10:  89a495588a <   -:  ---------- skip the median, not the 25th percentile, among the quantile dots
 11:  dd43fd5cbb <   -:  ---------- clarify the sub-transaction counting argument
 12:  ef9510c581 <   -:  ---------- explain why sums are cut off above a multiple of max_denom
 13:  426bc746f6 <   -:  ---------- explain subset sum density as an invariant of the mapping
 14:  0fc163ee2b <   -:  ---------- render jupyter notebook chapters as mdbook pages: hide code, paginate tables
 15:  8d2c892096 <   -:  ---------- assemble notebook chapters from docs/
 16:  9750f8a491 <   -:  ---------- style plots: theme-neutral, colorblind-safe, re-rendered outputs
 17:  d676778681 <   -:  ---------- point links to notebook chapters at their rendered pages
 18:  cb3b434109 <   -:  ---------- Skip separators and part titles when walking the book's chapters
 19:  0d0d1f0a46 <   -:  ---------- nb-table: print every row of paginated tables
 20:  0460da2e30 <   -:  ---------- keep bar value labels black over the bar fills
 21:  34a824f328 <   -:  ---------- outline density series to read on dark pages
 22:  48208a1729 <   -:  ---------- restore the density plot's legend frame
 23:  d730034571 <   -:  ---------- [WIP] ████████████████░░░░ Describe concrete cost-function terms and decision tree
 24:  c181324dda <   -:  ---------- stop claiming six outputs close every gap above dust
 25:  959497aefc <   -:  ---------- [WIP] Order the concrete terms like the term chapters
 26:  dcebeccba4 <   -:  ---------- Keep the powers below the dust threshold until they are multiplied
 27:  6e21dfcdde <   -:  ---------- [WIP] Move decision tree construction into its own chapter
 28:  38bba5b5e9 <   -:  ---------- Say that the gap plot's k=6 quantiles start at 2, not 1
 29:  ab5891132a <   -:  ---------- [WIP] Bring tree construction from the abstract chapter into its own chapter
 30:  c9df81172d <   -:  ---------- Bound the terms of a sum above the cutoff by its size alone
 31:  d2843e4e64 <   -:  ---------- [WIP] Rename the decision tree construction chapter to strategy
 32:  224aeb3e4a <   -:  ---------- Define the on-chain privacy problems being addressed
 33:  8240f2aa0b <   -:  ---------- Say that a k:1 exchange changes the weight, not the fee
 34:  d8da629146 <   -:  ---------- [WIP] Refer to the abstract chapter for the tree level expectation
 35:  f632860e8c <   -:  ---------- Render math before mdbook-graphviz re-serializes the markdown
 36:  2cb810ef6e <   -:  ---------- Edits to Collaborative Transaction Privacy (#30)
 37:  69b3ea3249 <   -:  ---------- Qualify the density argument by the denominations that remain
 38:  cdb5996470 <   -:  ---------- [WIP] Refer to the optimization framework chapter by its new title
 39:  654d4d38b5 <   -:  ---------- [WIP] Add the randomized selection and Sybil resistance chapters
 40:  b3d9c67e9c <   -:  ---------- Revise and clarify following editorial pass
 41:  610bb04b85 <   -:  ---------- Show the denomination generating code in the book
 42:  bf039d8ecd <   -:  ---------- [WIP] Link the optimization framework chapter by its new file name
 43:  5f4499d5a8 <   -:  ---------- Link the optimization framework chapter by its new name
 44:  4094fe79bc <   -:  ---------- Move the problem definition into the mdbook
 45:  cd0283e0b3 <   -:  ---------- Show the sumset and gap computation code in the book
 46:  34b642c061 <   -:  ---------- Fix typos and a broken anchor in the concurrent PSBT spec
 47:  0cc90af0b5 <   -:  ---------- Abstract cost function
 48:  8dfef5123e <   -:  ---------- [WIP] Rename the Strategy chapter to Tactics
 49:  3a7f073114 <   -:  ---------- [WIP] Nest indented index entries as sub-chapters
 50:  09c4e6145f <   -:  ---------- [WIP] Mark agent-generated text in the randomized selection chapters with 🤖
 51:  c4d1d2bcc6 <   -:  ---------- Refer to the Radix CoinJoin Denominations chapter
 52:  d63f7f5abe <   -:  ---------- README do-over
 53:  beb76e9866 <   -:  ---------- Show the analysis parameters in the book
 54:  7b9c4eaa1d <   -:  ---------- Move the concurrent PSBT spec into the book
 55:  b2690822cb <   -:  ---------- [WIP] ████████████████████ Clarify abstract cost function
 56:  a0ca115431 <   -:  ---------- fixup! Abstract cost function
 57:  03426dd0b5 <   -:  ---------- [WIP] ████████████████████ Record decision tree construction notes
 58:  59427c1326 <   -:  ---------- [WIP] ████████████████░░░░ Describe how the decision tree is built
 59:  1db23a8765 <   -:  ---------- [WIP] Add the cost function's words to the spelling dictionary
 60:  8d4c7d61a5 <   -:  ---------- fixup! [WIP] ████████████████████ Clarify abstract cost function
 61:  0e5404df01 <   -:  ---------- fixup! Abstract cost function
 62:  9c33d4df11 <   -:  ---------- fixup! Abstract cost function
 63:  9c1eadc891 <   -:  ---------- fixup! Abstract cost function
 64:  9a3893fa0f <   -:  ---------- fixup! Abstract cost function
 65:  b74459a568 <   -:  ---------- [WIP] Order inputs before outputs within a batch
 66:  90f586774f <   -:  ---------- [WIP] Model time dependence as piecewise linear offsets
 67:  8582ecc593 <   -:  ---------- [WIP] Say what each end of the bracket means
 68:  703637d271 <   -:  ---------- [WIP] Distinguish the pure and mixed strategies
 69:  34ca4e8d9b <   -:  ---------- [WIP] Describe commitment in multiparty protocols
 70:  a919b72036 <   -:  ---------- [WIP] Rewrite the global privacy budget
 71:  1f536a34e7 <   -:  ---------- [WIP] ████████████████░░░░ Penalize co-spend proposals that leak a counterfactual path
 72:  e95b0364db <   -:  ---------- fixup! [WIP] ████████████████░░░░ Describe how the decision tree is built
 73:  2386f6de6b <   -:  ---------- fixup! [WIP] Say what each end of the bracket means
 74:  87b5746e46 <   -:  ---------- [WIP] ████████████████████ Describe the greedy decision loop
 75:  fe001d2e5c <   -:  ---------- [WIP] ████████████████████ Give the decision loop its own heading
 76:  6b153e49f4 <   -:  ---------- [WIP] ██████████████████░░ Move tree construction to the strategy chapter
 77:  ae64146ca2 <   -:  ---------- [WIP] ████████████████░░░░ Rename the chapter to Optimization framework
 78:  bed279097a <   -:  ---------- [WIP] ████████████████████ Introduce the strategy as generating and evaluating decisions
 79:  c8dd45fc6b <   -:  ---------- [WIP] Point the decision loop reference at the Mixed strategy chapter
 80:  31b7ca9fbd <   -:  ---------- [WIP] ████████████████░░░░ Move the mixed strategy into its own chapter
 81:  e399c788db <   -:  ---------- [WIP] Mark agent-generated text in Tactics and the concrete chapter with 🤖
 82:  c4315b54b9 <   -:  ---------- [WIP] ████████████████░░░░ Mark agent-generated text with 🤖
 83:  621f383787 <   -:  ---------- [WIP] Rename the concrete cost function chapter to Pure Strategy Evaluation
 84:  8d834d7719 <   -:  ---------- Coalition formation
 85:  bb326d3a04 <   -:  ---------- [WIP] Call the greedy loop a decision loop run as a greedy search
 86:  7448b7deef <   -:  ---------- [WIP] Describe Tactics by what it generates
 87:  01fae42ac2 <   -:  ---------- [WIP] ████████████████░░░░ Add input value constraints to proposal conditions
 88:  c8bc47c3e4 <   -:  ---------- [WIP] Move the cost function's structure into its own chapter
 89:  5b508e25c9 <   -:  ---------- [WIP] Add a Pure Strategy Evaluation page above the structure and the terms
 90:  822b2a18a6 <   -:  ---------- [WIP] Retitle the concrete cost function page Privacy liability terms
 91:  a8cf94e2f7 <   -:  ---------- [WIP] Refer to the term chapters by their new titles
 92:  6316ae9c92 <   -:  ---------- [WIP] Put the randomization and Sybil resistance terms first
 93:  de04c8b751 <   -:  ---------- Add an overview
 94:  33a4f918c9 <   -:  ---------- Link the optimization framework chapter by its new file name
 95:  a6aba0f888 <   -:  ---------- [WIP] Specify the abstract transport interfaces
 96:  bfb860c82f <   -:  ---------- [WIP] Specify peer and broadcast channels
 97:  5a82a00957 <   -:  ---------- [WIP] Specify peer set reconciliation
 98:  56fbd2817f <   -:  ---------- [WIP] Specify contacts, devices and discovery
 99:  a6557c765e <   -:  ---------- [WIP] Introduce transaction construction
100:  b24af076c6 <   -:  ---------- [WIP] Specify the optimistic track
101:  a39124e333 <   -:  ---------- [WIP] Specify the recovery track
102:  daf7e909cf <   -:  ---------- [WIP] Specify the allocation registration validity proofs
103:  779a402d73 <   -:  ---------- [WIP] Point the overview at the channel interfaces and asymmetric trust
104:  07804fac4b <   -:  ---------- [WIP] Specify the protocol messages
105:  25991d8052 <   -:  ---------- [WIP] Outline max flow based counterfactual path estimation
106:  ea5a62174a <   -:  ---------- [WIP] Outline subset sum density, subset sum ambiguity and the sibling output penalty
107:  467d0d17a5 <   -:  ---------- [WIP] Outline the consolidation penalty
108:  9d9d9b0e6c <   -:  ---------- Link the cost function term chapters
109:  b62de4fca6 <   -:  ---------- [WIP] Move bottom-up construction out of Tactics into its own chapter
110:  2aaa63f457 <   -:  ---------- [WIP] Serve the draft from /docs-draft/
111:  cfdb157560 <   -:  ---------- Bump nixpkgs from `cf5e765` to `cd4ea8d`
  -:  ---------- >   1:  04f501487c Bump nixpkgs from `08d3a97` to `c56a87d`

This branch has not been deployed

No deployments
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

dependencies Pull requests that update a dependency file nix Pull requests that update nix code

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants