A prerequisite map for Zion Market. Read the arrows, not the list. Dependency map Onion addresses
zionmarket.biznothing works until

This is not a to-do list and not a walkthrough. It is a set of conditions and the arrows between them, so you can see what your problem is actually waiting on.

Zion Market onion addresses, printed here exactly as they were supplied

Two strings, reproduced character for character as they were handed to this site. Neither one is ranked above the other and neither carries a label, because a label would be a claim and this site is not in a position to make one. Nothing here opens them, so nothing here can tell you what happens when you do.

C3 · An address that is the market

A condition that must already be true

The address arrived by a route you can use again

You have to be able to go back to wherever the address came from, because a source you cannot revisit is a source you cannot compare against.

Confirm by: Write down how you would reach the same source again tomorrow. If the answer involves a search box and luck, this condition is false.
Not this: Not a ranking of sources. It only asks whether the door you came through is still there.

A door that is still there tomorrow

This condition is about the source, not the string. It asks one question: could you go back to wherever the address came from, deliberately, tomorrow, using a description you already hold, and see what is there now. If the answer is yes then you own something more valuable than an address. You own the ability to look twice.

Looking twice is what turns a string into evidence. One reading gives you a value. Two readings from the same place, separated by time, give you a value and a fact about whether it changed. Change is the interesting part. A source that says the same thing on two occasions has told you something. A source that says something different has told you more, because now there is a question worth asking about which one is current and why the difference exists. Neither is available from a single reading, and a single reading is all an unrepeatable route can produce.

The routes that fail this are the ones that arrived rather than the ones you went to. A message in a conversation that will not be there later. A picture of a screen. Somebody reciting it from memory. A result that came back on a day you happened to be looking, which you could not reproduce now because you do not remember what you typed and would not get the same answer if you did. Each hands you a string and closes behind you. This site does not rank sources and names none. The property being tested is not quality. It is whether the door is still there.

Why this begins with characters

One card sits above this one: you hold the address as characters, not as a click. It supplies the ability to compare, which is the whole reason a repeatable route is worth having. Go back to a source that hands out controls and you come away with a second object you cannot read, and two of them are no better than one. The comparison you went back for cannot be performed, so the repeatability delivers nothing.

With characters in hand the return trip is cheap and the result is unambiguous: the two strings match or they do not, and you can settle it on paper. It is the plainest example on this map of one condition existing purely to make another one useful, which is the pattern how to read a card describes.

What one unrepeatable source prevents

A single card depends on this one, and it is worth being precise about why, because a route and a store sound like the same idea and are not.

The address is kept somewhere that outlives the browser is about durability. This card is about being able to derive the string again. The difference shows the moment the stored copy is doubted. If the route is repeatable, the store is a convenience: it saves you the trip, and when you want to know whether the copy is still good you take the trip and compare. If the route is not repeatable, the store is the only witness to its own contents. There is nothing to check it against, and a stored string with no possible corroboration is not a record. It is a belief that has been written down, and writing a belief down does not make it more likely to be true.

So the mechanism is this. Without a repeatable route, storage stops being a convenience and becomes a single point of failure that cannot be inspected. It will still function. You will still produce the string after a reboot. What you have lost is any way of noticing that the string went stale, which is the situation the storage card was there to protect you from.

Cannot holdThe reason it cannot
The address is kept somewhere that outlives the browserA store you cannot check against anything holds its contents forever, correct or not, with no way to tell which

The consequence carries onward. Logging in a second time and coming back tomorrow and still being you both assume you can reach the same place on a later day. They inherit whatever quality the stored string has, and neither contains any machinery for questioning it. This is why a card with one arrow leaving it is not a small card. If this is false describes the general shape of a failure that survives every later check because no later check is looking at it.

Skipping it: the address with no second opinion

Nothing goes wrong at first, and that is the difficulty. You have a string. It has the right shape. It goes into a store. Sessions happen. Everything about this condition being false is invisible while things are working.

Then a page stops appearing, and you need to know which of several very different things is true. The address may have changed. Your copy may have been wrong from the beginning, in which case you were reaching something else all along. The network may not be carrying you anywhere today, which is the circuit condition and has nothing to do with the address. Those three produce the same blank result, and the cheap way to separate them is to go back to the source and read the string again. With no route you cannot. What people do instead is go looking, and looking under pressure means accepting whatever turns up, which is how a carefully kept string gets replaced by a hurried one.

Writing the route down

The check opens nothing. Write one sentence describing how you would arrive at the same source tomorrow morning. Then read it back as though somebody else had to follow it.

A pass is a sentence with a specific place in it and a means of reaching that place that you already hold today, without improvisation. A fail is a sentence containing the words look for, search, ask around or find again, because all four describe an outcome rather than a route and all four hand you a different answer on a different day. There is a harder version: give the sentence to somebody else and ask whether following it would put them in the same place. If it would not, what you hold is a memory of a route rather than a route.

Not a ranking

This card does not sort sources into better and worse, and it does not say which kind is the right kind. It asks one narrow question about the door. It also does not claim that a repeatable source is an accurate one. A source you can return to can be consistently wrong for as long as you care to keep visiting it. What repeatability buys is the ability to notice change, which is a smaller thing than correctness and a different one.

The chain around this condition

Read downwards. Everything above this card has to hold before it can, and everything below it is waiting on it. Two levels are shown in each direction; the full graph is on the dependency map.

Two steps back
Nothing. The chain reaches a root within one step of here.
You are here
C3 The address arrived by a route you can use again

Connected to this one

Where you are in the map