Block #487,946

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/12/2014, 10:51:30 AM · Difficulty 10.6467 · 6,324,525 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6dc281b750824b1e1adfa0acbbcfa5f180a53c02ffcc5d85623fd5d78b6b92c8

Height

#487,946

Difficulty

10.646694

Transactions

9

Size

2.76 KB

Version

2

Bits

0aa58dbb

Nonce

737,883

Timestamp

4/12/2014, 10:51:30 AM

Confirmations

6,324,525

Merkle Root

1140781ac5368110e11c630c50eec14c9ea34aab9a0496d1c1fb7dd15fbf2f61
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.453 × 10⁹⁶(97-digit number)
24539059925733558406…37832543218191254241
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.453 × 10⁹⁶(97-digit number)
24539059925733558406…37832543218191254241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.907 × 10⁹⁶(97-digit number)
49078119851467116812…75665086436382508481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.815 × 10⁹⁶(97-digit number)
98156239702934233624…51330172872765016961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.963 × 10⁹⁷(98-digit number)
19631247940586846724…02660345745530033921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.926 × 10⁹⁷(98-digit number)
39262495881173693449…05320691491060067841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.852 × 10⁹⁷(98-digit number)
78524991762347386899…10641382982120135681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.570 × 10⁹⁸(99-digit number)
15704998352469477379…21282765964240271361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.140 × 10⁹⁸(99-digit number)
31409996704938954759…42565531928480542721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.281 × 10⁹⁸(99-digit number)
62819993409877909519…85131063856961085441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.256 × 10⁹⁹(100-digit number)
12563998681975581903…70262127713922170881
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,743,795 XPM·at block #6,812,470 · 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