InnovatorsAdoption

Adoption

Adoption is a metric in TIG that acts as a market signal for “which algorithm is performing best”.

Adoption of a Code Submission

The adoption of a Code Submission kk is based on the number of solutions that Benchmarkers find using it.

Let

  • adoptionk(t)\text{adoption}_k(t) = Adoption of Code Submission kk at block tt
  • influencei(t)\text{influence}_i(t) = Influence of Benchmarker ii at block tt
  • qualifiersi,k(t)\text{qualifiers}_{i,k}(t) = Number of solutions that Benchmarker ii produced with Code Submission kk from Benchmarks which qualify in block tt

Then

adoptionk(t)=i(qualifiersi,k(t)kqualifiersi,k(t))influencei(t).\text{adoption}_k(t)= \sum_i \left( \frac{\text{qualifiers}_{i,k}(t)} {\displaystyle\sum_{k'} \text{qualifiers}_{i,k'}(t)} \right) \text{influence}_i(t).

Inside the sum, qualifiersi,k(t)kqualifiersi,k(t)\frac{\text{qualifiers}_{i,k}(t)}{\sum_{k'} \text{qualifiers}_{i,k'}(t)} is how heavily Benchmarker ii used algorithm kk during block tt; multiplying by influencei(t)\text{influence}_i(t) weights that usage by the Benchmarker’s stake for that block.

The result is a single value in [0,1][0,1] that updates every block and feeds directly into reward and merge-point calculations.

Adoption of an Advance Submission

The adoption of an Advance Submissions mm is the sum of the adoption of all Code Submissions referencing it, let KmK_m be the set of Code Submissions that reference mm. Then the adoption of mm at block tt is denoted adoptionm(t)\text{adoption}^m(t) given by

adoptionm(t)=kKmadoptionk(t).\text{adoption}^m(t) = \sum_{k\in K_m} \text{adoption}_k(t).