> It's not that.
Are you saying it's easy? The PoS algorithms I've read seem quite complicated, and honestly quite interesting. Also there is a lot of academic research about this stuff, some of it private, some of it public.
I mean, I know there are people out there who think that, for example, particle physics is totally uninteresting, and you are of course free to decide that a given research area is totally uninteresting, but you can't expect others to agree. It is just your opinion
> It turns out that "distributed linked list" is actually a difficult problem that involves very interesting challenges
It's not that.