This proposal aims to increase the Council members' seats to 8 in Q4. Both presented for Phala Network and Khala Network.
At the moment, the Khala Council has five members. I think reaching eight members can help the Phala community grow into more democratic status.
Eight will not be the final result. The council will propose new seats supply based on how the network grows in the future.
Anyone can apply for the council seat!
I, as an independent individual in the Phala community, will personally hope to see the candidate fit with the following traits:
For example, it's welcome for council candidates to make a statement on Phala forum as a running statement:
Phala Network will follow the council members from Khala Network so that all running events will be applied from Khala Network:
The following introduction is from Polkadot Wiki. Phala/Khala Network follows the same rules.
There are practical limits to Council Members' curation capabilities when it comes to treasury proposals: Council members likely do not have the expertise to properly assess the activities described in all submissions. Even if individual Councillors have that expertise, it is improbable that a majority of members are capable of such diverse topics.
Bounties Spending proposals aim to delegate the curation activity of spending proposals to experts called Curators: They can be defined as addresses with the agency over a portion of the Treasury with the goal of fixing a bug or vulnerability, developing a strategy, or monitoring a set of tasks related to a specific topic: all for the benefit of the Polkadot ecosystem.
A proposer can submit a bounty proposal for the council to pass, with a curator to be defined later, whose background and expertise are such that they are capable of determining when the task is complete. Curators are selected by the council after the bounty proposal passes and need to add an upfront payment to take the position. This deposit can be used to punish them if they act maliciously. However, if they are successful in their task of getting someone to complete the bounty work, they will receive their deposit back and part of the bounty reward.
When submitting the value of the bounty, the proposer includes a reward for curators willing to invest their time and expertise in the task: this amount is included in the total value of the bounty. In this sense, the curator's fee can be defined as the result of subtracting the value paid to the bounty rewards from the total value of the bounty.
In general terms, curators are expected to have a well-balanced track record related to the issues the bounty tries to resolve: they should be at least knowledgeable on the topics the bounty touches and show project management skills or experience. These recommendations ensure the effective use of the mechanism. A Bounty Spending is a reward for a specified body of work - or specified set of objectives - that needs to be executed for a predefined treasury amount to be paid out. The responsibility of assigning a payout address once the specified set of goals is completed is delegated to the curator.
After the council has activated a bounty, it delegates the work that requires expertise to the curator, who gets to close the active bounty. Closing the active bounty enacts a delayed payout to the payout address and a payout of the curator fee. The delay phase allows the council to act if any issues arise.
To minimize storage on the chain in the same way as any proposal, bounties don't contain contextual information. When a user submits a bounty spending proposal, they will probably need to find an off-chain way to explain the proposal (any of the available community forums serve this purpose). This template can help as a checklist of all needed information for the council to make an informed decision.
The bounty has a predetermined duration of 90 days, with the possibility of being extended by the curator. Aiming to maintain flexibility in the tasks' curation, the curator will be able to create sub-bounties for more granularity and allocation in the next iteration of the mechanism.