Block #1,172,346

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/27/2015, 5:35:58 AM · Difficulty 10.9372 · 5,667,006 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
338f428653c58a975085bef937cf152e056f750120f98192275fffa4b6525db7

Height

#1,172,346

Difficulty

10.937243

Transactions

43

Size

13.62 KB

Version

2

Bits

0aefef25

Nonce

814,662,732

Timestamp

7/27/2015, 5:35:58 AM

Confirmations

5,667,006

Merkle Root

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

3.238 × 10⁹⁴(95-digit number)
32388817317941656378…06922301411795408241
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
3.238 × 10⁹⁴(95-digit number)
32388817317941656378…06922301411795408241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.477 × 10⁹⁴(95-digit number)
64777634635883312756…13844602823590816481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.295 × 10⁹⁵(96-digit number)
12955526927176662551…27689205647181632961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.591 × 10⁹⁵(96-digit number)
25911053854353325102…55378411294363265921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.182 × 10⁹⁵(96-digit number)
51822107708706650205…10756822588726531841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.036 × 10⁹⁶(97-digit number)
10364421541741330041…21513645177453063681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.072 × 10⁹⁶(97-digit number)
20728843083482660082…43027290354906127361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.145 × 10⁹⁶(97-digit number)
41457686166965320164…86054580709812254721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.291 × 10⁹⁶(97-digit number)
82915372333930640328…72109161419624509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.658 × 10⁹⁷(98-digit number)
16583074466786128065…44218322839249018881
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,959,102 XPM·at block #6,839,351 · 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