Block #655,123

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/30/2014, 4:10:06 PM · Difficulty 10.9555 · 6,161,465 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a0f1fc4f6f693ecd5a2020818efc86a1aa73eff4a958a1b1ddda07794c7710f

Height

#655,123

Difficulty

10.955542

Transactions

3

Size

626 B

Version

2

Bits

0af49e6c

Nonce

312,570,181

Timestamp

7/30/2014, 4:10:06 PM

Confirmations

6,161,465

Merkle Root

8cd49c082c471110f85bfb744db960dea0d56fd3dd146da0f67cbadebdee9af0
Transactions (3)
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.095 × 10⁹⁷(98-digit number)
10950465302712654270…05558904166235166721
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.095 × 10⁹⁷(98-digit number)
10950465302712654270…05558904166235166721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.190 × 10⁹⁷(98-digit number)
21900930605425308541…11117808332470333441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.380 × 10⁹⁷(98-digit number)
43801861210850617082…22235616664940666881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.760 × 10⁹⁷(98-digit number)
87603722421701234165…44471233329881333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.752 × 10⁹⁸(99-digit number)
17520744484340246833…88942466659762667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.504 × 10⁹⁸(99-digit number)
35041488968680493666…77884933319525335041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.008 × 10⁹⁸(99-digit number)
70082977937360987332…55769866639050670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.401 × 10⁹⁹(100-digit number)
14016595587472197466…11539733278101340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.803 × 10⁹⁹(100-digit number)
28033191174944394932…23079466556202680321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.606 × 10⁹⁹(100-digit number)
56066382349888789865…46158933112405360641
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,776,827 XPM·at block #6,816,587 · 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