Block #349,111

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 5:21:02 AM · Difficulty 10.2687 · 6,466,800 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
486cad0563c8935a4e6820a6abf2f38148941922a0372c7d473e4e583b03e716

Height

#349,111

Difficulty

10.268748

Transactions

8

Size

4.29 KB

Version

2

Bits

0a44cca4

Nonce

57,723

Timestamp

1/8/2014, 5:21:02 AM

Confirmations

6,466,800

Merkle Root

70848e7695432ca212290a417119541fa6adb56a93e37f9ce5346d5174d620bc
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.

5.290 × 10¹⁰²(103-digit number)
52902521841507723499…73701102426985574399
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
5.290 × 10¹⁰²(103-digit number)
52902521841507723499…73701102426985574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.058 × 10¹⁰³(104-digit number)
10580504368301544699…47402204853971148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.116 × 10¹⁰³(104-digit number)
21161008736603089399…94804409707942297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.232 × 10¹⁰³(104-digit number)
42322017473206178799…89608819415884595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.464 × 10¹⁰³(104-digit number)
84644034946412357599…79217638831769190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.692 × 10¹⁰⁴(105-digit number)
16928806989282471519…58435277663538380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.385 × 10¹⁰⁴(105-digit number)
33857613978564943039…16870555327076761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.771 × 10¹⁰⁴(105-digit number)
67715227957129886079…33741110654153523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.354 × 10¹⁰⁵(106-digit number)
13543045591425977215…67482221308307046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.708 × 10¹⁰⁵(106-digit number)
27086091182851954431…34964442616614092799
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,771,397 XPM·at block #6,815,910 · 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