-
Notifications
You must be signed in to change notification settings - Fork 10
/
mycofi.py
1521 lines (1194 loc) · 58.9 KB
/
mycofi.py
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
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import uuid
import random
import networkx as nx
import pygame
import math
from collections import deque
# This simulation is an attempt to create a mycofi agent.
# The Mycofi Agent (MA) will have an inital amount of capital $
# MA: Will purchase nearby vouchers and place them in a pool.
# Initialize Pygame
pygame.init()
# Initialize delay_time
delay_time = 100
# Constants
SCREEN_WIDTH, SCREEN_HEIGHT = 1720,880
AGENT_RADIUS = 10
POOL_WIDTH = 10
POOL_HEIGHT = 20
POOL_START_ASSETS = 10
grow_mode = False
MAX_USD_START_BALANCE = 5000
MAX_START_BALANCE = 5000
NUM_AGENTS = 41
PATH_LENGTH = 5
MAX_CONNECTORS = 4
HEALTHY_NUTRIENTS = 10
# Colors
WHITE = (255, 255, 255)
GREEN = (0, 255, 0)
DARK_GREEN = (50, 200, 50)
BLUE = (0, 0, 255)
BLACK = (120, 120, 120)
RED = (255, 0, 0)
# Initialize screen
screen = pygame.display.set_mode((SCREEN_WIDTH, SCREEN_HEIGHT))
pygame.display.set_caption("Pool Transfers")
# Set up the initial graph
Gp = nx.Graph()
pos = nx.spring_layout(Gp)
pos_init = None
# Create the animation
#ani = FuncAnimation(fig, update_graph, interval=1000)
class Voucher:
def __init__(self, name, value, supply, issuer):
self.name = name
self.value = value
self.supply = supply
self.issuer = issuer
#self.id = name #uuid.uuid4()
def __repr__(self):
return f"{self.name}"
#return f"Voucher(Name: {self.name}, Value: {self.value}, Supply: {self.supply}, Issuer: {self.issuer.name})"
class Agent:
def __init__(self, name,index):
self.name = name
self.vouchers = {}
self.index = index
self.issued_voucher = None
self.nutrients = 0
def produce_voucher(self, name, value, supply):
v_name = name+str(self.index)
if name == "USD":
v_name = "USD"
voucher = Voucher(v_name, value, supply, self)
self.vouchers[v_name] = supply # Store the Voucher object
self.issued_voucher = voucher
return voucher
def __repr__(self):
return f"Agent(Name: {self.name})"
class SwapPool:
def __init__(self, name):
self.name = name
self.vouchers = {}
self.exchanges = {} # To track exchanges
self.is_active = 1
self.nutrients = 0
#Adding vouchers to a pool. Note that the amount can be zero
def deposit(self, agent, voucher, amount):
if voucher.supply >= amount: # Compare the supply of the voucher
# Check if the agent has enough supply of the input voucher
if agent.vouchers.get(voucher.name, 0) < amount:
raise ValueError("Agent does not have enough vouchers to deposit.")
agent.vouchers[voucher.name] -= amount
self.vouchers.setdefault(voucher.name, 0)
self.vouchers[voucher.name] += amount
#voucher.supply -= amount # Decrease the supply of the voucher
else:
raise ValueError("Insufficient voucher supply for deposit.")
def exchange(self, agent, input_voucher, output_voucher, amount):
#print("exch1: ",agent,agent.vouchers,input_voucher,output_voucher,amount)
# Check if there's enough supply in the pool for the output voucher
if self.vouchers.get(output_voucher.name, 0) < amount:
raise ValueError("Insufficient supply in pool for exchange.")
# Check if the agent has enough supply of the input voucher
if agent.vouchers.get(input_voucher.name, 0) < amount:
print("error: ",agent,agent.vouchers,input_voucher.name)
raise ValueError("Agent does not have enough vouchers to exchange.")
# Exchange process
self.vouchers[output_voucher.name] -= amount
agent.vouchers.setdefault(output_voucher.name, 0)
agent.vouchers[output_voucher.name] += amount
self.deposit(agent, input_voucher, amount)
#agent tracks teh number of incomming transactions
agent.nutrients += 2
self.nutrients += 2
#print("post enchange: ",agent.vouchers)
# Update exchanges tracking
pair = (input_voucher.name, output_voucher.name)
if pair in self.exchanges:
self.exchanges[pair] += 1
else:
self.exchanges[pair] = 1
return f"Exchanged {amount} of {input_voucher.name} for {amount} of {output_voucher.name}"
def empty(self,all_vouchers):
for voucher_name in self.vouchers:
amount = self.vouchers[voucher_name]
agent = next(voucher.issuer for voucher in all_vouchers if voucher.name == voucher_name)
agent.vouchers[voucher_name] += amount
self.vouchers[voucher_name] = 0
def fill(self,all_vouchers):
for voucher_name in self.vouchers:
agent = next(voucher.issuer for voucher in all_vouchers if voucher.name == voucher_name)
amount = 0
if agent.vouchers[voucher_name] >= 1:
amount = random.randint(1, agent.vouchers.get(voucher_name,0))
else:
continue
agent.vouchers[voucher_name] -= amount
self.vouchers[voucher_name] += amount
def __repr__(self):
return f"SwapPool(Name: {self.name}, Vouchers: {self.vouchers})"
def make_graph(swap_pools):
# Create a graph of the swap pools
G = nx.Graph()
if swap_pools != None:
for pool in swap_pools:
if pool.is_active == 1:
for v_id in pool.vouchers:
G.add_node(v_id)
for other_v_id in pool.vouchers:
if v_id != other_v_id:
G.add_edge(v_id, other_v_id, pool=pool.name)
return G
def bfs_node_levels(graph, start_node):
levels = {start_node: 0}
queue = deque([start_node])
while queue:
node = queue.popleft()
for neighbor in graph.neighbors(node):
if neighbor not in levels:
levels[neighbor] = levels[node] + 1
queue.append(neighbor)
return levels
def find_feasible_paths(G, input_voucher, output_voucher, amount, max_path_length=PATH_LENGTH):
def dfs(current_voucher, target_voucher, path, visited):
if len(path) > max_path_length:
return
if current_voucher == target_voucher:
feasible_paths.append(list(path))
return
for neighbor in G[current_voucher]:
pool_name = G[current_voucher][neighbor]['pool']
pool = next((p for p in swap_pools if p.name == pool_name), None)
if pool and pool.vouchers.get(neighbor, 0) >= amount and neighbor not in visited:
if pool.is_active == 1:
path.append(neighbor)
visited.add(neighbor)
dfs(neighbor, target_voucher, path, visited)
path.pop()
visited.remove(neighbor)
feasible_paths = []
visited = set([input_voucher.name])
dfs(input_voucher.name, output_voucher.name, [input_voucher.name], visited)
return feasible_paths
# Example usage
#paths = find_feasible_paths(G, input_voucher, output_voucher, amount)
def old_find_feasible_paths(G, input_voucher, output_voucher, amount):
try:
# Find all paths using a simple path generator
all_paths = nx.all_simple_paths(G, input_voucher.name, output_voucher.name)
feasible_paths = []
for path in all_paths:
if len(path) > 5: # Limit path length to 10
continue
print("a found ...... ")
feasible = True
for i in range(len(path) - 1):
start_voucher, end_voucher = path[i], path[i + 1]
pool_name = G[start_voucher][end_voucher]['pool']
pool = next(pool for pool in swap_pools if pool.name == pool_name)
# Check if the pool has enough supply
if pool.vouchers.get(end_voucher, 0) < amount:
feasible = False
break
if feasible:
feasible_paths.append(path)
return feasible_paths
except nx.NetworkXNoPath:
return []
def find_best_exchange_route(G, input_voucher, output_voucher):
# Check if both vouchers are in the graph
if input_voucher.name not in G or output_voucher.name not in G:
return None
# Use a breadth-first search to find the shortest path
try:
path = nx.shortest_path(G, input_voucher.name, output_voucher.name)
return path
except nx.NetworkXNoPath:
return None
# Function to print the path and SwapPools
def print_exchange_route(G, path):
if not path:
print("No exchange route found.")
return
#print("expanded exchange route: len:",range(len(path) - 1))
for i in range(len(path) - 1):
start_voucher, end_voucher = path[i], path[i + 1]
# Retrieve the pool name from the edge data
pool_name = G[start_voucher][end_voucher]['pool']
#print(f"Exchange {start_voucher} for {end_voucher} in {pool_name}")
# Function to execute exchanges along the path
def execute_path_exchanges(G, path, amount,agent):
transactions = 0
for i in range(len(path) - 1):
start_voucher_id, end_voucher_id = path[i], path[i + 1]
pool_name = G[start_voucher_id][end_voucher_id]['pool']
pool = next(pool for pool in swap_pools if pool.name == pool_name)
start_voucher = next(voucher for voucher in all_vouchers if voucher.name == start_voucher_id)
end_voucher = next(voucher for voucher in all_vouchers if voucher.name == end_voucher_id)
# Find the agent who owns the start_voucher
#agent = next(agent for agent in all_agents if start_voucher in agent.vouchers.values())
#print("exec path: ",agent,start_voucher,end_voucher,path)
pool.exchange(agent, start_voucher, end_voucher, amount)
transactions += 1
return transactions
def run_exchanges(G,agent,transactions_this_cycle):
global all_agents, all_vouchers_inpools, swap_pools, all_agents_inpools
# For each agent, attempt to make an exchange
#agent = all_agents[0]
path = None
#if len(all_agents_inpools)>0:
if True:
#for agent in all_agents:
agent.nutrients -= 1
if random.random() < 1.25 and agent.vouchers:
input_voucher = agent.issued_voucher#next((v for v in all_vouchers if v.issuer == agent), None)
if agent.vouchers.get(input_voucher.name,0) < 1:
return 0, None
current_bal = agent.vouchers.get(input_voucher.name,0)
#if current_bal < MAX_START_BALANCE/2:
# return transactions_this_cycle, path
#per_bal = current_bal/MAX_START_BAL
amount = min(5,random.randint(1, agent.vouchers.get(input_voucher.name,0)))
#amount = random.randint(1, agent.vouchers.get(input_voucher.name,0))
# Ensure a different Voucher object is selected
#print(all_vouchers)
#print("input: ",input_voucher)
#print("all vouchers in pools len", len(all_vouchers_inpools))
#print("all vouchers in pools", all_vouchers_inpools)
output_voucher = random.choice([v for v in all_vouchers_inpools if v.name != input_voucher.name])
#close_agents = find_closest_agents(zpos[agent.name], 8)
#zclose_agent = next((agent for agent in all_agents_inpools if agent.name == close_agent),None)
#output_voucher = zclose_agent.issued_voucher
#print("tst",input_voucher,output_voucher)
#output_voucher = all_vouchers[len(all_vouchers)-1]
if input_voucher.name in G and output_voucher.name in G:
#print("Find all feasible paths",agent.name, "(",amount,")", input_voucher.name, output_voucher.name)
feasible_paths = find_feasible_paths(G, input_voucher, output_voucher, amount)
if feasible_paths:
# Choose the best path (e.g., the shortest one)
best_path = min(feasible_paths, key=len)
#print("a Best exchange route:", best_path)
#print("all routes:", feasible_paths)
print_exchange_route(G, best_path)
transactions_this_cycle += execute_path_exchanges(G, best_path, amount,agent)
# Create a new path that starts with the agent's name and includes the swap pools
new_path = [agent.name]
for i in range(len(best_path) - 1):
start_voucher, end_voucher = best_path[i], best_path[i + 1]
pool_name = G[start_voucher][end_voucher]['pool']
new_path.append(pool_name)
final_voucher = next(voucher for voucher in all_vouchers if voucher.name == best_path[-1])
final_agent=final_voucher.issuer
#add a final transaction to the issuer of the final voucher
#print("a agent :", agent.vouchers, " final. agent: ", final_agent.vouchers)
final_agent.vouchers[final_voucher.name] += agent.vouchers[final_voucher.name]
agent.vouchers[final_voucher.name] = 0
#print("b agent :", agent.vouchers, " final. agent: ", final_agent.vouchers)
new_path.append(final_agent.name)
#print("final path: ",path)
path = new_path
#print("finished exchange final path: ", path)
if grow_mode:
#attempt to create a small pool.
# find the nearest with no pools or agents around
if agent.nutrients > HEALTHY_NUTRIENTS+2:
agent_pos = zpos[agent.name]
#print(agent.name, " pos: ", agent_pos, " agents in pools: ", all_agents_inpools)
close_agents = find_closest_agents(agent_pos, 8)
created_new = False
#print(" close agents: ", close_agents)
for close_agent in close_agents:
if created_new == False:
zclose_agent = next((agent for agent in all_agents if agent.name == close_agent),None)
if zclose_agent not in all_agents_inpools:
#print("close_agent not in pools: ", close_agent)
new_agent_pos = zpos[close_agent]
new_point = find_midpoint(agent_pos,new_agent_pos)
x1, y1 = new_point
collision = False
for node_name, (node_x, node_y) in zpos.items():
if is_within_circle(x1, y1, node_x, node_y, node_radius*2):
collision = True
break
if collision:
break
new_agents = [agent.name,close_agent]
new_swap_pool = {
'position': new_point,
'connected_agents': new_agents,
'vouchers': {} # Dictionary to store vouchers from each agent
}
pool_name = "SP0"
if swap_pools != None:
pool_name = f"SP{len(swap_pools)}" # Generating a unique name for the pool
else:
swap_pools = []
new_swap_pool = SwapPool(pool_name)
for zagent in new_agents:
agent = next(agent for agent in all_agents if agent.name == zagent)
voucher = agent.issued_voucher
amount = min(POOL_START_ASSETS,random.randint(0, agent.vouchers[voucher.name]))
#amount = random.randint(0, agent.vouchers[voucher.name])
new_swap_pool.deposit(agent, voucher, amount)
if agent not in all_agents_inpools:
all_agents_inpools.append(agent)
if voucher not in all_vouchers_inpools:
all_vouchers_inpools.append(voucher)
created_new = True
agent.nutrients = 0 #reset nutrient counter
swap_pools.append(new_swap_pool)
zpos[pool_name] = new_point
if agent.nutrients > HEALTHY_NUTRIENTS + 2: #The agent has nutrition but can't find a new place to put a pool should add an arm to an existing pool if the pool has less than 4 vouchers already
close_pools = find_closest_pool(agent_pos, 4)
created_new_branch = False
#print(" close Pools: ", close_pools)
for close_pool in close_pools:
if created_new_branch == False:
zclose_pool = next((pool for pool in swap_pools if pool.name == close_pool),None)
num_branches = len(zclose_pool.vouchers)
if num_branches < MAX_CONNECTORS:
update_swap_pool(close_pool,num_branches+1,zpos[close_pool])
created_new_branch = True
agent.nutrients = agent.nutrients - 10*num_branches
return transactions_this_cycle, path
# Function to create a pool between two vouchers
def create_pool(v1, v2, pool_name):
global swap_pools
pool = None
# Check if a pool already exists containing both vouchers
for existing_pool in swap_pools:
if v1.name in existing_pool.vouchers and v2.name in existing_pool.vouchers:
# A pool with both vouchers already exists, return None
return None
# Ensure that the deposit amount does not exceed the voucher supply
agent_v1 = v1.issuer
agent_v2 = v2.issuer
amount_v1 = min(random.randint(1, 50), agent_v1.vouchers.get(v1.name, 0))
amount_v2 = min(random.randint(1, 50), agent_v2.vouchers.get(v2.name, 0))
# Deposit only if both agents have enough vouchers
if amount_v1 > 0 or amount_v2 > 0:
pool = SwapPool(pool_name)
swap_pools.append(pool)
if amount_v1 >= 0:
pool.deposit(agent_v1, v1, amount_v1)
if amount_v2 >= 0:
pool.deposit(agent_v2, v2, amount_v2)
return pool
def run_pool_swaps(G):
# Performing 20 Random Exchanges by pools
for _ in range(0):
pool = random.choice(swap_pools)
if len(pool.vouchers) > 1:
v1_id, v2_id = random.sample(pool.vouchers.keys(), 2)
# Retrieve the actual Voucher objects
input_voucher = next(voucher for voucher in all_vouchers if voucher.name == v1_id)
output_voucher = next(voucher for voucher in all_vouchers if voucher.name == v2_id)
# Find the agents who own these vouchers
agent1 = next((agent for agent in all_agents if input_voucher in agent.vouchers.values()), None)
# Perform exchange with Voucher objects
if agent1 and input_voucher and output_voucher:
amount = min(min(random.randint(1, 10),agent1.vouchers.get(input_voucher.name, 0).supply),pool.vouchers[output_voucher.name])
if amount > 0:
print("exchange amount:", amount, agent1, input_voucher.name,output_voucher.name)
path = find_best_exchange_route(G, input_voucher, output_voucher)
print("Best exchange route:", path)
print_exchange_route(G, path)
#print("exchange pool b:", pool)
pool.exchange(agent1, input_voucher, output_voucher, amount)
#print("exchange pool a:", pool)
def create_random_pools():
# Ensure that every voucher is represented at least once
for voucher in all_vouchers:
agent = next((a for a in all_agents if voucher.name in a.vouchers), None)
if agent:
pool = random.choice(swap_pools)
amount = random.randint(1, min(500, agent.vouchers[voucher.name]))
pool.deposit(agent, voucher, amount)
# Further distribute remaining vouchers randomly
for _ in range(len(all_vouchers), len(swap_pools) * 5):
voucher = random.choice(all_vouchers)
agent = next((a for a in all_agents if voucher.name in a.vouchers), None)
if agent:
valid_pools = [p for p in swap_pools if len(p.vouchers) < 5 and voucher.name not in p.vouchers]
if valid_pools:
pool = random.choice(valid_pools)
amount = random.randint(1, min(500, agent.vouchers[voucher.name]))
pool.deposit(agent, voucher, amount)
def create_branches(voucher, depth, max_depth, chain_index, chain):
global used_vouchers, swap_pools
#if depth > max_depth:
# used_vouchers.add(voucher)
# return
if max_depth < 1:
used_vouchers.add(voucher)
return chain
#print("YYYYYYYYYYYYYY", swap_pools)
#print("bb voucher", voucher)
# Determine the number of branches at this level
branch_length = max_depth#random.randint(1, 3) if depth < max_depth else random.randint(0, 2)
branch_vouchers = []
used_vouchers.add(voucher)
for b in range(branch_length):
# Select available vouchers for branching that haven't been used in this specific branch
available_vouchers = [v for v in chain if v != voucher and v not in used_vouchers]
if not available_vouchers:
break
branch_voucher = random.choice(available_vouchers)
pool_index = len(swap_pools)+1
branch_pool_name = f"SP{pool_index}"
zpool = create_pool(voucher, branch_voucher, branch_pool_name)
#print("a depth: ", depth, " vouchers a:: ",voucher.name, " b: ",branch_voucher.name, zpool)
#print("b pool: ", zpool)
used_vouchers.add(branch_voucher)
branch_vouchers.append(branch_voucher)
new_chain = [x for x in chain[1:]]
for bv in branch_vouchers:
#print("old chain: ",chain)
#new_chain = [x for x in chain[1:]]
# New chain is the old chain without the current voucher
new_chain = [x for x in chain if x != voucher and x != branch_voucher and x not in branch_vouchers]
#print("new chain: ",new_chain)
# Recursive call to create further branches
chain = new_chain
chain = create_branches(branch_voucher, depth + 1, max_depth - 1, chain_index, new_chain)
return new_chain
def create_chained_branching_pools():
global all_vouchers, swap_pools, used_vouchers
swap_pools = [SwapPool(f"SP{i}") for i in range(1, 6)]
swap_pools.clear() # Clear existing pools
usd_vouchers = [v for v in all_vouchers if v.name == 'USD']
usd_voucher = usd_vouchers[0]
non_usd_vouchers = [v for v in all_vouchers if v.name != 'USD']
# Divide non-USD vouchers into three groups for the main chains
chain_length = len(non_usd_vouchers) // 4
main_chains = [non_usd_vouchers[i:i + chain_length] for i in range(0, len(non_usd_vouchers), chain_length)]
# Adjust the last main chain to include the remaining vouchers
if len(non_usd_vouchers) % 4 != 0:
main_chains[-1].extend(non_usd_vouchers[-(len(non_usd_vouchers) % 3):])
#print("mc: ",main_chains)
max_depth = 3 # Increased maximum depth for more branching
for chain_index, chain in enumerate(main_chains, start=1):
if used_vouchers == None:
used_vouchers = set()
#for i, voucher in enumerate(chain):
main_pool_name = f"SP{chain_index}M{chain_index}"
next_voucher = chain[0] #if i == len(chain) - 1 else chain[i + 1]
#print("next voucher: ", next_voucher)
create_pool(usd_voucher, next_voucher, main_pool_name)
used_vouchers.add(usd_voucher)
# Initiate branching from each voucher in the main chain
#print("UUUUUUUUUUUUUUUUUUUUUsed_vouchers: ",used_vouchers)
#print("swap-pool: ",swap_pools)
# Recursive call to create further branches
for voucher in enumerate(chain, start=1):
#print("aa voucher: ",voucher)
create_branches(voucher[1], 1, max_depth, chain_index, chain)
return swap_pools
def create_chained_branching_pools_alt():
global all_vouchers, swap_pools, used_vouchers
# Additional Swap Pool with random vouchers
# Create a new graph for Agent-Swap Pool interactions
G_agents_pools_tmp = nx.Graph()
# Add nodes for agents and swap pools
G_agents_pools_tmp.add_node('b0', node_type='agent', level=0)
# Establish connections
for pool in swap_pools:
# Connect pools to agents based on voucher issuers
for voucher_name in pool.vouchers.keys():
voucher = next(voucher for voucher in all_vouchers if voucher.name == voucher_name)
issuer_name = voucher.issuer.name
G_agents_pools_tmp.add_node(pool.name, node_type='pool')
G_agents_pools_tmp.add_node(issuer_name, node_type='agent')
G_agents_pools_tmp.add_edge(pool.name, issuer_name)
#print("edge: ", pool.name, issuer_name)
# Calculate node levels from the 'b0' node
levels = nx.single_source_shortest_path_length(G_agents_pools_tmp, 'b0')
low_level_agents = []
for level in range(max(levels.values()) + 1):
if level < max(levels.values()) + 1 - 3:
continue
level_nodes = [node for node, lvl in levels.items() if lvl == level]
for i, node in enumerate(level_nodes):
if G_agents_pools_tmp.nodes[node]['node_type'] == 'agent':
low_level_agents.append(node)
#print("low lvl: ", low_level_agents)
#if False:
if len(low_level_agents) >= 5:
random_vouchers = random.sample(low_level_agents, 8)
additional_pool_name = "uteo"
additional_pool = SwapPool(additional_pool_name)
for agent_name in random_vouchers:
agent = next(zagent for zagent in all_agents if zagent.name == agent_name)
voucher = agent.issued_voucher
#print("agent: ",agent, agent.vouchers,voucher.name)
amount = random.randint(1, min(500, agent.vouchers[voucher.name]))
additional_pool.deposit(voucher.issuer, voucher, amount)
swap_pools.append(additional_pool)
def draw_agent_swap_pool_grid(agents, swap_pools, screen, recent_exchange_path):
global G_agents_pools, zpos
# Define the area for the diagram
diagram_width = SCREEN_WIDTH - 500
diagram_height = SCREEN_HEIGHT - 50
diagram_x_offset = 50
diagram_y_offset = 50
# Create a new graph for Agent-Swap Pool interactions
G_agents_pools = nx.Graph()
# Add nodes for agents and swap pools
G_agents_pools.add_node('b0', node_type='agent', level=0)
for agent in all_agents:
G_agents_pools.add_node(agent.name, node_type='agent')
# Establish connections
if swap_pools != None:
for pool in swap_pools:
# Connect pools to agents based on voucher issuers
for voucher_name in pool.vouchers.keys():
voucher = next(voucher for voucher in all_vouchers if voucher.name == voucher_name)
issuer_name = voucher.issuer.name
G_agents_pools.add_node(pool.name, node_type='pool')
G_agents_pools.add_node(issuer_name, node_type='agent')
G_agents_pools.add_edge(pool.name, issuer_name)
#print("edge: ", pool.name, issuer_name)
# Calculate node positions
if zpos is None:
zpos = {}
# Grid layout parameters
grid_size = int(math.ceil(math.sqrt(len(agents))))
grid_spacing = 100
# Find center grid coordinates
center_x, center_y = SCREEN_WIDTH // 2, SCREEN_HEIGHT // 2
start_x = center_x - (grid_size // 2) * grid_spacing
start_y = center_y - (grid_size // 2) * grid_spacing
# Place 'b0' in the center
zpos['b0'] = (center_x, center_y)
# Place other agents in the grid
agent_index = 0
for row in range(grid_size):
for col in range(grid_size):
if row == grid_size // 2 and col == grid_size // 2:
continue # Skip the center for 'b0'
if agent_index >= len(agents):
break
agent_x = start_x + col * grid_spacing
agent_y = start_y + row * grid_spacing
zpos[agents[agent_index].name] = (agent_x, agent_y)
agent_index += 1
if toggle_mutual:
zpos['uteo'] = (SCREEN_WIDTH / 3+20, SCREEN_HEIGHT - 2*diagram_y_offset)
# Draw edges, nodes, and labels
node_radius = 20
voucher_radius = 5
font = pygame.font.Font(None, 16)
balance_font = pygame.font.Font(None, 15)
# Draw the most recent exchange as a curved blue line
if recent_exchange_path and len(recent_exchange_path) > 1:
curve_points = [zpos[node] for node in recent_exchange_path if node in zpos]
if len(curve_points) > 1:
#print("curve points: ", curve_points)
#pygame.draw.lines(screen, (0, 0, 255), False, curve_points, 2)
itter = 0
for point in curve_points:
if itter+1 >= len(curve_points):
break
draw_curved_line(point, curve_points[itter+1], GREEN, 10)
itter += 1
# Draw edges (straight black lines)
for u, v, data in G_agents_pools.edges(data=True):
pygame.draw.line(screen, (0, 0, 0), zpos[u], zpos[v], 2)
# Draw vouchers inside each pool with their amounts
for node, (x, y) in zpos.items():
node_color = 'red'
node_type = G_agents_pools.nodes[node]['node_type']
#print("node: ", node)
#print(all_agents_inpools)
if node_type == 'agent':
node_color = 'red'
agent = next((zagent for zagent in all_agents if zagent.name == node),None)
if agent.nutrients >= HEALTHY_NUTRIENTS:
node_color = 'green'
pygame.draw.circle(screen, pygame.Color(node_color), (int(x), int(y)), node_radius)
elif node_type == 'pool':
node_color = 'blue'
pool = next(p for p in swap_pools if p.name == node)
if pool and not getattr(pool, "is_active", 2): # Check if the pool is inactive
node_color = BLACK # Inactive pools in black
pygame.draw.rect(screen, pygame.Color(node_color), pygame.Rect(int(x)-POOL_WIDTH/2, int(y)-POOL_HEIGHT/2,POOL_WIDTH,POOL_HEIGHT))
angle = 0
angle_step = 360 / len(pool.vouchers)
for voucher_name in pool.vouchers:
voucher_amount = pool.vouchers[voucher_name] # Get the amount of voucher in the pool
voucher_x = x + (node_radius + 5) * math.cos(math.radians(angle))
voucher_y = y + (node_radius + 5) * math.sin(math.radians(angle))
# Render the voucher name
voucher_name_label = font.render(voucher_name, True, (0, 0, 0))
voucher_name_label_rect = voucher_name_label.get_rect()
voucher_name_label_rect.center = (int(voucher_x), int(voucher_y) - 5) # Shift upwards for vertical centering
screen.blit(voucher_name_label, voucher_name_label_rect)
# Render the voucher amount
voucher_amount_label = font.render(str(voucher_amount), True, (0, 0, 0))
voucher_amount_label_rect = voucher_amount_label.get_rect()
voucher_amount_label_rect.center = (int(voucher_x), int(voucher_y) + 5) # Shift downwards for vertical centering
screen.blit(voucher_amount_label, voucher_amount_label_rect)
angle += angle_step
if node_type == 'agent':
agent_d = next(ag for ag in agents if ag.name == node)
total_supply = agent_d.vouchers[agent_d.issued_voucher.name]
# Render agent's name and total supply as separate lines, centered in the red circle
agent_label_name = font.render(agent_d.name, True, (255, 255, 255))
agent_label_supply = font.render(str(total_supply), True, (255, 255, 255))
# Calculate positions for both lines to center them inside the red circle
agent_label_name_rect = agent_label_name.get_rect()
agent_label_name_rect.center = (int(x), int(y) - 10) # Shift name slightly above circle center
agent_label_supply_rect = agent_label_supply.get_rect()
agent_label_supply_rect.center = (int(x), int(y) + 10) # Shift supply slightly below circle center
screen.blit(agent_label_name, agent_label_name_rect)
screen.blit(agent_label_supply, agent_label_supply_rect)
def draw_agent_swap_pool_diagram(agents, swap_pools, screen, recent_exchange_path):
global G_agents_pools, zpos
# Define the area for the diagram
diagram_width = SCREEN_WIDTH - 500
diagram_height = SCREEN_HEIGHT - 50
diagram_x_offset = 50
diagram_y_offset = 50
# Create a new graph for Agent-Swap Pool interactions
G_agents_pools = nx.Graph()
# Add nodes for agents and swap pools
G_agents_pools.add_node('b0', node_type='agent', level=0)
# Establish connections
for pool in swap_pools:
# Connect pools to agents based on voucher issuers
for voucher_name in pool.vouchers.keys():
voucher = next(voucher for voucher in all_vouchers if voucher.name == voucher_name)
issuer_name = voucher.issuer.name
G_agents_pools.add_node(pool.name, node_type='pool')
G_agents_pools.add_node(issuer_name, node_type='agent')
G_agents_pools.add_edge(pool.name, issuer_name)
#print("edge: ", pool.name, issuer_name)
# Calculate node levels from the 'b0' node
levels = nx.single_source_shortest_path_length(G_agents_pools, 'b0')
# Position nodes level by level
if zpos == None:
zpos = {'b0': (SCREEN_WIDTH / 2, diagram_y_offset)}
for level in range(max(levels.values()) + 1):
level_nodes = [node for node, lvl in levels.items() if lvl == level]
num_nodes = len(level_nodes)
x_step = diagram_width / max(num_nodes, 1)
y_position = diagram_y_offset + level * (diagram_height / (max(levels.values()) + 1))
for i, node in enumerate(level_nodes):
x_position = diagram_x_offset + i * x_step
zpos[node] = (x_position, y_position)
zpos['b0'] = (SCREEN_WIDTH / 3+20, diagram_y_offset)
# Check if the key 'uteo' exists in the 'pos' dictionary
if toggle_mutual:
zpos['uteo'] = (SCREEN_WIDTH / 3+20, SCREEN_HEIGHT - 2*diagram_y_offset)
# Draw edges, nodes, and labels
node_radius = 20
voucher_radius = 5
font = pygame.font.Font(None, 16)
balance_font = pygame.font.Font(None, 15)
# Draw the most recent exchange as a curved blue line
if recent_exchange_path and len(recent_exchange_path) > 1:
curve_points = [zpos[node] for node in recent_exchange_path if node in zpos]
if len(curve_points) > 1:
#print("curve points: ", curve_points)
#pygame.draw.lines(screen, (0, 0, 255), False, curve_points, 2)
itter = 0
for point in curve_points:
if itter+1 >= len(curve_points):
break
draw_curved_line(point, curve_points[itter+1], GREEN, 10)
itter += 1
# Draw edges (straight black lines)
for u, v, data in G_agents_pools.edges(data=True):
pygame.draw.line(screen, (0, 0, 0), zpos[u], zpos[v], 2)
# Draw vouchers inside each pool with their amounts
for node, (x, y) in zpos.items():
node_color = 'red' if G_agents_pools.nodes[node]['node_type'] == 'agent' else 'blue'
if node_color == 'blue':
pool = next((p for p in swap_pools if p.name == node), None)
if pool and not getattr(pool, "is_active", 2): # Check if the pool is inactive
node_color = BLACK # Inactive pools in black
pygame.draw.rect(screen, pygame.Color(node_color), pygame.Rect(int(x)-5, int(y)-10,10,20))
else:
pygame.draw.circle(screen, pygame.Color(node_color), (int(x), int(y)), node_radius)
if G_agents_pools.nodes[node]['node_type'] == 'pool':
pool = next(p for p in swap_pools if p.name == node)
angle = 0
angle_step = 360 / len(pool.vouchers)
for voucher_name in pool.vouchers:
voucher_amount = pool.vouchers[voucher_name] # Get the amount of voucher in the pool
voucher_x = x + (node_radius + 5) * math.cos(math.radians(angle))
voucher_y = y + (node_radius + 5) * math.sin(math.radians(angle))
# Render the voucher name
voucher_name_label = font.render(voucher_name, True, (0, 0, 0))
voucher_name_label_rect = voucher_name_label.get_rect()
voucher_name_label_rect.center = (int(voucher_x), int(voucher_y) - 5) # Shift upwards for vertical centering
screen.blit(voucher_name_label, voucher_name_label_rect)
# Render the voucher amount
voucher_amount_label = font.render(str(voucher_amount), True, (0, 0, 0))
voucher_amount_label_rect = voucher_amount_label.get_rect()
voucher_amount_label_rect.center = (int(voucher_x), int(voucher_y) + 5) # Shift downwards for vertical centering
screen.blit(voucher_amount_label, voucher_amount_label_rect)
angle += angle_step
if node_color == 'red':
agent_d = next(ag for ag in agents if ag.name == node)
total_supply = agent_d.vouchers[agent_d.issued_voucher.name]
# Render agent's name and total supply as separate lines, centered in the red circle
agent_label_name = font.render(agent_d.name, True, (255, 255, 255))
agent_label_supply = font.render(str(total_supply), True, (255, 255, 255))
# Calculate positions for both lines to center them inside the red circle
agent_label_name_rect = agent_label_name.get_rect()
agent_label_name_rect.center = (int(x), int(y) - 10) # Shift name slightly above circle center
agent_label_supply_rect = agent_label_supply.get_rect()
agent_label_supply_rect.center = (int(x), int(y) + 10) # Shift supply slightly below circle center
screen.blit(agent_label_name, agent_label_name_rect)
screen.blit(agent_label_supply, agent_label_supply_rect)
def draw_network_diagram(agents, liquidity_pools, screen):
global G, pos
G = Gp
#pos = nx.spectral_layout(G)
# Get the screen dimensions
screen_width = min(500, screen.get_width())
screen_height = min(600, screen.get_height())
# Find the minimum and maximum positions of nodes in the layout
min_x = min(x for x, _ in pos.values())
max_x = max(x for x, _ in pos.values())
min_y = min(y for _, y in pos.values())
max_y = max(y for _, y in pos.values())
# Calculate scaling factors and offsets to fit and center the graph on the right half
x_scale = (screen_width - 50) / (max_x - min_x) # 200 for left offset and 100 for right border
y_scale = (screen_height - 50) / (max_y - min_y) # 100 for top and bottom borders
scale = min(x_scale, y_scale)
x_offset = 1300+screen_width - 100 - (max_x - min_x) * scale # 100-pixel right border
y_offset = (screen_height - (max_y - min_y) * scale) / 2 + 100 # 100-pixel top border
# Draw edges with weights (you may need to customize this part)
for u, v, data in G.edges(data=True):
u_x = (pos[u][0] - min_x) * scale + x_offset
u_y = (pos[u][1] - min_y) * scale + y_offset
v_x = (pos[v][0] - min_x) * scale + x_offset
v_y = (pos[v][1] - min_y) * scale + y_offset
pygame.draw.line(screen, (0, 0, 255), (u_x, u_y), (v_x, v_y), 2)
# Draw nodes as larger circles with labels inside
node_radius = 15 # Increase the radius for larger circles
node_color = 'black'
font = pygame.font.Font(None, 18)
for node, (x, y) in pos.items():
x = (x - min_x) * scale + x_offset
y = (y - min_y) * scale + y_offset