Block #571,152

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2014, 7:23:25 AM · Difficulty 10.9651 · 6,243,929 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1c6c651de27b9ba30115f77443c745263bf7c971bb56a828cf62cc6056a3a03

Height

#571,152

Difficulty

10.965108

Transactions

9

Size

2.11 KB

Version

2

Bits

0af7114d

Nonce

126,775,169

Timestamp

6/1/2014, 7:23:25 AM

Confirmations

6,243,929

Merkle Root

6af943b442f9ab2cc46b79c0b0bc8b9b8c15b879638b365f4509eaea29eb1e3b
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.043 × 10⁹⁹(100-digit number)
10433353600307286889…06422375037159050239
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.043 × 10⁹⁹(100-digit number)
10433353600307286889…06422375037159050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.086 × 10⁹⁹(100-digit number)
20866707200614573779…12844750074318100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.173 × 10⁹⁹(100-digit number)
41733414401229147558…25689500148636200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.346 × 10⁹⁹(100-digit number)
83466828802458295116…51379000297272401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.669 × 10¹⁰⁰(101-digit number)
16693365760491659023…02758000594544803839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.338 × 10¹⁰⁰(101-digit number)
33386731520983318046…05516001189089607679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.677 × 10¹⁰⁰(101-digit number)
66773463041966636093…11032002378179215359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.335 × 10¹⁰¹(102-digit number)
13354692608393327218…22064004756358430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.670 × 10¹⁰¹(102-digit number)
26709385216786654437…44128009512716861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.341 × 10¹⁰¹(102-digit number)
53418770433573308874…88256019025433722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.068 × 10¹⁰²(103-digit number)
10683754086714661774…76512038050867445759
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,764,734 XPM·at block #6,815,080 · 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