Block #188,104

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/30/2013, 11:42:17 PM · Difficulty 9.8695 · 6,621,349 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
65c4f797a044fd5b43b10bbed2060ace791b28e4187fdb8d6a399f3d7a615c24

Height

#188,104

Difficulty

9.869549

Transactions

2

Size

868 B

Version

2

Bits

09de9ac2

Nonce

9,180

Timestamp

9/30/2013, 11:42:17 PM

Confirmations

6,621,349

Merkle Root

0052ca05f8c11dda87bfdf59e012bb46c36d1c53e2100dc9ab566efa4419196b
Transactions (2)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.578 × 10⁹²(93-digit number)
15781876945181441133…03495969497912204801
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
1.578 × 10⁹²(93-digit number)
15781876945181441133…03495969497912204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.156 × 10⁹²(93-digit number)
31563753890362882266…06991938995824409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.312 × 10⁹²(93-digit number)
63127507780725764533…13983877991648819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.262 × 10⁹³(94-digit number)
12625501556145152906…27967755983297638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.525 × 10⁹³(94-digit number)
25251003112290305813…55935511966595276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.050 × 10⁹³(94-digit number)
50502006224580611626…11871023933190553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.010 × 10⁹⁴(95-digit number)
10100401244916122325…23742047866381107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.020 × 10⁹⁴(95-digit number)
20200802489832244650…47484095732762214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.040 × 10⁹⁴(95-digit number)
40401604979664489301…94968191465524428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.080 × 10⁹⁴(95-digit number)
80803209959328978602…89936382931048857601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,719,695 XPM·at block #6,809,452 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy