I don't know what you're talking about accepting easier difficulties.
We were essentially discussing Sabunir's question about what prevents someone from messing with the program's source code to adjust block-generating difficulty to be very easy, then make a network on his own and create a, say, 50,000-block proof-of-work within seconds then finally propagate it across the real network to steal "votes" towards his new fake blocks as technically, his proof would be "the longest". So is there a way to verify how much work was actually put into a given PoW (for eg. how many zero's are at the beginning of each hash or something)?
I am also wondering about Suggester's question. It seems like modifying the code to give a node an advantage in generating coins might be possible.
I am confused as to why each node on the network is actually doing when set to generate coins. What problem are they solving that takes 100% CPU?