Block #2,943,277

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/28/2018, 5:09:27 PM · Difficulty 11.3938 · 3,897,178 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
549408c9161b84629574cd42c50c376b7296b1a24ade79140e7e2e1471e9cf94

Height

#2,943,277

Difficulty

11.393822

Transactions

32

Size

8.80 KB

Version

2

Bits

0b64d17d

Nonce

141,876,849

Timestamp

11/28/2018, 5:09:27 PM

Confirmations

3,897,178

Merkle Root

2fa7d5322416edbf31be62102bbee7275676eb4a36f969a5a40d2a2d30cc6da1
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.896 × 10⁹⁷(98-digit number)
18964759645595220656…65762546748409692161
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.896 × 10⁹⁷(98-digit number)
18964759645595220656…65762546748409692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.792 × 10⁹⁷(98-digit number)
37929519291190441313…31525093496819384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.585 × 10⁹⁷(98-digit number)
75859038582380882626…63050186993638768641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.517 × 10⁹⁸(99-digit number)
15171807716476176525…26100373987277537281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.034 × 10⁹⁸(99-digit number)
30343615432952353050…52200747974555074561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.068 × 10⁹⁸(99-digit number)
60687230865904706100…04401495949110149121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.213 × 10⁹⁹(100-digit number)
12137446173180941220…08802991898220298241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.427 × 10⁹⁹(100-digit number)
24274892346361882440…17605983796440596481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.854 × 10⁹⁹(100-digit number)
48549784692723764880…35211967592881192961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.709 × 10⁹⁹(100-digit number)
97099569385447529761…70423935185762385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.941 × 10¹⁰⁰(101-digit number)
19419913877089505952…40847870371524771841
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,967,971 XPM·at block #6,840,454 · 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