Block #2,864,227

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/2/2018, 3:38:13 PM · Difficulty 11.6715 · 3,973,898 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0149c8f54d05b2d6b4819c0d3521792837c55ea49c76a3e79e44674502b6cb81

Height

#2,864,227

Difficulty

11.671515

Transactions

30

Size

8.83 KB

Version

2

Bits

0babe861

Nonce

1,956,858,657

Timestamp

10/2/2018, 3:38:13 PM

Confirmations

3,973,898

Merkle Root

65f43e474aab897a6de04f24442d2b6636a04d7ccc5f1331e742d60678c20f72
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.

6.606 × 10⁹⁴(95-digit number)
66069084858557157384…59413163267868788801
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
6.606 × 10⁹⁴(95-digit number)
66069084858557157384…59413163267868788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.321 × 10⁹⁵(96-digit number)
13213816971711431476…18826326535737577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.642 × 10⁹⁵(96-digit number)
26427633943422862953…37652653071475155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.285 × 10⁹⁵(96-digit number)
52855267886845725907…75305306142950310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.057 × 10⁹⁶(97-digit number)
10571053577369145181…50610612285900620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.114 × 10⁹⁶(97-digit number)
21142107154738290363…01221224571801241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.228 × 10⁹⁶(97-digit number)
42284214309476580726…02442449143602483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.456 × 10⁹⁶(97-digit number)
84568428618953161452…04884898287204966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.691 × 10⁹⁷(98-digit number)
16913685723790632290…09769796574409932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.382 × 10⁹⁷(98-digit number)
33827371447581264580…19539593148819865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.765 × 10⁹⁷(98-digit number)
67654742895162529161…39079186297639731201
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,949,266 XPM·at block #6,838,124 · 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