This lecture explains a simple universal construction algorithm using an infinite array of ConsentsObjects, where each process has registers to simulate operations. The algorithm is not weight-free but log-free, as some operations may not terminate. The lecture also highlights the importance of not assuming weight-freeness based on the ConsentsObject and the uncertainty in deciding values. Despite being named a universal construction algorithm, it is more accurately described as a log-free algorithm, similar to universal construction but with potential non-termination issues.