package tezos-protocol-007-PsDELPH1
Tezos protocol 007-PsDELPH1 package
Install
Dune Dependency
Authors
Maintainers
Sources
tezos-octez-v20.1.tag.bz2
sha256=ddfb5076eeb0b32ac21c1eed44e8fc86a6743ef18ab23fff02d36e365bb73d61
sha512=d22a827df5146e0aa274df48bc2150b098177ff7e5eab52c6109e867eb0a1f0ec63e6bfbb0e3645a6c2112de3877c91a17df32ccbff301891ce4ba630c997a65
doc/src/tezos_raw_protocol_007_PsDELPH1/delegate_services.ml.html
Source file delegate_services.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689
(*****************************************************************************) (* *) (* Open Source License *) (* Copyright (c) 2018 Dynamic Ledger Solutions, Inc. <contact@tezos.com> *) (* *) (* Permission is hereby granted, free of charge, to any person obtaining a *) (* copy of this software and associated documentation files (the "Software"),*) (* to deal in the Software without restriction, including without limitation *) (* the rights to use, copy, modify, merge, publish, distribute, sublicense, *) (* and/or sell copies of the Software, and to permit persons to whom the *) (* Software is furnished to do so, subject to the following conditions: *) (* *) (* The above copyright notice and this permission notice shall be included *) (* in all copies or substantial portions of the Software. *) (* *) (* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR*) (* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *) (* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *) (* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER*) (* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *) (* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER *) (* DEALINGS IN THE SOFTWARE. *) (* *) (*****************************************************************************) open Alpha_context open Misc.Syntax type info = { balance : Tez.t; frozen_balance : Tez.t; frozen_balance_by_cycle : Delegate.frozen_balance Cycle.Map.t; staking_balance : Tez.t; delegated_contracts : Contract_repr.t list; delegated_balance : Tez.t; deactivated : bool; grace_period : Cycle.t; } let info_encoding = let open Data_encoding in conv (fun { balance; frozen_balance; frozen_balance_by_cycle; staking_balance; delegated_contracts; delegated_balance; deactivated; grace_period } -> ( balance, frozen_balance, frozen_balance_by_cycle, staking_balance, delegated_contracts, delegated_balance, deactivated, grace_period )) (fun ( balance, frozen_balance, frozen_balance_by_cycle, staking_balance, delegated_contracts, delegated_balance, deactivated, grace_period ) -> { balance; frozen_balance; frozen_balance_by_cycle; staking_balance; delegated_contracts; delegated_balance; deactivated; grace_period; }) (obj8 (req "balance" Tez.encoding) (req "frozen_balance" Tez.encoding) (req "frozen_balance_by_cycle" Delegate.frozen_balance_by_cycle_encoding) (req "staking_balance" Tez.encoding) (req "delegated_contracts" (list Contract_repr.encoding)) (req "delegated_balance" Tez.encoding) (req "deactivated" bool) (req "grace_period" Cycle.encoding)) module S = struct let path = RPC_path.(open_root / "context" / "delegates") open Data_encoding type list_query = {active : bool; inactive : bool} let list_query : list_query RPC_query.t = let open RPC_query in query (fun active inactive -> {active; inactive}) |+ flag "active" (fun t -> t.active) |+ flag "inactive" (fun t -> t.inactive) |> seal let list_delegate = RPC_service.get_service ~description:"Lists all registered delegates." ~query:list_query ~output:(list Signature.Public_key_hash.encoding) path let path = RPC_path.(path /: Signature.Public_key_hash.rpc_arg) let info = RPC_service.get_service ~description:"Everything about a delegate." ~query:RPC_query.empty ~output:info_encoding path let balance = RPC_service.get_service ~description: "Returns the full balance of a given delegate, including the frozen \ balances." ~query:RPC_query.empty ~output:Tez.encoding RPC_path.(path / "balance") let frozen_balance = RPC_service.get_service ~description: "Returns the total frozen balances of a given delegate, this includes \ the frozen deposits, rewards and fees." ~query:RPC_query.empty ~output:Tez.encoding RPC_path.(path / "frozen_balance") let frozen_balance_by_cycle = RPC_service.get_service ~description: "Returns the frozen balances of a given delegate, indexed by the \ cycle by which it will be unfrozen" ~query:RPC_query.empty ~output:Delegate.frozen_balance_by_cycle_encoding RPC_path.(path / "frozen_balance_by_cycle") let staking_balance = RPC_service.get_service ~description: "Returns the total amount of tokens delegated to a given delegate. \ This includes the balances of all the contracts that delegate to it, \ but also the balance of the delegate itself and its frozen fees and \ deposits. The rewards do not count in the delegated balance until \ they are unfrozen." ~query:RPC_query.empty ~output:Tez.encoding RPC_path.(path / "staking_balance") let delegated_contracts = RPC_service.get_service ~description: "Returns the list of contracts that delegate to a given delegate." ~query:RPC_query.empty ~output:(list Contract_repr.encoding) RPC_path.(path / "delegated_contracts") let delegated_balance = RPC_service.get_service ~description: "Returns the balances of all the contracts that delegate to a given \ delegate. This excludes the delegate's own balance and its frozen \ balances." ~query:RPC_query.empty ~output:Tez.encoding RPC_path.(path / "delegated_balance") let deactivated = RPC_service.get_service ~description: "Tells whether the delegate is currently tagged as deactivated or not." ~query:RPC_query.empty ~output:bool RPC_path.(path / "deactivated") let grace_period = RPC_service.get_service ~description: "Returns the cycle by the end of which the delegate might be \ deactivated if she fails to execute any delegate action. A \ deactivated delegate might be reactivated (without loosing any \ rolls) by simply re-registering as a delegate. For deactivated \ delegates, this value contains the cycle by which they were \ deactivated." ~query:RPC_query.empty ~output:Cycle.encoding RPC_path.(path / "grace_period") end let register () = let open Services_registration in register0 S.list_delegate (fun ctxt q () -> Delegate.list ctxt >>= fun delegates -> match q with | {active = true; inactive = false} -> filter_s (fun pkh -> Delegate.deactivated ctxt pkh >|=? not) delegates | {active = false; inactive = true} -> filter_s (fun pkh -> Delegate.deactivated ctxt pkh) delegates | _ -> return delegates) ; register1 S.info (fun ctxt pkh () () -> Delegate.full_balance ctxt pkh >>=? fun balance -> Delegate.frozen_balance ctxt pkh >>=? fun frozen_balance -> Delegate.frozen_balance_by_cycle ctxt pkh >>= fun frozen_balance_by_cycle -> Delegate.staking_balance ctxt pkh >>=? fun staking_balance -> Delegate.delegated_contracts ctxt pkh >>= fun delegated_contracts -> Delegate.delegated_balance ctxt pkh >>=? fun delegated_balance -> Delegate.deactivated ctxt pkh >>=? fun deactivated -> Delegate.grace_period ctxt pkh >|=? fun grace_period -> { balance; frozen_balance; frozen_balance_by_cycle; staking_balance; delegated_contracts; delegated_balance; deactivated; grace_period; }) ; register1 S.balance (fun ctxt pkh () () -> Delegate.full_balance ctxt pkh) ; register1 S.frozen_balance (fun ctxt pkh () () -> Delegate.frozen_balance ctxt pkh) ; register1 S.frozen_balance_by_cycle (fun ctxt pkh () () -> Delegate.frozen_balance_by_cycle ctxt pkh >|= ok) ; register1 S.staking_balance (fun ctxt pkh () () -> Delegate.staking_balance ctxt pkh) ; register1 S.delegated_contracts (fun ctxt pkh () () -> Delegate.delegated_contracts ctxt pkh >|= ok) ; register1 S.delegated_balance (fun ctxt pkh () () -> Delegate.delegated_balance ctxt pkh) ; register1 S.deactivated (fun ctxt pkh () () -> Delegate.deactivated ctxt pkh) ; register1 S.grace_period (fun ctxt pkh () () -> Delegate.grace_period ctxt pkh) let list ctxt block ?(active = true) ?(inactive = false) () = RPC_context.make_call0 S.list_delegate ctxt block {active; inactive} () let info ctxt block pkh = RPC_context.make_call1 S.info ctxt block pkh () () let balance ctxt block pkh = RPC_context.make_call1 S.balance ctxt block pkh () () let frozen_balance ctxt block pkh = RPC_context.make_call1 S.frozen_balance ctxt block pkh () () let frozen_balance_by_cycle ctxt block pkh = RPC_context.make_call1 S.frozen_balance_by_cycle ctxt block pkh () () let staking_balance ctxt block pkh = RPC_context.make_call1 S.staking_balance ctxt block pkh () () let delegated_contracts ctxt block pkh = RPC_context.make_call1 S.delegated_contracts ctxt block pkh () () let delegated_balance ctxt block pkh = RPC_context.make_call1 S.delegated_balance ctxt block pkh () () let deactivated ctxt block pkh = RPC_context.make_call1 S.deactivated ctxt block pkh () () let grace_period ctxt block pkh = RPC_context.make_call1 S.grace_period ctxt block pkh () () let requested_levels ~default ctxt cycles levels = match (levels, cycles) with | ([], []) -> ok [default] | (levels, cycles) -> (* explicitly fail when requested levels or cycle are in the past... or too far in the future... *) let levels = List.sort_uniq Level.compare (List.concat ( List.map (Level.from_raw ctxt) levels :: List.map (Level.levels_in_cycle ctxt) cycles )) in map (fun level -> let current_level = Level.current ctxt in if Level.(level <= current_level) then ok (level, None) else Baking.earlier_predecessor_timestamp ctxt level >|? fun timestamp -> (level, Some timestamp)) levels module Baking_rights = struct type t = { level : Raw_level.t; delegate : Signature.Public_key_hash.t; priority : int; timestamp : Timestamp.t option; } let encoding = let open Data_encoding in conv (fun {level; delegate; priority; timestamp} -> (level, delegate, priority, timestamp)) (fun (level, delegate, priority, timestamp) -> {level; delegate; priority; timestamp}) (obj4 (req "level" Raw_level.encoding) (req "delegate" Signature.Public_key_hash.encoding) (req "priority" uint16) (opt "estimated_time" Timestamp.encoding)) module S = struct open Data_encoding let custom_root = RPC_path.(open_root / "helpers" / "baking_rights") type baking_rights_query = { levels : Raw_level.t list; cycles : Cycle.t list; delegates : Signature.Public_key_hash.t list; max_priority : int option; all : bool; } let baking_rights_query = let open RPC_query in query (fun levels cycles delegates max_priority all -> {levels; cycles; delegates; max_priority; all}) |+ multi_field "level" Raw_level.rpc_arg (fun t -> t.levels) |+ multi_field "cycle" Cycle.rpc_arg (fun t -> t.cycles) |+ multi_field "delegate" Signature.Public_key_hash.rpc_arg (fun t -> t.delegates) |+ opt_field "max_priority" RPC_arg.int (fun t -> t.max_priority) |+ flag "all" (fun t -> t.all) |> seal let baking_rights = RPC_service.get_service ~description: "Retrieves the list of delegates allowed to bake a block.\n\ By default, it gives the best baking priorities for bakers that \ have at least one opportunity below the 64th priority for the next \ block.\n\ Parameters `level` and `cycle` can be used to specify the (valid) \ level(s) in the past or future at which the baking rights have to \ be returned. Parameter `delegate` can be used to restrict the \ results to the given delegates. If parameter `all` is set, all the \ baking opportunities for each baker at each level are returned, \ instead of just the first one.\n\ Returns the list of baking slots. Also returns the minimal \ timestamps that correspond to these slots. The timestamps are \ omitted for levels in the past, and are only estimates for levels \ later that the next block, based on the hypothesis that all \ predecessor blocks were baked at the first priority." ~query:baking_rights_query ~output:(list encoding) custom_root end let baking_priorities ctxt max_prio (level, pred_timestamp) = Baking.baking_priorities ctxt level >>=? fun contract_list -> let rec loop l acc priority = if Compare.Int.(priority > max_prio) then return (List.rev acc) else let (Misc.LCons (pk, next)) = l in let delegate = Signature.Public_key.hash pk in ( match pred_timestamp with | None -> ok_none | Some pred_timestamp -> Baking.minimal_time ctxt priority pred_timestamp >|? fun t -> Some t ) >>?= fun timestamp -> let acc = {level = level.level; delegate; priority; timestamp} :: acc in next () >>=? fun l -> loop l acc (priority + 1) in loop contract_list [] 0 let remove_duplicated_delegates rights = List.rev @@ fst @@ List.fold_left (fun (acc, previous) r -> if Signature.Public_key_hash.Set.mem r.delegate previous then (acc, previous) else (r :: acc, Signature.Public_key_hash.Set.add r.delegate previous)) ([], Signature.Public_key_hash.Set.empty) rights let register () = let open Services_registration in register0 S.baking_rights (fun ctxt q () -> requested_levels ~default: ( Level.succ ctxt (Level.current ctxt), Some (Timestamp.current ctxt) ) ctxt q.cycles q.levels >>?= fun levels -> let max_priority = match q.max_priority with None -> 64 | Some max -> max in map_s (baking_priorities ctxt max_priority) levels >|=? fun rights -> let rights = if q.all then rights else List.map remove_duplicated_delegates rights in let rights = List.concat rights in match q.delegates with | [] -> rights | _ :: _ as delegates -> let is_requested p = List.exists (Signature.Public_key_hash.equal p.delegate) delegates in List.filter is_requested rights) let get ctxt ?(levels = []) ?(cycles = []) ?(delegates = []) ?(all = false) ?max_priority block = RPC_context.make_call0 S.baking_rights ctxt block {levels; cycles; delegates; max_priority; all} () end module Endorsing_rights = struct type t = { level : Raw_level.t; delegate : Signature.Public_key_hash.t; slots : int list; estimated_time : Time.t option; } let encoding = let open Data_encoding in conv (fun {level; delegate; slots; estimated_time} -> (level, delegate, slots, estimated_time)) (fun (level, delegate, slots, estimated_time) -> {level; delegate; slots; estimated_time}) (obj4 (req "level" Raw_level.encoding) (req "delegate" Signature.Public_key_hash.encoding) (req "slots" (list uint16)) (opt "estimated_time" Timestamp.encoding)) module S = struct open Data_encoding let custom_root = RPC_path.(open_root / "helpers" / "endorsing_rights") type endorsing_rights_query = { levels : Raw_level.t list; cycles : Cycle.t list; delegates : Signature.Public_key_hash.t list; } let endorsing_rights_query = let open RPC_query in query (fun levels cycles delegates -> {levels; cycles; delegates}) |+ multi_field "level" Raw_level.rpc_arg (fun t -> t.levels) |+ multi_field "cycle" Cycle.rpc_arg (fun t -> t.cycles) |+ multi_field "delegate" Signature.Public_key_hash.rpc_arg (fun t -> t.delegates) |> seal let endorsing_rights = RPC_service.get_service ~description: "Retrieves the delegates allowed to endorse a block.\n\ By default, it gives the endorsement slots for delegates that have \ at least one in the next block.\n\ Parameters `level` and `cycle` can be used to specify the (valid) \ level(s) in the past or future at which the endorsement rights \ have to be returned. Parameter `delegate` can be used to restrict \ the results to the given delegates.\n\ Returns the list of endorsement slots. Also returns the minimal \ timestamps that correspond to these slots. The timestamps are \ omitted for levels in the past, and are only estimates for levels \ later that the next block, based on the hypothesis that all \ predecessor blocks were baked at the first priority." ~query:endorsing_rights_query ~output:(list encoding) custom_root end let endorsement_slots ctxt (level, estimated_time) = Baking.endorsement_rights ctxt level >|=? fun rights -> Signature.Public_key_hash.Map.fold (fun delegate (_, slots, _) acc -> {level = level.level; delegate; slots; estimated_time} :: acc) rights [] let register () = let open Services_registration in register0 S.endorsing_rights (fun ctxt q () -> requested_levels ~default:(Level.current ctxt, Some (Timestamp.current ctxt)) ctxt q.cycles q.levels >>?= fun levels -> map_s (endorsement_slots ctxt) levels >|=? fun rights -> let rights = List.concat rights in match q.delegates with | [] -> rights | _ :: _ as delegates -> let is_requested p = List.exists (Signature.Public_key_hash.equal p.delegate) delegates in List.filter is_requested rights) let get ctxt ?(levels = []) ?(cycles = []) ?(delegates = []) block = RPC_context.make_call0 S.endorsing_rights ctxt block {levels; cycles; delegates} () end module Endorsing_power = struct let endorsing_power ctxt (operation, chain_id) = let (Operation_data data) = operation.protocol_data in match data.contents with | Single (Endorsement _) -> Baking.check_endorsement_rights ctxt chain_id {shell = operation.shell; protocol_data = data} >|=? fun (_, slots, _) -> List.length slots | _ -> failwith "Operation is not an endorsement" module S = struct let endorsing_power = let open Data_encoding in RPC_service.post_service ~description: "Get the endorsing power of an endorsement, that is, the number of \ slots that the endorser has" ~query:RPC_query.empty ~input: (obj2 (req "endorsement_operation" Operation.encoding) (req "chain_id" Chain_id.encoding)) ~output:int31 RPC_path.(open_root / "endorsing_power") end let register () = let open Services_registration in register0 S.endorsing_power (fun ctxt () (op, chain_id) -> endorsing_power ctxt (op, chain_id)) let get ctxt block op chain_id = RPC_context.make_call0 S.endorsing_power ctxt block () (op, chain_id) end module Required_endorsements = struct let required_endorsements ctxt block_delay = Baking.minimum_allowed_endorsements ctxt ~block_delay module S = struct type t = {block_delay : Period.t} let required_endorsements_query = let open RPC_query in query (fun block_delay -> {block_delay}) |+ field "block_delay" Period.rpc_arg Period.zero (fun t -> t.block_delay) |> seal let required_endorsements = let open Data_encoding in RPC_service.get_service ~description: "Minimum number of endorsements for a block to be valid, given a \ delay of the block's timestamp with respect to the minimum time to \ bake at the block's priority" ~query:required_endorsements_query ~output:int31 RPC_path.(open_root / "required_endorsements") end let register () = let open Services_registration in register0 S.required_endorsements (fun ctxt {block_delay} () -> return @@ required_endorsements ctxt block_delay) let get ctxt block block_delay = RPC_context.make_call0 S.required_endorsements ctxt block {block_delay} () end module Minimal_valid_time = struct let minimal_valid_time ctxt ~priority ~endorsing_power = Baking.minimal_valid_time ctxt ~priority ~endorsing_power module S = struct type t = {priority : int; endorsing_power : int} let minimal_valid_time_query = let open RPC_query in query (fun priority endorsing_power -> {priority; endorsing_power}) |+ field "priority" RPC_arg.int 0 (fun t -> t.priority) |+ field "endorsing_power" RPC_arg.int 0 (fun t -> t.endorsing_power) |> seal let minimal_valid_time = RPC_service.get_service ~description: "Minimal valid time for a block given a priority and an endorsing \ power." ~query:minimal_valid_time_query ~output:Time.encoding RPC_path.(open_root / "minimal_valid_time") end let register () = let open Services_registration in register0 S.minimal_valid_time (fun ctxt {priority; endorsing_power} () -> Lwt.return @@ minimal_valid_time ctxt ~priority ~endorsing_power) let get ctxt block priority endorsing_power = RPC_context.make_call0 S.minimal_valid_time ctxt block {priority; endorsing_power} () end let register () = register () ; Baking_rights.register () ; Endorsing_rights.register () ; Endorsing_power.register () ; Required_endorsements.register () ; Minimal_valid_time.register () let endorsement_rights ctxt level = Endorsing_rights.endorsement_slots ctxt (level, None) >|=? fun l -> List.map (fun {Endorsing_rights.delegate; _} -> delegate) l let baking_rights ctxt max_priority = let max = match max_priority with None -> 64 | Some m -> m in let level = Level.current ctxt in Baking_rights.baking_priorities ctxt max (level, None) >|=? fun l -> ( level.level, List.map (fun {Baking_rights.delegate; timestamp; _} -> (delegate, timestamp)) l ) let endorsing_power ctxt operation = Endorsing_power.endorsing_power ctxt operation let required_endorsements ctxt delay = Required_endorsements.required_endorsements ctxt delay let minimal_valid_time ctxt priority endorsing_power = Minimal_valid_time.minimal_valid_time ctxt priority endorsing_power
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>