Block #2,644,570

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 1:28:16 PM · Difficulty 11.7126 · 4,186,420 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
adedc1347297243612fcaa9785960e49c9e6173cb6c6f42ad6d3a9dd39f4f13c

Height

#2,644,570

Difficulty

11.712607

Transactions

8

Size

1.75 KB

Version

2

Bits

0bb66d70

Nonce

7,361,225

Timestamp

5/2/2018, 1:28:16 PM

Confirmations

4,186,420

Merkle Root

132b7b8c8e97a6f0634ff29c4030aa1633504a17355c16436a5b83e7ee695fbe
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.269 × 10⁹⁴(95-digit number)
12696994545578803577…19851394272704265601
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.269 × 10⁹⁴(95-digit number)
12696994545578803577…19851394272704265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.539 × 10⁹⁴(95-digit number)
25393989091157607155…39702788545408531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.078 × 10⁹⁴(95-digit number)
50787978182315214311…79405577090817062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.015 × 10⁹⁵(96-digit number)
10157595636463042862…58811154181634124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.031 × 10⁹⁵(96-digit number)
20315191272926085724…17622308363268249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.063 × 10⁹⁵(96-digit number)
40630382545852171449…35244616726536499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.126 × 10⁹⁵(96-digit number)
81260765091704342898…70489233453072998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.625 × 10⁹⁶(97-digit number)
16252153018340868579…40978466906145996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.250 × 10⁹⁶(97-digit number)
32504306036681737159…81956933812291993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.500 × 10⁹⁶(97-digit number)
65008612073363474318…63913867624583987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.300 × 10⁹⁷(98-digit number)
13001722414672694863…27827735249167974401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,892,060 XPM·at block #6,830,989 · 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