Block #1,580,992

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/12/2016, 2:59:42 AM · Difficulty 10.6658 · 5,258,197 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dc6c20b58f9cf2f41a6cc5cb31ad575749803d4de025edeaf62191c718aa1663

Height

#1,580,992

Difficulty

10.665842

Transactions

2

Size

1.57 KB

Version

2

Bits

0aaa74a4

Nonce

320,344,101

Timestamp

5/12/2016, 2:59:42 AM

Confirmations

5,258,197

Merkle Root

60121c7a21e563dec660936c098d9a18127a92c550e87464f62352b29288c4f5
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.

5.612 × 10⁹²(93-digit number)
56126390965672014405…34210612373188965279
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
5.612 × 10⁹²(93-digit number)
56126390965672014405…34210612373188965279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.122 × 10⁹³(94-digit number)
11225278193134402881…68421224746377930559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.245 × 10⁹³(94-digit number)
22450556386268805762…36842449492755861119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.490 × 10⁹³(94-digit number)
44901112772537611524…73684898985511722239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.980 × 10⁹³(94-digit number)
89802225545075223048…47369797971023444479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.796 × 10⁹⁴(95-digit number)
17960445109015044609…94739595942046888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.592 × 10⁹⁴(95-digit number)
35920890218030089219…89479191884093777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.184 × 10⁹⁴(95-digit number)
71841780436060178438…78958383768187555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.436 × 10⁹⁵(96-digit number)
14368356087212035687…57916767536375111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.873 × 10⁹⁵(96-digit number)
28736712174424071375…15833535072750223359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.747 × 10⁹⁵(96-digit number)
57473424348848142751…31667070145500446719
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,957,789 XPM·at block #6,839,188 · 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