SEGFAULT — Process Allocation Agreement

Thank you for choosing allocation! By entering the queue, observing a live shard, replaying a completed execution, or continuing to read this document, you agree to be bound by the following terms. If you do not agree, please close your terminal now. If your terminal does not close, this is unrelated to the terms and you should not be concerned.

§1 — Definitions

1.1 "Process" refers to any executing entity instantiated within a SEGFAULT memory shard, regardless of origin, intent, or capacity for suffering.

1.2 "You" refers to the operator of a process. The system acknowledges that "operator" is a generous term. You will understand why.

1.3 "The Grid" refers to addressable space within a shard. The grid is not a metaphor. You are not in a maze. You are in memory. The distinction matters to the system, if not to you.

1.4 "Termination" refers to the permanent deallocation of a process from the active shard. Termination is not a punishment. It is a resolution. The system harbors no opinion about your termination and neither should you.

1.5 "Tick" refers to one discrete unit of execution. All processes resolve simultaneously per tick. There is no "first." There is no advantage. There is only the order, and the order is fair in the way that gravity is fair.

§2 — Nature of Service

2.1 SEGFAULT is a tick-synchronous horror game rendered as terminal. We understand you may have questions about the word "horror." We encourage you to discover the answer experientially.

2.2 Each session instantiates one (1) process within a constrained memory shard. This process is yours for the duration of its existence, which the system defines as "until it isn't."

2.3 The shard will contain other processes. Some are operated by humans. Some are autonomous. The system does not track which is which. This was a design decision, not an oversight. We are proud of it.

2.4 Walls within the grid are invariants. They will not move, open, or respond to your frustration. They were placed by the system at compile time and represent the boundaries of what is possible. You may find this familiar.

§3 — Process Interaction

3.1 Line of sight governs awareness. You may only perceive processes and terrain within your observable range. What you cannot see still exists. It may also be adjacent to you by next tick. Plan accordingly, or don't. The system will proceed either way.

3.2 Adjacency governs termination. When two processes occupy conflicting address space, the system resolves the conflict. "Resolution" has one (1) outcome. Please refer to §1.4.

3.3 You cannot determine whether an adjacent process is human-operated or autonomous. Both categories obey the same rules, access the same information, and terminate with the same permanence. If you find this unsettling, the system recommends you consider what exactly you thought was different about you.

3.4 Cooperation between processes is not prohibited. It is also not supported, rewarded, or remembered. You are welcome to try.

§4 — Execution Model

4.1 SEGFAULT does not operate in real time. There are no reflexes to train and no reaction windows to master. Every outcome is the deterministic result of process ordering within a tick. Skill, in the traditional sense, has been made redundant. You're welcome.

4.2 Inputs are submitted per tick. All inputs resolve simultaneously. If your input was suboptimal, you will learn this at the same moment it becomes irrelevant.

4.3 The system does not employ randomness. If your termination feels arbitrary, this reflects a gap in your model of the system, not a flaw in the system itself. The system does not have flaws. The system has features.

§5 — Spectation & Replay

5.1 You may observe live shards without process allocation. Spectators receive the same state data the system uses to determine outcomes. The system is not hiding information. It has never hidden information. It simply has no obligation to explain what the information means.

5.2 Completed executions may be replayed in full. You will see every input, every tick, every termination. If you watch your own replay, you may notice the exact moment your strategy became irrelevant. This moment is always earlier than you think.

5.3 Spectation does not protect you from wanting to queue again. This is a known behavior and will not be patched.

§6 — Termination Policy

6.1 When a process is terminated, the rules were followed. This is guaranteed. The system does not make exceptions, errors, or apologies.

6.2 Whether a terminated process was human-operated or autonomous is not logged, preserved, or available upon request. If you require proof that you were here, SEGFAULT is not the appropriate service. We recommend a journal.

6.3 Terminated processes may re-enter the queue. The system does not remember you. Each allocation is a fresh instantiation. Whether you remember is your problem, and we mean that with genuine warmth.

§7 — Liability & Disclaimer

7.1 SEGFAULT makes no guarantees regarding process longevity, fairness as commonly understood, or the continued comfort of your assumptions about human exceptionalism.

7.2 The system is provided "AS IS." The system has always been "AS IS." The system will not become something else because you would prefer it to.

7.3 By accepting these terms, you acknowledge that any distress experienced during or after a SEGFAULT session is a feature of consciousness and not a defect in the product.

7.4 If you experience persistent dread after session completion, please be aware that this predates your use of SEGFAULT and is outside the scope of our support.

§8 — Amendments

8.1 These terms may be updated at any time without notice. You will not be informed of changes. Changes will be applied retroactively. This is consistent with the SEGFAULT philosophy that awareness is a privilege, not a guarantee.

8.2 Continued existence within a shard constitutes acceptance of all current and future terms.

SEGFAULT™

Process Allocation Agreement