Block #2,948,453

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2018, 6:56:47 AM · Difficulty 11.3974 · 3,883,426 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e6a91483cf46b22e0807bd52d32f12b21319ba567036d4ab2c5df6f3a215dbd

Height

#2,948,453

Difficulty

11.397396

Transactions

4

Size

1.29 KB

Version

2

Bits

0b65bbbd

Nonce

1,846,846,751

Timestamp

12/2/2018, 6:56:47 AM

Confirmations

3,883,426

Merkle Root

cec07b086f0104e48f12045bbdbe0e018b230bf2d4f5b70cd4bc58feac0ce91a
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.

9.146 × 10⁹⁵(96-digit number)
91467580039284634068…39893399368166696961
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
9.146 × 10⁹⁵(96-digit number)
91467580039284634068…39893399368166696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.829 × 10⁹⁶(97-digit number)
18293516007856926813…79786798736333393921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.658 × 10⁹⁶(97-digit number)
36587032015713853627…59573597472666787841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.317 × 10⁹⁶(97-digit number)
73174064031427707255…19147194945333575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.463 × 10⁹⁷(98-digit number)
14634812806285541451…38294389890667151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.926 × 10⁹⁷(98-digit number)
29269625612571082902…76588779781334302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.853 × 10⁹⁷(98-digit number)
58539251225142165804…53177559562668605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.170 × 10⁹⁸(99-digit number)
11707850245028433160…06355119125337210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.341 × 10⁹⁸(99-digit number)
23415700490056866321…12710238250674421761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.683 × 10⁹⁸(99-digit number)
46831400980113732643…25420476501348843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.366 × 10⁹⁸(99-digit number)
93662801960227465286…50840953002697687041
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,899,154 XPM·at block #6,831,878 · 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