@woben.near [Posted on Developer DAO Board](https://near.social/#/devgovgigs.near/widget/Post?id=550) ## Idea: Transaction prioritization RFP **Context** Currently there is no way to prioritize transactions on Near. Validators are free to pack transactions into a chunk however they want, provided that they follow some [predefined rules](https://nomicon.io/ChainSpec/Transactions#transaction-ordering). The lack of prioritization mechanism is usually not a problem since transactions are quite cheap and today the blocks are less than 5% full. However, if blocks become very full in the future, users may want to prioritize their transactions to finish faster so that they can prevent a large position from being liquidated or perform an arbitrage. Without a proper mechanism built into the protocol, users in those situations will likely just spam a large volume of transactions hoping that one of them will be picked up first, which further exacerbates the congestion of the network. **Request** As a result, the protocol working group would like to create a RFP for a proper solution to this problem. The RFP consists of two parts: design and implementation. A successful design should be a [NEP](https://github.com/near/NEPs/blob/master/neps/nep-0001.md) that is approved by the protocol working group. A successful implementation is one or more pull requests to [nearcore](https://github.com/near/nearcore) that implements the design. If you are interested in working on this, please feel free to check out [previous discussions on github](https://github.com/near/NEPs/issues/476) and join [zulip](https://near.zulipchat.com/) if you would like to discuss this with the community of protocol developers. **Funding** * Design of the solution: 3000 NEAR * Implementation of the solution: 7000 NEAR