Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 5 additions & 5 deletions interfaces/IRegistry.sol
Original file line number Diff line number Diff line change
Expand Up @@ -50,7 +50,7 @@ interface IRegistry {
* to pay in ETH or AUTO
* @param target The contract address that needs to be called
* @param referer The referer to get rewarded for referring the sender
* to using Autonomy. Usally the address of a dapp owner
* to using Autonomy. Usually the address of a dapp owner
* @param callData The calldata of the call that the request is to make, i.e.
* the fcn identifier + inputs, encoded
* @param ethForCall The ETH to send with the call
Expand All @@ -68,7 +68,7 @@ interface IRegistry {
* @param isAlive Whether or not the request should be deleted after it's executed
* for the first time. If `true`, the request will exist permanently
* (tho it can be cancelled any time), therefore executing the same
* request repeatedly aslong as the request is executable,
* request repeatedly as long as the request is executable,
* and can be used to create fully autonomous contracts - the
* first single-celled cyber life. We are the gods now
* @return id The id of the request, equal to the index in `_hashedReqs`
Expand All @@ -88,7 +88,7 @@ interface IRegistry {
* a hash of it on-chain in `_hashedReqs`
* @param target The contract address that needs to be called
* @param referer The referer to get rewarded for referring the sender
* to using Autonomy. Usally the address of a dapp owner
* to using Autonomy. Usually the address of a dapp owner
* @param callData The calldata of the call that the request is to make, i.e.
* the fcn identifier + inputs, encoded
* @param ethForCall The ETH to send with the call
Expand All @@ -108,7 +108,7 @@ interface IRegistry {
* @param isAlive Whether or not the request should be deleted after it's executed
* for the first time. If `true`, the request will exist permanently
* (tho it can be cancelled any time), therefore executing the same
* request repeatedly aslong as the request is executable,
* request repeatedly as long as the request is executable,
* and can be used to create fully autonomous contracts - the
* first single-celled cyber life. We are the gods now
* @return id The id of the request, equal to the index in `_hashedReqs`
Expand Down Expand Up @@ -239,5 +239,5 @@ interface IRegistry {

function getExecCountOf(address addr) external view returns (uint);

function getReferalCountOf(address addr) external view returns (uint);
function getReferalCountOf(address addr) external view returns (uint); // TODO typo
}
6 changes: 3 additions & 3 deletions interfaces/IStakeManager.sol
Original file line number Diff line number Diff line change
Expand Up @@ -85,7 +85,7 @@ interface IStakeManager {
* @return epoch Returns the relevant variables for determining the new executor if the executor
* can be updated currently. It can only be updated currently if the stored executor
* is for a previous epoch, and there is some stake in the system. If the executor
* can't be updated currently, then everything execpt `epoch` will return 0
* can't be updated currently, then everything except `epoch` will return 0
*/
function getUpdatedExecRes() external view returns (uint96 epoch, uint randNum, uint idxOfExecutor, address exec);

Expand Down Expand Up @@ -128,7 +128,7 @@ interface IStakeManager {
* the running cumulative and know who happens to have the slot where the
* cumulative stake is 200,000. This has problems when the staking array is
* so large that it costs more than the block gas limit to iterate over, which
* would brick the contract, but also just generally costs alot of gas. Having
* would brick the contract, but also just generally costs a lot of gas. Having
* a set amount of AUTO tokens means you already know everything about every
* element in the array therefore don't need to iterate over it.
* Calling this will add the caller to the array. Calling this will first try
Expand All @@ -148,7 +148,7 @@ interface IStakeManager {
* from the end of the array, so that there are no gaps left, such that 0x00...00
* can never be chosen as an executor
* @param idxs [uint[]] The indices of the user's slots, in order of which they'll be
* removed, which is not necessariy the current indices. E.g. if the `_staking`
* removed, which is not necessary the current indices. E.g. if the `_staking`
* array is [a, b, c, b], and `idxs` = [1, 3], then i=1 will first get
* replaced by i=3 and look like [a, b, c], then it would try and replace i=3
* by the end of the array...but i=3 no longer exists, so it'll revert. In this
Expand Down