Generate a declared fractional factorial execution plan

Declare the complete factor specification

Declare factors, independentFactors and generators. A factor is a name or {name, low, high}; omitted levels use -1 and +1. A generator uses {factor, product, sign}; sign defaults to +1. Product factors must be distinct basic factors.

{
  "factors": [
    "A",
    "B",
    "C",
    "D",
    "E",
    "F",
    "G"
  ],
  "independentFactors": [
    "A",
    "B",
    "C",
    "D"
  ],
  "generators": [
    {
      "factor": "E",
      "product": [
        "A",
        "B",
        "C"
      ]
    },
    {
      "factor": "F",
      "product": [
        "A",
        "B",
        "D"
      ]
    },
    {
      "factor": "G",
      "product": [
        "A",
        "C",
        "D"
      ]
    }
  ]
}

• A low or high level can contain commas, quotes, Unicode or line breaks. It remains a string; no numeric conversion is applied.
• Only basic factors may appear in a generator product. Unknown fields, duplicated factor names and accessors are refused.

Set run count, repetitions and order

Random order: xorshift32 (13, 17, 5), continuous state across replications; Fisher–Yates draws use rejection sampling below floor(2^32 / bound) × bound. The supplied nonzero uint32 seed is saved even when randomization is off. This sequence does not claim to match R.

Read signed defining relations and resolution

For E=ABC, F=ABD and G=ACD, multiplying each equation by its dependent factor gives the defining generators ABCE, ABDF and ACDG. Their complete group has eight words including I; the shortest nonidentity word has four factors, so the resolution is IV. Negative generators retain negative signs in the group and all alias classes.

• The minimum resolution is a check on the shortest word, not a search for a better design.
• With no dependent factors, the defining group contains only I and resolution is null: no defining confounding.

Keep every result, including originals

aliases.csv names every term; aliases.json records every mask and sign. Bit i selects factorOrder[i], zero is I, and each sign is relative to its class representative.

Respect joint budgets and recover atomically

1–1024 replications; at most 32,768 total runs and 655,360 run cells. Random order uses a nonzero uint32 seed and the published rejection-sampled xorshift32 shuffle.

Joint budgets: 100,000,000 charged work units; files plus complete copy text 64 MiB; compact typed data 8 MiB; aggregate 72 MiB; transport 96 MiB; conservative owned allocation envelope 1,024 MiB. Names, escaping, encoding, alias members and copies count. Axis ceilings do not promise simultaneous maximum capacity.

One 120-second absolute deadline starts before source capture and includes metadata, reading, Worker startup, computation, encoding, full validation, cleanup and first publication. Failure or cancellation clears all prior outputs.

• The visible view is paged; full copy and downloads never truncate runs, labels or aliases.
• Correct fields, levels, generators or base-run count. For a joint-budget failure, reduce the complete task and retry. After cancellation or Worker failure, keep the same original input and settings and start a fresh run.