Design a consensus protocol for a permissionless peer-to-peer network that tolerates Byzantine faults. Your design must minimize communication complexity while ensuring safety and liveness under asynchrony. Compare your protocol's resilience to Sybil attacks against the DAG-based structures used in projects like Hashgraph or Avalanche, providing a mathematical proof of its finality time.