Block #353,578

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2014, 12:48:02 AM · Difficulty 10.3287 · 6,464,428 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c73aba8a8c6ec742b2ee4f3fb2ea71d7f7ebe3727c1d9ba662c1ddd19e7e59a2

Height

#353,578

Difficulty

10.328723

Transactions

7

Size

2.07 KB

Version

2

Bits

0a542730

Nonce

184,540

Timestamp

1/11/2014, 12:48:02 AM

Confirmations

6,464,428

Merkle Root

0a418142d1ed03b7a1d061a8fed6335be0216cc31a54e44edb834c9082baa759
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.

4.335 × 10¹⁰²(103-digit number)
43356419702805049079…49330662265747507199
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
4.335 × 10¹⁰²(103-digit number)
43356419702805049079…49330662265747507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.671 × 10¹⁰²(103-digit number)
86712839405610098158…98661324531495014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.734 × 10¹⁰³(104-digit number)
17342567881122019631…97322649062990028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.468 × 10¹⁰³(104-digit number)
34685135762244039263…94645298125980057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.937 × 10¹⁰³(104-digit number)
69370271524488078526…89290596251960115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.387 × 10¹⁰⁴(105-digit number)
13874054304897615705…78581192503920230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.774 × 10¹⁰⁴(105-digit number)
27748108609795231410…57162385007840460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.549 × 10¹⁰⁴(105-digit number)
55496217219590462821…14324770015680921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.109 × 10¹⁰⁵(106-digit number)
11099243443918092564…28649540031361843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.219 × 10¹⁰⁵(106-digit number)
22198486887836185128…57299080062723686399
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,788,113 XPM·at block #6,818,005 · 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