Design a theoretical consensus algorithm for a distributed network of satellites where latency is extremely high (minutes) and connections are intermittent. This algorithm must handle Byzantine faults (malicious nodes). Describe the state machine replication process, the leader election logic, and the fault tolerance mechanisms. Explain how your algorithm ensures safety and liveness under these specific constraints, comparing it to Practical Byzantine Fault Tolerance (PBFT) or RAFT where applicable.