The 64 thousand Euro challenge

This is a challenge to anyone to write a computer simulation of a Bell-CHSH type experiment which reliably violates the Bell-CHSH inequality and which does not violate locality.
The program runs on a single computer. The rules are designed so that no one has to check the code. One just has to check that it satisfies the specifications listed below.
The program must accept as input two streams of settings “1” or “2” of equal length
It will output two streams of outcomes “+1” or “-1” of the same length
The length can be any positive integer
The program must have a “set seed” facility
It must have the following properties:
When given the same seed and the same input streams it produces the same outcomes
When only Alice’s last input is changed then Bob’s last output does not change
When only Bob’s last input is changed then Alice’s last output does not change
When two inputs are added two new outputs are generated but the earlier outputs do not change
The programmer should aim to get a large positive correlation on one setting combination but otherwise a large negative correlation
The programmer wins my challenge with one correlation larger than 0.8 and three correlations smaller than -0.8
This must be attained in runs of length 10 000 with settings supplied by me (simulated fair coin tosses)
It must be reproducible (several testers using different computers and freely choosing different seeds must confirm)
Comments and questions are welcome!
The program runs on a single computer. The rules are designed so that no one has to check the code. One just has to check that it satisfies the specifications listed below.
The program must accept as input two streams of settings “1” or “2” of equal length
It will output two streams of outcomes “+1” or “-1” of the same length
The length can be any positive integer
The program must have a “set seed” facility
It must have the following properties:
When given the same seed and the same input streams it produces the same outcomes
When only Alice’s last input is changed then Bob’s last output does not change
When only Bob’s last input is changed then Alice’s last output does not change
When two inputs are added two new outputs are generated but the earlier outputs do not change
The programmer should aim to get a large positive correlation on one setting combination but otherwise a large negative correlation
The programmer wins my challenge with one correlation larger than 0.8 and three correlations smaller than -0.8
This must be attained in runs of length 10 000 with settings supplied by me (simulated fair coin tosses)
It must be reproducible (several testers using different computers and freely choosing different seeds must confirm)
Comments and questions are welcome!