Block #352,755

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2014, 1:14:08 PM · Difficulty 10.3112 · 6,461,722 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ff9a1d514653830d035af794446ef48f91380a29f1bad5b96907211b5af54301

Height

#352,755

Difficulty

10.311248

Transactions

4

Size

1.00 KB

Version

2

Bits

0a4fadf7

Nonce

332,811

Timestamp

1/10/2014, 1:14:08 PM

Confirmations

6,461,722

Merkle Root

550efd4eed0c4a0dcf8548ddcd5ec7da783e4a67cb098f88b99ce18b472dc11e
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.484 × 10¹⁰¹(102-digit number)
14841045355087367540…77898784795877724159
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.484 × 10¹⁰¹(102-digit number)
14841045355087367540…77898784795877724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.968 × 10¹⁰¹(102-digit number)
29682090710174735081…55797569591755448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.936 × 10¹⁰¹(102-digit number)
59364181420349470162…11595139183510896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.187 × 10¹⁰²(103-digit number)
11872836284069894032…23190278367021793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.374 × 10¹⁰²(103-digit number)
23745672568139788064…46380556734043586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.749 × 10¹⁰²(103-digit number)
47491345136279576129…92761113468087173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.498 × 10¹⁰²(103-digit number)
94982690272559152259…85522226936174346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.899 × 10¹⁰³(104-digit number)
18996538054511830451…71044453872348692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.799 × 10¹⁰³(104-digit number)
37993076109023660903…42088907744697384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.598 × 10¹⁰³(104-digit number)
75986152218047321807…84177815489394769919
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,759,891 XPM·at block #6,814,476 · 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