Blockchain
This is a Shikaku puzzle (divide the grid into rectangles that together cover every cell, each number in the grid is a clue giving the area of the rectangle it's in, every rectangle has one clue). However, unlike in a regular Shikaku, there must be a chain containing all the rectangles so that adjacent rectangles in the chain have one cell of intersection. This means that all rectangles intersect two other rectangles each in one cell, except for the first and last which only intersect one other. All pairs of rectangles not adjacent in the chain have no intersection, as in regular Shikaku. There are no triple intersections or intersections at clues.
This example uses a 5x5 grid and is intended only to clarify the above rules. The background color in the solution shows chain order of rectangles (from light to dark).
| 6 | 4 | |||
| 6 | 4 | |||
| 6 | 4 |
| 6 | 4 | |||
| 6 | 4 | |||
| 6 | 4 |
| 4 | ||||||||
| 9 | 6 | 3 | ||||||
| 4 | ||||||||
| 10 | ||||||||
| 9 | 9 | |||||||
| 4 | 6 | 9 | 8 | |||||
| 4 | ||||||||
| 9 |
(puzz.link link, without answer checking: here.)
(Note: These are cryptic clues. If you are not familiar with cryptic clues, look at the guide linked in the FAQ.)