find prime

prime.js

// find prime, example from Web Workers

var n = 1,
    i,
    q;
search: while (true) {
    n += 1;
    for (i = 2, q = Math.sqrt(n); i <= q; i++) {
        if (n % i === 0) {
            continue search;
        }
    }
    
    console.log('new prime %s is found', n);
}