Block #441,663

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/13/2014, 7:28:03 AM · Difficulty 10.3482 · 6,383,859 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aca72bec588c73960db5898b3fde664308bf010bfb53ed392ad0c2fa1fb7ffd2

Height

#441,663

Difficulty

10.348186

Transactions

6

Size

2.09 KB

Version

2

Bits

0a5922b1

Nonce

113,610

Timestamp

3/13/2014, 7:28:03 AM

Confirmations

6,383,859

Merkle Root

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

3.490 × 10¹⁰¹(102-digit number)
34907166866661591981…10640675233369186279
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
3.490 × 10¹⁰¹(102-digit number)
34907166866661591981…10640675233369186279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.981 × 10¹⁰¹(102-digit number)
69814333733323183963…21281350466738372559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.396 × 10¹⁰²(103-digit number)
13962866746664636792…42562700933476745119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.792 × 10¹⁰²(103-digit number)
27925733493329273585…85125401866953490239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.585 × 10¹⁰²(103-digit number)
55851466986658547170…70250803733906980479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.117 × 10¹⁰³(104-digit number)
11170293397331709434…40501607467813960959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.234 × 10¹⁰³(104-digit number)
22340586794663418868…81003214935627921919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.468 × 10¹⁰³(104-digit number)
44681173589326837736…62006429871255843839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.936 × 10¹⁰³(104-digit number)
89362347178653675473…24012859742511687679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.787 × 10¹⁰⁴(105-digit number)
17872469435730735094…48025719485023375359
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,848,272 XPM·at block #6,825,521 · 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