Block #2,290,755

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/10/2017, 2:11:12 PM · Difficulty 10.9553 · 4,547,607 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4be48a550b10af40bb22969e7d4e5b42556cce1f9ae49f016f9a764248104633

Height

#2,290,755

Difficulty

10.955322

Transactions

2

Size

4.17 KB

Version

2

Bits

0af48ffd

Nonce

581,970,828

Timestamp

9/10/2017, 2:11:12 PM

Confirmations

4,547,607

Merkle Root

eb7b1b60c3863a8e04359d08d56d413817843df03d731b61c5d80d2b0910a72c
Transactions (2)
1 in → 1 out8.3700 XPM110 B
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.

8.447 × 10⁹⁴(95-digit number)
84478436188426720821…77521082566215011201
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
8.447 × 10⁹⁴(95-digit number)
84478436188426720821…77521082566215011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.689 × 10⁹⁵(96-digit number)
16895687237685344164…55042165132430022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.379 × 10⁹⁵(96-digit number)
33791374475370688328…10084330264860044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.758 × 10⁹⁵(96-digit number)
67582748950741376657…20168660529720089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.351 × 10⁹⁶(97-digit number)
13516549790148275331…40337321059440179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.703 × 10⁹⁶(97-digit number)
27033099580296550663…80674642118880358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.406 × 10⁹⁶(97-digit number)
54066199160593101326…61349284237760716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.081 × 10⁹⁷(98-digit number)
10813239832118620265…22698568475521433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.162 × 10⁹⁷(98-digit number)
21626479664237240530…45397136951042867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.325 × 10⁹⁷(98-digit number)
43252959328474481060…90794273902085734401
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,951,164 XPM·at block #6,838,361 · 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