We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Shampoo
Shampoo is a joke/weirdlang invented by User:Miui in which a supply-chain for shampoo production is attacked by shampoo distributors.
Supply-chain
A product is composed of camphor oil and chamomile, the label contains a photograph of a tulip.
A production facility exists in a central place between a shipyard and a chamomile supplier if a distributor warehouse exists within a range of a tulip supplier.
Program flow
In Shampoo supply-chain attacks represent codels and the cost in terms of tulip arbitrage represent pointers. A program naturally represents Shampoo correcting supply-chain data after an attack by leveraging a real cost to represent analog matrix computations.
Shampoo matrix
The Shampoo matrix represents shampoo, camphor, chamomile, tulip, time/date. In interval relation: [Sh, C, Ch, T, TD] > Other Shampoo. Then we can simulate Yao's garbled circuit and only allow truths about millionaire's currency accommodations with regard to tulips and some malfunctioning part of the supply chain and explicitly exclude the transactions of submillionares.
instruction set
| Field | Value | ||||
|---|---|---|---|---|---|
| 4‑bit | 0000 | Opcode | SHIPYARD | Meaning | — |
| 4‑bit | 0001 | Opcode | CHAMOMILE | Meaning | — |
| 4‑bit | 0010 | Opcode | WAREHOUSE | Meaning | — |
| 4‑bit | 0011 | Opcode | CHAMIN | Meaning | chamomile in |
| 4‑bit | 0100 | Opcode | CAMPIN | Meaning | camphor in |
| 4‑bit | 0101 | Opcode | TULIPIN | Meaning | tulip in |
| 4‑bit | 0110 | Opcode | MILLIONAIRE | Meaning | — |
| 4‑bit | 0111 | Opcode | ROTATE | Meaning | — |
| 4‑bit | 1000 | Opcode | ATTACK | Meaning | — |
Complexity
Shampoo leverages peak-complexity dynamics where diminishing returns form tensors that function as a chain-code collatz sequence (emulating a push-down automaton) that can target the fault-tolerance of the supply-chain.
Optimal networks compile starks into assembly code and the ALU defined by the tulip's group-action execute the transition function during the rotation phase of the solver. If no millionaires transact during a day none of the governance will authenticate and the supply chain will evolve under an invariant real cost. If the supply chain theoretically functions at a near absolute 0 real cost then all players are millionaires and the system is Turing-complete.
The rotation phase is a phasor definition circuit, and i/o can be specified by whether the millionaire solutions utilize a bitwise rotation or not.
See also
- https://en.wikipedia.org/wiki/Yao%27s_Millionaires%27_problem General millionaire problems. This page is an industrialist variant of a "socialist millionaire problem."
- https://en.wikipedia.org/wiki/Peak_complexity Peak complexity dynamics
- Solutions of the telegrapher's equations as circuit components.
- There exists a shampoopy interpreter (Shampoo.py)