Block #574,322

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/3/2014, 6:41:18 AM · Difficulty 10.9674 · 6,252,333 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1021f161b99428dd743c6db90c23c3dd71f4d6ceb9b22e9d1325cc1e6cc5c48d

Height

#574,322

Difficulty

10.967437

Transactions

5

Size

1.37 KB

Version

2

Bits

0af7a9fa

Nonce

205,532,311

Timestamp

6/3/2014, 6:41:18 AM

Confirmations

6,252,333

Merkle Root

323c41a3b26ba0bfe579f8efdeb0675396b0850b524e6f9c516905c35d1047cd
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.971 × 10⁹⁷(98-digit number)
29713500474206957473…27799770787197885499
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.971 × 10⁹⁷(98-digit number)
29713500474206957473…27799770787197885499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.942 × 10⁹⁷(98-digit number)
59427000948413914946…55599541574395770999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.188 × 10⁹⁸(99-digit number)
11885400189682782989…11199083148791541999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.377 × 10⁹⁸(99-digit number)
23770800379365565978…22398166297583083999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.754 × 10⁹⁸(99-digit number)
47541600758731131956…44796332595166167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.508 × 10⁹⁸(99-digit number)
95083201517462263913…89592665190332335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.901 × 10⁹⁹(100-digit number)
19016640303492452782…79185330380664671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.803 × 10⁹⁹(100-digit number)
38033280606984905565…58370660761329343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.606 × 10⁹⁹(100-digit number)
76066561213969811131…16741321522658687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.521 × 10¹⁰⁰(101-digit number)
15213312242793962226…33482643045317375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.042 × 10¹⁰⁰(101-digit number)
30426624485587924452…66965286090634751999
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,857,390 XPM·at block #6,826,654 · 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