Block #1,933,208

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2017, 4:22:44 PM · Difficulty 10.7632 · 4,893,870 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1f5ab13f722fe22ebc31a5a1719a48bdc924bb02c7b1a288d365ba442fb7665

Height

#1,933,208

Difficulty

10.763173

Transactions

33

Size

12.25 KB

Version

2

Bits

0ac35f48

Nonce

1,184,860,338

Timestamp

1/10/2017, 4:22:44 PM

Confirmations

4,893,870

Merkle Root

6e9f6ae627619bda9dadfae78cd6b7ccc57fd70f211345756747e51c35652845
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.709 × 10⁹⁴(95-digit number)
17093057185492123699…36216670588604874241
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.709 × 10⁹⁴(95-digit number)
17093057185492123699…36216670588604874241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.418 × 10⁹⁴(95-digit number)
34186114370984247398…72433341177209748481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.837 × 10⁹⁴(95-digit number)
68372228741968494797…44866682354419496961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.367 × 10⁹⁵(96-digit number)
13674445748393698959…89733364708838993921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.734 × 10⁹⁵(96-digit number)
27348891496787397918…79466729417677987841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.469 × 10⁹⁵(96-digit number)
54697782993574795837…58933458835355975681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.093 × 10⁹⁶(97-digit number)
10939556598714959167…17866917670711951361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.187 × 10⁹⁶(97-digit number)
21879113197429918335…35733835341423902721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.375 × 10⁹⁶(97-digit number)
43758226394859836670…71467670682847805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.751 × 10⁹⁶(97-digit number)
87516452789719673340…42935341365695610881
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,860,808 XPM·at block #6,827,077 · 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