Searchable JSON tree viewer
Explore a large JSON document as a collapsible tree and search keys, paths and values to find the field you need.
- Runs in your browser
- No upload
- Result stays on your device
Privacy & limitsRuns in your browser. Nothing is uploaded.
Input content stays in this tab; Refentra does not upload or store it. Optional aggregate action counts are sent only with your usage consent. Clear the workspace when finished.
Supported profile: JSON: 20,000 nodes, depth 64. Numbers use IEEE-754; integers must be safe and finite. Numbers must round-trip their decimal meaning. Unsafe integers, overflow, underflow or unsupported decimal precision are rejected before output.
Files: UTF-8 only; an optional UTF-8 BOM is removed on import. Error offsets refer to editor UTF-16 units.
Maximum text: 200,000 UTF-16 units; parser limits can be smaller. Worker time limit: 15 seconds (regex 1.5 seconds).
Check the input and the result
- Prepare and choose the operation
Paste strict JSON and run the tree inspection. Expand objects and arrays to follow nested values.
- Check a concrete example
Use this sample and compare the indicated result: {"a":[1,null]} → a[0]=1 (number); a[1]=null
- Check the output before you reuse it
Tell null, false, zero and empty strings apart. Labels that look alike can stand for different JSON value types.
Answers for this task
Does viewing the tree change the document?
Expanding nodes only changes how you inspect it. It doesn't rename keys, transform values or validate against an external application schema.
What should I check if the input fails?
Repair the JSON syntax error that is reported before you expand anything. Use quoted strings for identifiers larger than the safe numeric precision.
Where does this tool stop?
Input is limited to 200,000 UTF-16 units, 20,000 nodes and depth 64. A tree view is not a database query engine or an interactive JSON editor.