← Concepts

MuviPe · Per-ticket affiliate program

The 363 Tree

Every ticket a user buys opens its own referral tree. It holds 363 positions, fills in a fixed order, and closes when the last one lands.

Source: Affiliate_Program_Structure_of_Individual_Ticket.pdf — 4 pages, 14 diagrams.
This page restates that document. Section 7 is commentary and is marked as such.

Positions
363per ticket
Shape
×3ternary, 5 levels
Branches
3filling in lockstep
Per branch
1211+3+9+27+81
01

The shape

What a ticket owner sits on top of.

A ticket owner — call them X — sits above three direct positions. Each of those opens three more, and so on for five levels. Nothing about the tree is elastic: it is the same 363 seats for every ticket, and the ticket closes when all of them are filled.

Level 1 is mandatory. Positions 1, 2 and 3 must all be filled before the commission cycle unlocks. The document is explicit that they need not come from X — they can be referred by X or by the people who referred X, further up the tree. Either way, all three must land.

X 1 2 3 ×3 ×3 ×3 L1 · 3 L2 · 9 L3 · 27 Levels 4 and 5 continue the same way — 81 positions, then 243 3 + 9 + 27 + 81 + 243 = 363
Figure 1. Every filled position opens three more, for five levels. Two thirds of the tree — 243 of the 363 seats — is level 5 alone.
02

How positions fill

Not top to bottom. Left spine first, then sideways.

This is the part the source document spends nine diagrams on, and the part that is hardest to hold in your head. Positions are not filled level by level. The algorithm drives straight down the left edge first, comes back for the centre, comes back again for the right, and only then starts filling the sides.

All three branches move together, one seat each, so the fill order runs straight through the position numbers: 1, 2, 3, 4, 5 … up to 363. The diagram below is the whole thing as one tree, hanging off the ticket owner X, with every position carrying its number — so it can be checked against the source node for node. The source splits it into three stacked diagrams only because 243 seats will not fit on a page.

The tree is wider than the screen — it pans along while playing, or use Fit width →

Figure 2. The full tree: X on top, its three mandatory positions beneath, and all 363 seats numbered as in the source. Play fills them in order, 1 through 363, panning along as it goes; the slider scrubs and the stage buttons jump to the end of each stage. Every position number was diffed against the source diagram — 121 of 121 match per branch.
The four stages, in global position numbers
Stage Steps Positions Seats What fills
1 · Mandatory 3 0 1–3 3 The three direct positions
2 · Fastest Five 1–4 4–15 12 Straight down the left edge
3 · Left positions 5–12 16–39 24 Centre-left, then right-left
4 · Side by side 13–120 40–363 324 Everything remaining, level 3 → 4 → 5
The ordering rule, stated once. Write each position as the path from its branch root using L / C / R. Stage 2 and 3 fill L, LL, LLL, LLLL, then the same for C, then for R. Stage 4 then sweeps level 3, level 4 and level 5 in turn, and within each level it orders paths by their last step first, then the step before it, and so on back to the root — with L before C before R.
03

Three branches, one clock

Why the numbers jump in threes.

The three branches under X are never filled one after another — they advance together, one seat each. So every step of the fill order consumes exactly three position numbers, and a branch only ever owns numbers of one residue.

If k is the step number within a branch (0 to 120), the global position is 3k + branch. Branch 1 owns 1, 4, 7, 10…; branch 2 owns 2, 5, 8, 11…; branch 3 owns 3, 6, 9, 12…. Each branch is a 121-seat subtree, and 3 × 121 = 363.

Step-by-step interleave
Step k Path from branch root Branch 1 Branch 2 Branch 3
0 — (root) 1 2 3
1 L 4 5 6
2 L·L 7 8 9
3 L·L·L 10 11 12
4 L·L·L·L 13 14 15
5 C 16 17 18
120 R·R·R·R 361 362 363
04

Fastest Five

The bonus, and the one thing that takes it away.

Fastest Five is an extra bonus on top of the normal commission. It is awarded for one specific chain: a branch root and the four positions directly below it down the left edge — for branch 1, that is 1 → 4 → 7 → 10 → 13.

The condition is not just that the chain fills. The document says the bonus applies when those left positions are done "only by the owner referred" — every seat in the chain has to come from X's own referrals. One outsider anywhere in the five and the chain no longer qualifies.

1 4 7 10 13 Branch root — one of the mandatory 3 Own referral Own referral Own referral Placed here by the company, at random Chain is no longer all owner-referred — bonus does not apply ticket with no referrer Chain = branch root + L + L·L + L·L·L + L·L·L·L
Figure 3. The registration rules put unreferred tickets into a random left position — which is precisely where the Fastest Five chain lives. The document names this effect directly; see section 7 for why its stated purpose does not follow.
05

Registration rules

Page 4 of the source, restated.

06

Where this already shows up

One number in the app is already this tree.

The expanded ticket panel already reports Members 125/363 — that 363 is this structure, and the counter is progress toward closing the ticket.

It used to report Fast Five 2/9, which had no basis here — nine corresponds to nothing in the Fastest Five structure. It now reads 2/3: the bonus needs the left spine under each of the three mandatory positions, so three chains have to land. The name still comes from the depth of a chain, which is five positions.

Worth flagging that the source defines the condition for the bonus but never a progress metric, so the denominator is a reading rather than a quotation. Three is the count the condition is phrased around; the finer alternative is 12, the seats in stage 2 — a 3 only moves when a whole five-deep chain completes.

View Tree Details is the natural home for a live version of Figure 2.

07

What the document does not say

Commentary — these are gaps I found, not statements from the source.

There are no numbers for the money

The source says "the commission will be split accordingly to each person" and that Fastest Five earns "extra bonus". There is no rate, no split table, no bonus amount, and no statement of who is paid when a position fills. The entire payout side is undefined, which means the tree can be built but the earnings cannot.

Two incompatible numbering schemes

Page 1 numbers positions by level: level 2 is 4–12, level 3 is 13–39, level 4 is 40–120. Pages 2 to 4 number them by fill order, where 13 is the deepest seat of branch 1's left spine and 40 sits at level 3. Same tree, same totals, incompatible labels. This page uses the fill-order scheme throughout, because that is the one the detailed diagrams use — but anyone implementing from both pages will get it wrong.

The random-left rule argues against itself

Placing unreferred tickets into random left positions is said to "break fastest five achievement of others", and then, in the same sentence, to help users "speed up". Breaking a bonus and accelerating the people chasing it are opposite effects. This is the one rule whose intent cannot be recovered from the text, and it needs a decision before it can be coded.

Unstated edge cases

What happens to a position filled by someone the owner did not refer — who is credited? What does "check same user was registering" do when it matches: reject, or place elsewhere? Is the cooldown 1 month or 2, and what starts the clock? None of these are answered.