Giter Site home page Giter Site logo

evidences's Introduction

Evidences

This repository contains all the Evidences filed as part of the Retention and Promotion of members of the Polkadot Technical Fellowship. These Evidences have been submitted for the discussion and review of individual members' contributions and achievements, as well as for the Fellowship's on-chain bodies to signal approval or disapproval of.

Scope

The Fellowship is about retaining protocol expertise from developers, but also ideators, designers, formalisers and research analysts. According to Section 4 of the Fellowship Manifesto, members of the Polkadot Fellowship are responsible for expertise on a technology (or a specific implementation of it) required and primarily used for the Polkadot (Main) Network to continue operating and improving.

Specifically, this expertise may cover contributions in the following areas:

  • the internals of all functional Polkadot node implementations;
  • cryptographic data-structures, algorithms, languages and APIs required for the continued upkeep of the Polkadot (Main) Network;
  • consensus algorithms concerning the Relay-chain (BABE & GRANDPA);
  • trust-free bridges relying on said consensus algorithms (planned to be) utilised by system chains;
  • parachain consensus;
  • cross-chain message passing (XCMP, HRMP, DMP & UMP);
  • the Polkadot libp2p-based peer networking protocol;
  • the Polkadot topology strategies;
  • chain synchronisation strategies utilised by Polkadot;
  • the Polkadot business-logic (aka the 'runtime');
  • pallets utilised by the Polkadot (Main) Network and its system chains;
  • the internals of the frame pallet framework;
  • runtime and host APIs;
  • the XCM specification and realisation;
  • standard RPCs;
  • user-interface code required to practically execute upgrades to the Polkadot (Main) Network; and
  • code or technology required by, and utilised primarily for, any code or technology already included.

However, some technologies/code fall out of this scope, notably:

  • Rust language (required by realisations of the Polkadot Network, but not primarily used for them);
  • libp2p (required by the Polkadot Network but not primarily used for it);
  • ‘subxt‘ (useful tooling, but not required for Polkadot’s continued operation); and
  • ‘ink!’ (useful tooling, but not required for Polkadot’s continued operation).

Evidences are scoped to the subset of these concerns which must be held consistent across all evaluations for Retention and Promotion.

Significance

Evidences are a proof of work to indicate the Fellowship's commitment to implement and maintain designs and architectures for Polkadot (Main) Network, as well as participate in discussion and social consensus according to open-source principles.

All members that have been inducted for standard allowance as per the Fellowship Salaries must submit their Evidences once over a period of time (3 months for Rank I-II, 6 months for Rank III-VI) to avoid demotion to a lower rank.

All members must serve a minimum period of service of 12 months at their current rank before seeking promotion to a higher rank.

Process

The process for submitting Evidences is open to all existing Fellowship members (i.e Rank I to IX). Anyone may provide comments on submitted Evidences.

To submit an Evidence, follow these steps:

  • Fork the Evidences repository
  • Create a new folder in the evidence folder and rename it to match your Github username
  • Copy the 0000-evidence-template.md file into the new folder and rename it to match the title of your request
  • Fill out the Evidence template and open a PR.
  • Announce the evidence to the fellowship and wait at least one week.
  • If there are no major push backs by the fellowship, submit the evidence on-chain with the fellowshipCore.submitEvidence(wish, evidence) call on the Polkadot Collectives chain, where wish is the nature of the request (Retention or Promotion) and evidence is the blake2-256 hash of the raw evidence text.

Once the request has been approved via on-chain referendum, the PR can be merged. This on-chain process is designed to be resilient to where the Evidences are hosted and in what format, so it can be migrated away from GitHub in the future. The Fellowship should not approve more than one Evidence with the same number. PRs may be closed by their author, when sufficiently stale, or after a period of 6 months without approval.

Communication channels

The Fellowship is using Matrix for communication. Right now there exists two channels:

evidences's People

Contributors

anaelleltd avatar liamaharon avatar bkchr avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.