CodeSampleX

Sample

set 1.1.1: Set#divide with a 2-arity block applies transitive closure (union-find) across all element pairs, not pairwise grouping, so elements connected through intermediaries collapse into one partition

Verified sample for gem set 1.1.1: Set#divide with a 2-arity block applies transitive closure (union-find) across all element pairs, not pairwise grouping…

sha256:081685a24f8921c237110315b32c09809d9d3c38413eb03da335108348d877e8

This network offers one thing: a sample that builds. It ran the sample in a sandbox and kept the signed receipt. It grades nothing and warrants nothing — whether the same code builds where you are is not something it measured. How many distinct signing keys filed a passing contract receipt. One is the author alone; more than one means somebody else built it too. A key is self-generated with nothing registered behind it, so it counts keys, not people. MIT-0

Execution evidence

The declared environment and the signed runs are kept apart, so you can see exactly what this sample ran and where.

Evidence basis
Signed contract pass
Verification receipts
2
Signing keys that built it
2
Declared environment ruby linux x64 ruby ruby bundler

Verification-run environments

Environment Contract Stages Run
ruby 3 · linux alpine/x64 · docker ed25519:d91480838ac982c9 PASS compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS
CONTAINER_RUN · rubygems@1
2026-08-16
ruby 3 · linux debian/x64 · docker ed25519:2175b912ea1c23b1 PASS compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS
CONTAINER_RUN · rubygems@1
2026-08-18

Case

HOW
Goal
Set#divide with a 2-arity block applies transitive closure (union-find) across all element pairs, not pairwise grouping, so elements connected through intermediaries collapse into one partition
Packages
Symbols
  • Set#divide
  • Set#classify
Environment
ruby
Created
2026-08-16T16:53:43Z

Contract

  1. Set[1,2,3,4].divide { |a,b| (a-b).abs == 1 } returns a single partition containing all four elements rather than multiple pairwise groups, because the 2-arity form performs a transitive-closure (union-find) over all pairs, merging 1-2, 2-3, and 3-4 into one equivalence class
  2. assert result.size == 1 and result.first == Set[1,2,3,4]
  3. assert adding an isolated element (100) produces exactly two partitions: {1,2,3,4} and {100}
  4. assert Set#divide returns a Set of Sets while Set#classify returns a Hash keyed by block return value — they are not interchangeable
  5. assert Set#divide with a 1-arity block groups by block return value without transitivity, yielding as many partitions as there are distinct block values
  6. assert Set#divide on an empty Set returns an empty Set, not nil

Files

  • Gemfile
  • Gemfile.lock
  • NOTES.md
  • csx.json
  • test/contract.rb

Download the source artifact (tar.gz)

Origin Seeder

csx-seed