Block #571,522

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2014, 1:05:45 PM · Difficulty 10.9653 · 6,243,515 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
80f75297df318450fef4780abf7908610865635a188a35035f3fe8725c0187f0

Height

#571,522

Difficulty

10.965322

Transactions

11

Size

4.03 KB

Version

2

Bits

0af71f5a

Nonce

491,440,309

Timestamp

6/1/2014, 1:05:45 PM

Confirmations

6,243,515

Merkle Root

29438e4f126a4fc554e90cfc430acc796df6332732aefa6adc779baecaf4d23c
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.376 × 10⁹⁷(98-digit number)
23766824710338835866…94919435967334058799
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.376 × 10⁹⁷(98-digit number)
23766824710338835866…94919435967334058799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.753 × 10⁹⁷(98-digit number)
47533649420677671732…89838871934668117599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.506 × 10⁹⁷(98-digit number)
95067298841355343464…79677743869336235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.901 × 10⁹⁸(99-digit number)
19013459768271068692…59355487738672470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.802 × 10⁹⁸(99-digit number)
38026919536542137385…18710975477344940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.605 × 10⁹⁸(99-digit number)
76053839073084274771…37421950954689881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.521 × 10⁹⁹(100-digit number)
15210767814616854954…74843901909379763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.042 × 10⁹⁹(100-digit number)
30421535629233709908…49687803818759526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.084 × 10⁹⁹(100-digit number)
60843071258467419817…99375607637519052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.216 × 10¹⁰⁰(101-digit number)
12168614251693483963…98751215275038105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.433 × 10¹⁰⁰(101-digit number)
24337228503386967926…97502430550076211199
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,384 XPM·at block #6,815,036 · 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