Suppose $1\le k_1\le k_2\le \cdots \le k_\ell \le N$ are integers. Then the probability distribution of the vector of lengths of
$$
[0, X_{(k_1)}], [X_{(k_1}, X_{(k_2)}], \ldots, [X_{(k_\ell)}, 1]
$$
is $\operatorname{Dirichlet}(k_1,\,k_2-k_1,\,k_3-k_2,\,\ldots, \, N-k_\ell).$
I suspect this can be proved by paraphrasing Thomas Bayes's famous posthumous paper An Essay Toward Solving a Problem in the Doctrine of Chances, published in 1761. Bayes did the case $\ell=1,$ getting what today we call a Beta distribution. The Beta distribution is a special case of the Dirichlet distribution.
The question supposed that $X_1, \ldots, X_N \sim \text{i.i.d.} \operatorname{Uniform}[0,1].$
Here I will suppose that $X_0, X_1, \ldots, X_N \sim \text{i.i.d.} \operatorname{Uniform}[0,1],$ i.e. I add one additional uniform random variable $X_0.$
For $k=1,\ldots, N$ (not $k=0,\ldots, N$) let
$$
Y_k = \begin{cases} 1 & \text{if } X_{(k)}<X_0, \\ 0 & \text{if } X_{(k)}>X_0. \end{cases} \qquad \text{$(X_{(k)},$ not $X_k$)}
$$
Then
\begin{align}
& 1/(N+1) \\[8pt]
= {} & \Pr(X_0 = X_{(n+1)}) \text{ by symmetry} \\[8pt]
= {} & \Pr(Y_1+\cdots+Y_N=n\mid X_0) \\[8pt]
= {} & \binom Nn X_0^n (1-X_0)^{N-n} \\[8pt]
\text{and } & \Pr(Y_1+\cdots + Y_N = n) \\[8pt]
= {} & \operatorname E(\Pr(Y_1+\cdots + Y_N=n\mid X_0) \\[8pt]
= {} & \int_0^1 \binom Nn x^n (1-x)^{N-n} \, dx \\[8pt]
\text{Therefore } & \frac1{(N+1)\binom Nn} = \int_0^1 x^n (1-x)^{N-n} \, dx.
\end{align}
Then we have
\begin{align}
& \Pr(X_0\le x\mid Y_1+\cdots +Y_N = n) \\[12pt]
= {} & \frac{\Pr(Y_1+\cdots+Y_N=n \mid X_0\le x) \Pr(Y_1+\cdots+Y_N=n)}{\Pr(X_0\le x)} \\[12pt]
= {} & \frac{\Pr(Y_1+\cdots+Y_N=n \mid X_0\le x)\cdot 1/(N+1)} x \\[8pt]
= {} & \frac1{N+1} \int_0^x \binom Nn u^n (1-u)^{N-n} \, \frac{du} x. \\[12pt]
& (\text{“}du/x\text{” because } x = \Pr(X_0\le x).)
\end{align}
Thus we have a Beta distribution, which is the case of the Dirichlet distribution that concerns us here.
Next: Generalize this to higher-dimensional Dirichlet distributions.