Block #2,649,556

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/5/2018, 8:14:07 AM · Difficulty 11.7635 · 4,191,501 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb609e657c8bcef38c202401b3cd2c71969da5793e100ceb2e07b9f1e94bcca6

Height

#2,649,556

Difficulty

11.763541

Transactions

12

Size

2.67 KB

Version

2

Bits

0bc37768

Nonce

41,549,598

Timestamp

5/5/2018, 8:14:07 AM

Confirmations

4,191,501

Merkle Root

462e8b263d256e698295f71e97314927bb8f0aa93b952866567c593771bbcc29
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.697 × 10⁹³(94-digit number)
76972936865110381682…61306700919318920801
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.697 × 10⁹³(94-digit number)
76972936865110381682…61306700919318920801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.539 × 10⁹⁴(95-digit number)
15394587373022076336…22613401838637841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.078 × 10⁹⁴(95-digit number)
30789174746044152673…45226803677275683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.157 × 10⁹⁴(95-digit number)
61578349492088305346…90453607354551366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.231 × 10⁹⁵(96-digit number)
12315669898417661069…80907214709102732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.463 × 10⁹⁵(96-digit number)
24631339796835322138…61814429418205465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.926 × 10⁹⁵(96-digit number)
49262679593670644277…23628858836410931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.852 × 10⁹⁵(96-digit number)
98525359187341288554…47257717672821862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.970 × 10⁹⁶(97-digit number)
19705071837468257710…94515435345643724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.941 × 10⁹⁶(97-digit number)
39410143674936515421…89030870691287449601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.882 × 10⁹⁶(97-digit number)
78820287349873030843…78061741382574899201
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,972,818 XPM·at block #6,841,056 · 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