> For the complete documentation index, see [llms.txt](https://labelfi-1.gitbook.io/labelfi/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://labelfi-1.gitbook.io/labelfi/basics/labelfi-solutions/3.5-labelfi-pos-proof-of-stake/3.5.4-advanced-task-assignment.md).

# 3.5.4 Advanced Task Assignment

To gain access to more complex and higher-volume data labeling tasks, a node must stake a higher amount of tokens. The relationship between task complexity and stake is exponential to ensure only high-performing nodes take on critical tasks:

$$
Sadv= γ*exp*(λ\*Tadv)
$$

Where:

* Sadv= stake required for advanced tasks.
* Tadv= complexity of advanced tasks.
* γ and λ are constants that define the exponential increase in stake requirements.