Paste a secret, get a link, send it. The first person to open it and press
Reveal sees the secret; the link dies at that moment. The recipient needs a
browser and nothing else — no account, no client, no installed tooling.
The server cannot read what it stores. AES-256-GCM happens in the browser and
the key lives in the URL fragment, which browsers never transmit, so hushd
holds ciphertext and no key material. That is a property of where the key sits
rather than a promise about our conduct, which is why there is deliberately no
endpoint accepting a plaintext secret and no server-side-encryption fallback:
two guarantees behind one URL would be worse than one honest guarantee.
Three decisions carry the design:
* GET /s/{id} touches NO storage, not even to check existence. Slack, Teams,
WhatsApp, iMessage and Outlook Safe Links all fetch a URL before a human
sees it, so destroying on GET would destroy most secrets in transit and the
recipient's "already used" would be indistinguishable from interception.
Only POST /reveal consumes. Bot user-agent detection is an arms race;
removing the side effect from GET is not. Pinned by
TestGettingTheRevealPageNeverConsumesTheSecret.
* Destruction is one Redis GETDEL, which is atomic. GET-then-DEL has a window
where two simultaneous readers both win, and for a one-time secret that
window is the product. The store contract demands atomicity and the same
concurrency test runs against both implementations.
* Missing, already-revealed, expired and evicted are ONE indistinguishable
410. Separating them would confirm to a prober that a given link was real.
The secret id IS the capability, so secret.ID is a struct whose every
accidental path — %v, %s, String(), slog, json.Marshal — emits a redacted
handle or refuses, and the raw value needs an explicit Value(). The first
version tried to prevent leaks by implementing no String() at all; its own test
caught that Go's fmt prints unexported fields anyway, so forbidding the method
had removed the control rather than the leak.
Operationally: structured JSON on stdout in the fleet's wire format, which
Vector already collects with no annotation; six hush_* metrics on the chassis
registry with no id, IP or path in any label; five alert rules wired into
vmalert. The public Ingress enumerates /, /s/ and /api/ so /metrics, /healthz
and /readyz share the port but are unreachable from the internet — no
basic-auth middleware to maintain and get wrong.
Dependencies are vendored because go-chassis is private: the Woodpecker test
step and the in-cluster Kaniko build both run -mod=vendor with GOPROXY=off and
hold no git credential.
cmd/hush-mcp is a stdio MCP server doing the same client-side crypto locally,
so using hush from an agent preserves the same guarantee as using it from a
browser.
103 lines
3.0 KiB
Go
103 lines
3.0 KiB
Go
// Copyright 2009 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
//go:build aix || darwin || dragonfly || freebsd || linux || netbsd || openbsd || solaris || zos
|
|
|
|
package unix
|
|
|
|
import "unsafe"
|
|
|
|
// readInt returns the size-bytes unsigned integer in native byte order at offset off.
|
|
func readInt(b []byte, off, size uintptr) (u uint64, ok bool) {
|
|
if len(b) < int(off+size) {
|
|
return 0, false
|
|
}
|
|
if isBigEndian {
|
|
return readIntBE(b[off:], size), true
|
|
}
|
|
return readIntLE(b[off:], size), true
|
|
}
|
|
|
|
func readIntBE(b []byte, size uintptr) uint64 {
|
|
switch size {
|
|
case 1:
|
|
return uint64(b[0])
|
|
case 2:
|
|
_ = b[1] // bounds check hint to compiler; see golang.org/issue/14808
|
|
return uint64(b[1]) | uint64(b[0])<<8
|
|
case 4:
|
|
_ = b[3] // bounds check hint to compiler; see golang.org/issue/14808
|
|
return uint64(b[3]) | uint64(b[2])<<8 | uint64(b[1])<<16 | uint64(b[0])<<24
|
|
case 8:
|
|
_ = b[7] // bounds check hint to compiler; see golang.org/issue/14808
|
|
return uint64(b[7]) | uint64(b[6])<<8 | uint64(b[5])<<16 | uint64(b[4])<<24 |
|
|
uint64(b[3])<<32 | uint64(b[2])<<40 | uint64(b[1])<<48 | uint64(b[0])<<56
|
|
default:
|
|
panic("syscall: readInt with unsupported size")
|
|
}
|
|
}
|
|
|
|
func readIntLE(b []byte, size uintptr) uint64 {
|
|
switch size {
|
|
case 1:
|
|
return uint64(b[0])
|
|
case 2:
|
|
_ = b[1] // bounds check hint to compiler; see golang.org/issue/14808
|
|
return uint64(b[0]) | uint64(b[1])<<8
|
|
case 4:
|
|
_ = b[3] // bounds check hint to compiler; see golang.org/issue/14808
|
|
return uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24
|
|
case 8:
|
|
_ = b[7] // bounds check hint to compiler; see golang.org/issue/14808
|
|
return uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 |
|
|
uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56
|
|
default:
|
|
panic("syscall: readInt with unsupported size")
|
|
}
|
|
}
|
|
|
|
// ParseDirent parses up to max directory entries in buf,
|
|
// appending the names to names. It returns the number of
|
|
// bytes consumed from buf, the number of entries added
|
|
// to names, and the new names slice.
|
|
func ParseDirent(buf []byte, max int, names []string) (consumed int, count int, newnames []string) {
|
|
origlen := len(buf)
|
|
count = 0
|
|
for max != 0 && len(buf) > 0 {
|
|
reclen, ok := direntReclen(buf)
|
|
if !ok || reclen > uint64(len(buf)) {
|
|
return origlen, count, names
|
|
}
|
|
rec := buf[:reclen]
|
|
buf = buf[reclen:]
|
|
ino, ok := direntIno(rec)
|
|
if !ok {
|
|
break
|
|
}
|
|
if ino == 0 { // File absent in directory.
|
|
continue
|
|
}
|
|
const namoff = uint64(unsafe.Offsetof(Dirent{}.Name))
|
|
namlen, ok := direntNamlen(rec)
|
|
if !ok || namoff+namlen > uint64(len(rec)) {
|
|
break
|
|
}
|
|
name := rec[namoff : namoff+namlen]
|
|
for i, c := range name {
|
|
if c == 0 {
|
|
name = name[:i]
|
|
break
|
|
}
|
|
}
|
|
// Check for useless names before allocating a string.
|
|
if string(name) == "." || string(name) == ".." {
|
|
continue
|
|
}
|
|
max--
|
|
count++
|
|
names = append(names, string(name))
|
|
}
|
|
return origlen - len(buf), count, names
|
|
}
|