Block #2,640,772

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 2:58:43 AM · Difficulty 11.5949 · 4,201,088 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a15f3165de6ed33fd0f03cc6182c3db2386bef4e04eed72c0af76ad0fd37e08

Height

#2,640,772

Difficulty

11.594931

Transactions

3

Size

1.21 KB

Version

2

Bits

0b984d64

Nonce

360,312,871

Timestamp

5/1/2018, 2:58:43 AM

Confirmations

4,201,088

Merkle Root

e1049a25c76b8ca2d81443ece9663e7a8e4da9d492f2a54bb5a203858466efcf
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.

7.314 × 10⁹⁴(95-digit number)
73147303017526286813…63926433932739177599
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
7.314 × 10⁹⁴(95-digit number)
73147303017526286813…63926433932739177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.462 × 10⁹⁵(96-digit number)
14629460603505257362…27852867865478355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.925 × 10⁹⁵(96-digit number)
29258921207010514725…55705735730956710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.851 × 10⁹⁵(96-digit number)
58517842414021029451…11411471461913420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.170 × 10⁹⁶(97-digit number)
11703568482804205890…22822942923826841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.340 × 10⁹⁶(97-digit number)
23407136965608411780…45645885847653683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.681 × 10⁹⁶(97-digit number)
46814273931216823560…91291771695307366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.362 × 10⁹⁶(97-digit number)
93628547862433647121…82583543390614732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.872 × 10⁹⁷(98-digit number)
18725709572486729424…65167086781229465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.745 × 10⁹⁷(98-digit number)
37451419144973458848…30334173562458931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.490 × 10⁹⁷(98-digit number)
74902838289946917697…60668347124917862399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,979,257 XPM·at block #6,841,859 · 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