Participant Categories and Wallets

Where... CoC is the recycling chain of custody P is a Participant Category

$$CoC={\{P_0,P_1,P_2,P_3,P_4,P_5\}}$$

$$P_0=Waste\:Generator$$

$$P_1=Bin\:Custodian(s)$$

$$P_2= Hauler(s)$$

$$P_3=Processor(s)$$

$$P_4=Recycling\: Facility$$

$$P_5=Chain–of–Custody \:Logistics \:Software(s)$$

in the case when... a Participant Category has more than one wallet,the subset contains all wallet–IDs

$$P_x={\{i_0 ,i_1 ,i_2 ,...,i_N\}}$$

$$i = Wallet \:ID$$

$$N = Number \:of \:Wallets in\: a \:Participant \:Category$$

Note that while the Waste Generator and Bin Custodian are usually the same party, offering different roles to each provides opportunities for “shared economy” solutions for public bins. For example, a Gas Station may offer space and bin supervision, serving as a Bin Custodian, for individuals (Waste Generators) to drop off glass bottles. A Bin Custodian can also work with a Bin Sponsor, such as a Consumer Packaged Goods company (CPGs,) a Producer Responsibility Organizations (PRO,) and/or a Non-Governmental Organization (NGO) to share the costs of setting up specialty recycling bin networks while also receiving a portion of $CARROT rewards from recycled MassIDs. In the example above, Coca-Cola could work with gas stations to help fund the recovery of glass bottles.

Other participant categories (Haulers, Processors and Software Providers) may also involve more than one contributor in the recycling process. Expanding further on the prior example, Hauler 1 may perform the pick-up of glass bins at local gas stations in a town, while a different transporter (Hauler 2,) may carry cullet from an accumulation center in town to a different city where a glass bottling plant is located. In this case, there would also be two Processors, the local accumulating facility (Processor 1) and the glass bottling plant (Processor 2.) Processor 2, would serve as a Processor and a Recycler obtaining a $CARROT token allocation for each role.

In the example of more than one Hauler, the set (CoC) would be defined as:

$$where...$$

$$i_0 \:is \:the \:wallet–ID \:of\: Hauler \:one$$

$$i_1 \: is\: the \:wallet–ID \:of \:Hauler\: two$$

$$P_2={\{i_0,i_1\}}$$

The set (CoC) would then be defined as:

$$CoC={\{P_0,P_1, {\{i_0, i_1\}} ,P_3,P_4,P_5\}}$$

or in the instance of multiple processors

$$where...$$

$$i_2\: is \:the \:wallet–ID \:of \:Processor\: one$$

$$i_3\: is \:the\: wallet–ID \:of \:Processor\: two$$

$$P_3={\{i_2,i_3\}}$$

The set (CoC) would then be defined as:

$$CoC={\{P_0,P_1,P_2,{i_2,i_3} ,P_4,P_5\}}$$

These insights on recycling chain of custody (CoC) help to explain how a MassID (CoC) is defined.