Block #1,708,212

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2016, 7:57:45 PM · Difficulty 10.6352 · 5,122,960 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ab2f55410a1744ff84299cfa869abfe61a303acad673e65b36745dee97055f6

Height

#1,708,212

Difficulty

10.635168

Transactions

2

Size

2.04 KB

Version

2

Bits

0aa29a67

Nonce

61,754,870

Timestamp

8/8/2016, 7:57:45 PM

Confirmations

5,122,960

Merkle Root

e21f69da82d4ba5d773ebbba33fe4693bac027d960640193706073978e11d565
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.

7.548 × 10⁹³(94-digit number)
75484561193547166771…17635611548134533631
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
7.548 × 10⁹³(94-digit number)
75484561193547166771…17635611548134533631
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.509 × 10⁹⁴(95-digit number)
15096912238709433354…35271223096269067261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.019 × 10⁹⁴(95-digit number)
30193824477418866708…70542446192538134521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.038 × 10⁹⁴(95-digit number)
60387648954837733417…41084892385076269041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.207 × 10⁹⁵(96-digit number)
12077529790967546683…82169784770152538081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.415 × 10⁹⁵(96-digit number)
24155059581935093366…64339569540305076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.831 × 10⁹⁵(96-digit number)
48310119163870186733…28679139080610152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.662 × 10⁹⁵(96-digit number)
96620238327740373467…57358278161220304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.932 × 10⁹⁶(97-digit number)
19324047665548074693…14716556322440609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.864 × 10⁹⁶(97-digit number)
38648095331096149387…29433112644881218561
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,893,518 XPM·at block #6,831,171 · 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.
Privacy Policy·

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