Block #395,278

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2014, 2:38:03 PM · Difficulty 10.4126 · 6,415,734 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
66353fac231be2d88ed11555a42a6f1f7459b60c81db490c83676a7e597d863e

Height

#395,278

Difficulty

10.412612

Transactions

1

Size

904 B

Version

2

Bits

0a69a0ed

Nonce

361,403

Timestamp

2/8/2014, 2:38:03 PM

Confirmations

6,415,734

Merkle Root

ffb9f1f9ada25dbe9a99cf751a729bc3f833a3fb59eac1fbb497f58e6c1053d2
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.118 × 10¹⁰²(103-digit number)
31187213499226696314…85219559974710430719
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.118 × 10¹⁰²(103-digit number)
31187213499226696314…85219559974710430719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.237 × 10¹⁰²(103-digit number)
62374426998453392628…70439119949420861439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.247 × 10¹⁰³(104-digit number)
12474885399690678525…40878239898841722879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.494 × 10¹⁰³(104-digit number)
24949770799381357051…81756479797683445759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.989 × 10¹⁰³(104-digit number)
49899541598762714102…63512959595366891519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.979 × 10¹⁰³(104-digit number)
99799083197525428204…27025919190733783039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.995 × 10¹⁰⁴(105-digit number)
19959816639505085640…54051838381467566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.991 × 10¹⁰⁴(105-digit number)
39919633279010171281…08103676762935132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.983 × 10¹⁰⁴(105-digit number)
79839266558020342563…16207353525870264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.596 × 10¹⁰⁵(106-digit number)
15967853311604068512…32414707051740528639
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,732,201 XPM·at block #6,811,011 · 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.

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