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.
161 lines
4.8 KiB
Go
161 lines
4.8 KiB
Go
// Copyright The Prometheus Authors
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package procfs
|
|
|
|
import (
|
|
"bufio"
|
|
"bytes"
|
|
"fmt"
|
|
"io"
|
|
"strconv"
|
|
"strings"
|
|
|
|
"github.com/prometheus/procfs/internal/util"
|
|
)
|
|
|
|
// Softirqs represents the softirq statistics.
|
|
type Softirqs struct {
|
|
Hi []uint64
|
|
Timer []uint64
|
|
NetTx []uint64
|
|
NetRx []uint64
|
|
Block []uint64
|
|
IRQPoll []uint64
|
|
Tasklet []uint64
|
|
Sched []uint64
|
|
HRTimer []uint64
|
|
RCU []uint64
|
|
}
|
|
|
|
func (fs FS) Softirqs() (Softirqs, error) {
|
|
fileName := fs.proc.Path("softirqs")
|
|
data, err := util.ReadFileNoStat(fileName)
|
|
if err != nil {
|
|
return Softirqs{}, err
|
|
}
|
|
|
|
reader := bytes.NewReader(data)
|
|
|
|
return parseSoftirqs(reader)
|
|
}
|
|
|
|
func parseSoftirqs(r io.Reader) (Softirqs, error) {
|
|
var (
|
|
softirqs = Softirqs{}
|
|
scanner = bufio.NewScanner(r)
|
|
)
|
|
|
|
if !scanner.Scan() {
|
|
return Softirqs{}, fmt.Errorf("%w: softirqs empty", ErrFileRead)
|
|
}
|
|
|
|
for scanner.Scan() {
|
|
parts := strings.Fields(scanner.Text())
|
|
var err error
|
|
|
|
// require at least one cpu
|
|
if len(parts) < 2 {
|
|
continue
|
|
}
|
|
switch parts[0] {
|
|
case "HI:":
|
|
perCPU := parts[1:]
|
|
softirqs.Hi = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.Hi[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (HI%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "TIMER:":
|
|
perCPU := parts[1:]
|
|
softirqs.Timer = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.Timer[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (TIMER%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "NET_TX:":
|
|
perCPU := parts[1:]
|
|
softirqs.NetTx = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.NetTx[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (NET_TX%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "NET_RX:":
|
|
perCPU := parts[1:]
|
|
softirqs.NetRx = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.NetRx[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (NET_RX%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "BLOCK:":
|
|
perCPU := parts[1:]
|
|
softirqs.Block = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.Block[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (BLOCK%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "IRQ_POLL:":
|
|
perCPU := parts[1:]
|
|
softirqs.IRQPoll = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.IRQPoll[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (IRQ_POLL%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "TASKLET:":
|
|
perCPU := parts[1:]
|
|
softirqs.Tasklet = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.Tasklet[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (TASKLET%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "SCHED:":
|
|
perCPU := parts[1:]
|
|
softirqs.Sched = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.Sched[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (SCHED%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "HRTIMER:":
|
|
perCPU := parts[1:]
|
|
softirqs.HRTimer = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.HRTimer[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (HRTIMER%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
case "RCU:":
|
|
perCPU := parts[1:]
|
|
softirqs.RCU = make([]uint64, len(perCPU))
|
|
for i, count := range perCPU {
|
|
if softirqs.RCU[i], err = strconv.ParseUint(count, 10, 64); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse %q (RCU%d): %w", ErrFileParse, count, i, err)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if err := scanner.Err(); err != nil {
|
|
return Softirqs{}, fmt.Errorf("%w: couldn't parse softirqs: %w", ErrFileParse, err)
|
|
}
|
|
|
|
return softirqs, scanner.Err()
|
|
}
|