Build a compact Governor stack in the three listed files, hand-written with OpenZeppelin v5 semantics but without importing it. Do not deploy. Workspace: every file is written from an empty tree that holds no OpenZeppelin, forge-std or foundry.toml, and no task may add lib/, so each file is self-contained (pragma ^0.8.24, no imports) and declares the small interfaces it needs from the others inline; tests declare their cheatcodes in an inline Vm interface at the HEVM address. Clock: ERC-6372 timestamps everywhere (clock() = uint48(block.timestamp), CLOCK_MODE() = "mode=timestamp"), so every duration is in seconds.

GovToken: ERC-20 "Gov Token" / "GOV", 18 decimals, 1,000,000 GOV minted once to constructor(address holder); no mint, owner or permit. delegate(address) and delegates(address); an account's votes are the balances delegated to it (undelegated balances, self included, count for nobody) and every transfer moves votes between the two delegates. Checkpoints (uint48 timepoint, uint208 votes) per delegate and for total supply; getVotes(account), getPastVotes(account, t) and getPastTotalSupply(t) (revert unless t < clock()), found by binary search; events DelegateChanged and DelegateVotesChanged.

Timelock: constructor(address admin); MIN_DELAY = 2 days, fixed. bind(address governor) once, admin only, after which the admin has no power and the governor is the only proposer and canceller. Operation id = keccak256(abi.encode(target, value, data, salt)). schedule(target, value, data, salt, delay): governor only, delay >= MIN_DELAY, unused id. execute(target, value, data, salt) payable: anyone, once block.timestamp >= ready time, marks the id done before the call and bubbles revert data. cancel(id): governor only, while pending. receive() accepts ETH. Events for each.

Gov: constructor(address token, address timelock). votingDelay 1 days, votingPeriod 3 days, proposalThreshold 1,000 GOV checked as getPastVotes(proposer, clock() - 1). One action per proposal: propose(target, value, data, description) returns proposalId = uint256(keccak256(abi.encode(target, value, data, keccak256(bytes(description))))); snapshot = now + votingDelay, deadline = snapshot + votingPeriod; a duplicate reverts. castVote(id, uint8 support) (0 Against, 1 For, 2 Abstain), once per address while Active, weight getPastVotes(voter, snapshot). state(id): Pending while now <= snapshot, Active while now <= deadline, then Succeeded if For > Against and For + Abstain >= quorum = floor(4 x getPastTotalSupply(snapshot) / 100), else Defeated; then Queued, Executed or Canceled. queue(id) by anyone once Succeeded schedules on the timelock with salt = bytes32(id) and MIN_DELAY; execute(id) by anyone runs it; cancel(id) by the proposer while Pending. Events for each.

Tests (test/Gov.t.sol deploys all three): propose, vote, queue and execute where the Timelock sends 1 ETH to and calls a mock target; execute before 2 days reverts; defeated by more Against than For; quorum fails at 3.99% of supply and passes at exactly 4%; undelegated holders have zero weight; tokens received or delegated after the snapshot do not count; only Gov can schedule or cancel on the Timelock and the admin can do nothing after bind; a proposer below threshold reverts; the proposer cancels while Pending; checkpoint lookups exactly at, before and after a transfer's timestamp.

Review focus: double-counted votes through transfers and re-delegation, checkpoint search boundaries, quorum rounding, the one-shot bind, and any way to execute on the Timelock without a passed proposal.