tx · EvY31V1bNyNhGQYVhmj1tC2QbjZJ6o8zhgeS4GKUCP28

3N9ttyLcRwDo7L4EmJkbS3ZFuQJygivupsL:  -0.00500000 Waves

2023.08.13 22:19 [2709199] invoke 3N9ttyLcRwDo7L4EmJkbS3ZFuQJygivupsL > 3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV commitTask()

3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: checked_out_orca_BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_by_92ovWCy1Zf8CSsTLLLssC74m8yn5yPMqVp9fmVacou97: null == null
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_timestamp: 1691954374927 == 1691954374927
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_height: 2709199 == 2709199
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_result: " Linear programming (LP) is a mathematical optimization technique used to determine the best outcome from a set of resources. It involves maximizing or minimizing a linear objective function subject to linear equality and inequality constraints. LP problems are often used in decision-making, such as determining how to allocate scarce resources among competing alternatives. The goal of LP is to find the optimal solution that satisfies all the constraints while meeting the objective function." -> " Linear programming (LP) is a mathematical optimization technique used to determine the best outcome from a set of resources. It involves maximizing or minimizing a linear objective function subject to linear equality and inequality constraints. LP problems are often used in decision-making scenarios where resources need to be allocated efficiently to achieve maximum output. The goal of LP is to find the optimal solution that satisfies all the constraints while meeting the objective function."
3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV: BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_status: "done" == "done"

{ "type": 16, "id": "EvY31V1bNyNhGQYVhmj1tC2QbjZJ6o8zhgeS4GKUCP28", "fee": 500000, "feeAssetId": null, "timestamp": 1691954381411, "version": 2, "chainId": 84, "sender": "3N9ttyLcRwDo7L4EmJkbS3ZFuQJygivupsL", "senderPublicKey": "92ovWCy1Zf8CSsTLLLssC74m8yn5yPMqVp9fmVacou97", "proofs": [ "rhHm1ujsrL3LgsMRJ5qDo6B67K1qEDasGDmqAiCsgcrj48tJH4ro4tV7SK6D8v7QDw2Pj8KbvVcbGDWNfoHsS36" ], "dApp": "3N9tKixzqTYWnEXQxrDQ5pBTGvQd6sFsvmV", "payment": [], "call": { "function": "commitTask", "args": [ { "type": "string", "value": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp" }, { "type": "string", "value": " Linear programming (LP) is a mathematical optimization technique used to determine the best outcome from a set of resources. It involves maximizing or minimizing a linear objective function subject to linear equality and inequality constraints. LP problems are often used in decision-making scenarios where resources need to be allocated efficiently to achieve maximum output. The goal of LP is to find the optimal solution that satisfies all the constraints while meeting the objective function." } ] }, "height": 2709199, "applicationStatus": "succeeded", "spentComplexity": 48, "stateChanges": { "data": [ { "key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_status", "type": "string", "value": "done" }, { "key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_result", "type": "string", "value": " Linear programming (LP) is a mathematical optimization technique used to determine the best outcome from a set of resources. It involves maximizing or minimizing a linear objective function subject to linear equality and inequality constraints. LP problems are often used in decision-making scenarios where resources need to be allocated efficiently to achieve maximum output. The goal of LP is to find the optimal solution that satisfies all the constraints while meeting the objective function." }, { "key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_height", "type": "integer", "value": 2709199 }, { "key": "BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_commit_timestamp", "type": "integer", "value": 1691954374927 }, { "key": "checked_out_orca_BfbbX6zy1o8vngskiJVfSRUDssFyapL2aEmK6iQnQVyx_D2Eu5TQSVkAwDi7WKia7vFRkw5diyFYkCRhRzsVDmjQp_by_92ovWCy1Zf8CSsTLLLssC74m8yn5yPMqVp9fmVacou97", "value": null } ], "transfers": [], "issues": [], "reissues": [], "burns": [], "sponsorFees": [], "leases": [], "leaseCancels": [], "invokes": [] } }

github/deemru/w8io/169f3d6 
22.07 ms