The implementation that exists in Linux is perfectly capable of running unbounded loops. But it runs your program through a function that rejects your program if it can't prove that it terminates.
The point being that you could rip the eBPF implementation out of the kernel, remove the verify check and have a very usable VM.
The point being that you could rip the eBPF implementation out of the kernel, remove the verify check and have a very usable VM.
Here's a implementation that exists because of the GPL: https://github.com/iovisor/ubpf.