Block #2,931,072

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/20/2018, 5:56:08 AM · Difficulty 11.3924 · 3,902,931 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee0e37f78f96fa1b90e1b24f308d4be10c4d2e7775381eee6782d7579ac2450e

Height

#2,931,072

Difficulty

11.392410

Transactions

2

Size

1.14 KB

Version

2

Bits

0b6474f9

Nonce

1,288,456,214

Timestamp

11/20/2018, 5:56:08 AM

Confirmations

3,902,931

Merkle Root

8919a58fa1dfae468af6c874b4bfa3ba2c416137b87a22040ef26b804247af7b
Transactions (2)
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.411 × 10⁹⁶(97-digit number)
24118569832347921491…20460095121964415999
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.411 × 10⁹⁶(97-digit number)
24118569832347921491…20460095121964415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.823 × 10⁹⁶(97-digit number)
48237139664695842983…40920190243928831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.647 × 10⁹⁶(97-digit number)
96474279329391685967…81840380487857663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.929 × 10⁹⁷(98-digit number)
19294855865878337193…63680760975715327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.858 × 10⁹⁷(98-digit number)
38589711731756674387…27361521951430655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.717 × 10⁹⁷(98-digit number)
77179423463513348774…54723043902861311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.543 × 10⁹⁸(99-digit number)
15435884692702669754…09446087805722623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.087 × 10⁹⁸(99-digit number)
30871769385405339509…18892175611445247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.174 × 10⁹⁸(99-digit number)
61743538770810679019…37784351222890495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.234 × 10⁹⁹(100-digit number)
12348707754162135803…75568702445780991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.469 × 10⁹⁹(100-digit number)
24697415508324271607…51137404891561983999
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,916,251 XPM·at block #6,834,002 · 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