Block #2,925,515

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/16/2018, 2:22:20 PM · Difficulty 11.3540 · 3,911,400 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8e43b9054ceaaae4ccbaa2c7546806f6e8c061b1e2618ed8c730d773dc31439

Height

#2,925,515

Difficulty

11.354030

Transactions

19

Size

75.08 KB

Version

2

Bits

0b5aa1b1

Nonce

601,133,582

Timestamp

11/16/2018, 2:22:20 PM

Confirmations

3,911,400

Merkle Root

e20fd49750ec89ed0bb7d849bc86549490d7fb59af272031cbc7930802ec360b
Transactions (19)
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.

2.415 × 10⁹⁵(96-digit number)
24151377860077396306…04258495391642217599
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
2.415 × 10⁹⁵(96-digit number)
24151377860077396306…04258495391642217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.830 × 10⁹⁵(96-digit number)
48302755720154792612…08516990783284435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.660 × 10⁹⁵(96-digit number)
96605511440309585225…17033981566568870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.932 × 10⁹⁶(97-digit number)
19321102288061917045…34067963133137740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.864 × 10⁹⁶(97-digit number)
38642204576123834090…68135926266275481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.728 × 10⁹⁶(97-digit number)
77284409152247668180…36271852532550963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.545 × 10⁹⁷(98-digit number)
15456881830449533636…72543705065101926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.091 × 10⁹⁷(98-digit number)
30913763660899067272…45087410130203852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.182 × 10⁹⁷(98-digit number)
61827527321798134544…90174820260407705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.236 × 10⁹⁸(99-digit number)
12365505464359626908…80349640520815411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.473 × 10⁹⁸(99-digit number)
24731010928719253817…60699281041630822399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,939,614 XPM·at block #6,836,914 · 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