Block #2,922,884

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/14/2018, 5:33:49 PM · Difficulty 11.3612 · 3,919,748 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d1d652defb316d3c895d084ed3fd1bcdd8e74d155f75c34ca9c792e42adc294

Height

#2,922,884

Difficulty

11.361231

Transactions

16

Size

5.87 KB

Version

2

Bits

0b5c79a0

Nonce

75,280,660

Timestamp

11/14/2018, 5:33:49 PM

Confirmations

3,919,748

Merkle Root

2fa060a43ce5d3c5adf7ba98b06f3ccc3a39a842cfdea0e4fb6a7e4800c7f18b
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.055 × 10⁹³(94-digit number)
10552382127899845606…81593090400743542481
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.055 × 10⁹³(94-digit number)
10552382127899845606…81593090400743542481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.110 × 10⁹³(94-digit number)
21104764255799691212…63186180801487084961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.220 × 10⁹³(94-digit number)
42209528511599382425…26372361602974169921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.441 × 10⁹³(94-digit number)
84419057023198764850…52744723205948339841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.688 × 10⁹⁴(95-digit number)
16883811404639752970…05489446411896679681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.376 × 10⁹⁴(95-digit number)
33767622809279505940…10978892823793359361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.753 × 10⁹⁴(95-digit number)
67535245618559011880…21957785647586718721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.350 × 10⁹⁵(96-digit number)
13507049123711802376…43915571295173437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.701 × 10⁹⁵(96-digit number)
27014098247423604752…87831142590346874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.402 × 10⁹⁵(96-digit number)
54028196494847209504…75662285180693749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.080 × 10⁹⁶(97-digit number)
10805639298969441900…51324570361387499521
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,985,489 XPM·at block #6,842,631 · 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