# Manas(hopinheimer) - week 12 & 13 ### updates - Past 2 weeks were spent to implementing the Rated list spec into the simulator. The simulator currently is capable of the following - generating graph: there were two case here, we could use a random graph by using something like `erodos renygi` but we decided that generating a graph in a rate list style tree would give us more flexiblity. - iterateing through `SampleIds` and backfill score data structure in the simulated node, per block. - down scoring bad actors and removing them from the simulate network graph ### plans for next week I did some fuzzy testing on the current implementation, and results were not as predicted. there seems to be some cases where the scoring function falls into a recursive loop. over the next I'll work on the scoring logic and may be some restructuring of the simulator implementation.