if you were going to design a filesystem for solid-state storage (instead of linear or rotational media), could you implement wear-leveling by determining where

if you were going to design a filesystem for solid-state storage (instead of linear or rotational media), could you implement wear-leveling by determining where to place the next segment of a file by hashing it, and using the hash as its address, updating the linked-list/tree/table/whathaveyounot that tracks where files exist?