Well, if you can do square root, you can do n^1.5 easily enough (and I guess n^0.25, etc.). n log n is also implementable without enormous difficulty, I believe (couldn't be wrong, I haven't actually implemented it and worked out all the annoying details).

I don't know what that does to curation rewards though, maybe you addressed in a different comment and I didn't see.