Block #1,534,766

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 11:14:13 AM · Difficulty 10.6183 · 5,279,704 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ded8119df19664de76344c4eb31ee116fe44a89f0749593a3c98aea4a25610fe

Height

#1,534,766

Difficulty

10.618319

Transactions

2

Size

7.61 KB

Version

2

Bits

0a9e4a24

Nonce

1,874,680,533

Timestamp

4/10/2016, 11:14:13 AM

Confirmations

5,279,704

Merkle Root

d5e8c61ca25b9ce9ca6115640f598c22fa0b399bba5684a6e1595cd793bb334b
Transactions (2)
1 in → 1 out8.9400 XPM109 B
51 in → 1 out3155.3611 XPM7.42 KB
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.

2.427 × 10⁹⁶(97-digit number)
24274662474918326323…12021737988915855361
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
2.427 × 10⁹⁶(97-digit number)
24274662474918326323…12021737988915855361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.854 × 10⁹⁶(97-digit number)
48549324949836652646…24043475977831710721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.709 × 10⁹⁶(97-digit number)
97098649899673305292…48086951955663421441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.941 × 10⁹⁷(98-digit number)
19419729979934661058…96173903911326842881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.883 × 10⁹⁷(98-digit number)
38839459959869322116…92347807822653685761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.767 × 10⁹⁷(98-digit number)
77678919919738644233…84695615645307371521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.553 × 10⁹⁸(99-digit number)
15535783983947728846…69391231290614743041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.107 × 10⁹⁸(99-digit number)
31071567967895457693…38782462581229486081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.214 × 10⁹⁸(99-digit number)
62143135935790915386…77564925162458972161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.242 × 10⁹⁹(100-digit number)
12428627187158183077…55129850324917944321
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,759,834 XPM·at block #6,814,469 · 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