Block #2,643,381

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 2:17:16 AM · Difficulty 11.6814 · 4,193,019 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1dedd98dd3629d8fc79f43103f14322f2b444903edb8bebba15ff87ca4f512f8

Height

#2,643,381

Difficulty

11.681445

Transactions

8

Size

3.43 KB

Version

2

Bits

0bae7327

Nonce

571,890,843

Timestamp

5/2/2018, 2:17:16 AM

Confirmations

4,193,019

Merkle Root

b8a9a9ae74f8d0ec2eaaf39c249de1013e1d183aecac63d1c439087342472137
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.071 × 10⁹⁴(95-digit number)
10710296239397831333…31351308142114695841
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.071 × 10⁹⁴(95-digit number)
10710296239397831333…31351308142114695841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.142 × 10⁹⁴(95-digit number)
21420592478795662666…62702616284229391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.284 × 10⁹⁴(95-digit number)
42841184957591325333…25405232568458783361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.568 × 10⁹⁴(95-digit number)
85682369915182650667…50810465136917566721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.713 × 10⁹⁵(96-digit number)
17136473983036530133…01620930273835133441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.427 × 10⁹⁵(96-digit number)
34272947966073060266…03241860547670266881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.854 × 10⁹⁵(96-digit number)
68545895932146120533…06483721095340533761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.370 × 10⁹⁶(97-digit number)
13709179186429224106…12967442190681067521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.741 × 10⁹⁶(97-digit number)
27418358372858448213…25934884381362135041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.483 × 10⁹⁶(97-digit number)
54836716745716896427…51869768762724270081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.096 × 10⁹⁷(98-digit number)
10967343349143379285…03739537525448540161
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,935,463 XPM·at block #6,836,399 · 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