Block #353,500

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 11:37:01 PM · Difficulty 10.3277 · 6,463,175 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd9ad54a844a04346195bb31101599069f7aa3b05f08f0a986492a098944ebc8

Height

#353,500

Difficulty

10.327747

Transactions

11

Size

3.94 KB

Version

2

Bits

0a53e732

Nonce

85,269

Timestamp

1/10/2014, 11:37:01 PM

Confirmations

6,463,175

Merkle Root

621b46fba4d5864d3c15f03f9d6d45e3fc0967100aa94faa1be2f375f0242930
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.138 × 10¹⁰⁰(101-digit number)
11382101633537449691…59406869000448996109
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.138 × 10¹⁰⁰(101-digit number)
11382101633537449691…59406869000448996109
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.276 × 10¹⁰⁰(101-digit number)
22764203267074899383…18813738000897992219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.552 × 10¹⁰⁰(101-digit number)
45528406534149798766…37627476001795984439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.105 × 10¹⁰⁰(101-digit number)
91056813068299597533…75254952003591968879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.821 × 10¹⁰¹(102-digit number)
18211362613659919506…50509904007183937759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.642 × 10¹⁰¹(102-digit number)
36422725227319839013…01019808014367875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.284 × 10¹⁰¹(102-digit number)
72845450454639678026…02039616028735751039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.456 × 10¹⁰²(103-digit number)
14569090090927935605…04079232057471502079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.913 × 10¹⁰²(103-digit number)
29138180181855871210…08158464114943004159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.827 × 10¹⁰²(103-digit number)
58276360363711742421…16316928229886008319
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,777,519 XPM·at block #6,816,674 · 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