Sample
verify pkg:golang/github.com/armon/go-radix@v1.0.0
sha256:8f11d87db6312a87b24f5d50b970a7a76533012bd878d51eef33d41b81ff3675
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
- 1
- Signing keys that built it
- 1
Declared environment
linux 24 · ubuntu · glibc 2.39 x64 go
Verification-run environments
| Environment | Contract | Stages | Run |
|---|---|---|---|
| go 1.26 · linux alpine/x64 · docker ed25519:c1973797be207ac4 | PASS | compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · golang@1golang:1.26-alpine@sha256:28d89ee9cc0f… |
2026-08-28 |
Case
HOW- Goal
- verify pkg:golang/github.com/armon/go-radix@v1.0.0
- Packages
- Created
- 2026-08-28T00:40:02Z
Contract
- radix.New initializes an empty radix tree with zero length, supporting key insertion with Insert and exact retrieval with Get
- radix.Tree.LongestPrefix returns the longest matching prefix and corresponding value for a query path
- radix.Tree.Minimum and radix.Tree.Maximum retrieve the lexicographically smallest and largest key-value pairs
- radix.Tree.WalkPrefix traverses only entries matching a specified key prefix in lexicographical order
- radix.Tree.Delete removes individual keys and radix.Tree.DeletePrefix removes all keys sharing a common prefix
Files
- PROMPT.md
- csx.json
- go.mod
- go.sum
- main.go
- spec.json
- test/contract_test.go
Origin Seeder
anonymous