Block #582,597

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/9/2014, 7:31:34 PM · Difficulty 10.9595 · 6,229,735 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19771442e9d41edcd86c88b8e430fc523bc5cac047c4fb81f6f07b43606b119d

Height

#582,597

Difficulty

10.959534

Transactions

6

Size

1.30 KB

Version

2

Bits

0af5a40b

Nonce

134,803,029

Timestamp

6/9/2014, 7:31:34 PM

Confirmations

6,229,735

Merkle Root

06754a55715ade7d6303eb9f40d3649523b3a35f965a5170aab00b05e0b49b2a
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.

7.477 × 10⁹⁸(99-digit number)
74773455398199661767…65980541637932098559
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
7.477 × 10⁹⁸(99-digit number)
74773455398199661767…65980541637932098559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.495 × 10⁹⁹(100-digit number)
14954691079639932353…31961083275864197119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.990 × 10⁹⁹(100-digit number)
29909382159279864707…63922166551728394239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.981 × 10⁹⁹(100-digit number)
59818764318559729414…27844333103456788479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.196 × 10¹⁰⁰(101-digit number)
11963752863711945882…55688666206913576959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.392 × 10¹⁰⁰(101-digit number)
23927505727423891765…11377332413827153919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.785 × 10¹⁰⁰(101-digit number)
47855011454847783531…22754664827654307839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.571 × 10¹⁰⁰(101-digit number)
95710022909695567062…45509329655308615679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.914 × 10¹⁰¹(102-digit number)
19142004581939113412…91018659310617231359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.828 × 10¹⁰¹(102-digit number)
38284009163878226825…82037318621234462719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.656 × 10¹⁰¹(102-digit number)
76568018327756453650…64074637242468925439
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,742,674 XPM·at block #6,812,331 · 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.

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