Bitcoin's decentralized and permissionless nature is its biggest advantage but also its biggest weakness: it's too easy to create fake nodes.
But I believe that a permissioned and decentralized network is also possible. For a node to enter the network, a 51% approval of validators already approved in the network is required.
Then we created a community on some social network or on this forum and created a kind of web of trust  https://en.wikipedia.org/wiki/Web_of_trust.
Thus it will be possible to establish a decentralized network without energy waste. Humans are very good at identifying bots.
At the same time that it will be possible to enter the network with 51% approval, it will also be possible to ban nodes.
If anyone is interested in creating this mechanism please let us know.

is it possible to make a proof of space that is stored entirely in RAM?
 in my opinion proof of space has failed because storing in hard drives is not practical and ends the useful life of the hard drive.
If there is a way to have the voting power based on ram memory, in my opinion,
it would be fairer than proof of work.
i am thinking of just storing hashes in memory and the winner is the hash that is closest to the hash of the previous block.
an attacker can just recalculate the hashes like in conventional pow but in the long run storing the hashes will give an advantage.
if the miner doesn't have a valid hash he can start calculating other hashes with the CPU.

The idea is simple. 
Each node must have a valid domain name.
A node is randomly selected to mine a block.
Using an internet asset to create a decentralized and energy efficient cryptocurrency.

the bitcoin white paper says: "if the majority were based on one-IP-address-one-vote, it could be subverted by anyone
able to allocate many IPs".
Is it possible to create a cryptocurrency in which IP addresses are "staked"?.
If a node acts maliciously its ip address is blacklisted.
So anyone with internet access can act as a validator.

 
I have an idea for a new consensus protocol and i would like to get some feedback.
Instead of producing hashes via computational power validators produce hashes by a fixed amount of coins for example 50 coins (a block reward).
Nodes create a pool of hashes and select the smallest one just like in proof of work, but it doesn't necessarily have to start with zeros.
The winner puts their "proof" on block that will be accepted by others. If network produces two valid blocks the right chain is the smallest proof.
The hash is called "ticket" and consist of HashPrevBlock, PubKey, Signature.
This way it is easy to verify the amount of coins. Every ticket hash changes but validators need to put your coins in different addresses to have more tickets.
But I can't tell if it increases the chance of winning given the magnitude of possibilities.
However by simply having more coins you are removing tickets from other possible validators.
I don't know if it works yet. I created a repository with a simple python script that shows the idea. It makes sense to me.

https://github.com/pwn8/ProofOfLuck