Block #396,442

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2014, 10:05:48 AM · Difficulty 10.4122 · 6,410,300 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0e7bcaddf77d0c299602e3a470a5c77d64b89a963040ec2265c10fe73662e41b

Height

#396,442

Difficulty

10.412210

Transactions

3

Size

626 B

Version

2

Bits

0a698699

Nonce

3,452

Timestamp

2/9/2014, 10:05:48 AM

Confirmations

6,410,300

Merkle Root

d00a6a52e0209fb4cec5c5b99fede463d83c432019bf3b2b71cf12a5a7304a1f
Transactions (3)
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.077 × 10¹⁰⁰(101-digit number)
30775502696224826640…11170776725141831679
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.077 × 10¹⁰⁰(101-digit number)
30775502696224826640…11170776725141831679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.155 × 10¹⁰⁰(101-digit number)
61551005392449653280…22341553450283663359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.231 × 10¹⁰¹(102-digit number)
12310201078489930656…44683106900567326719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.462 × 10¹⁰¹(102-digit number)
24620402156979861312…89366213801134653439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.924 × 10¹⁰¹(102-digit number)
49240804313959722624…78732427602269306879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.848 × 10¹⁰¹(102-digit number)
98481608627919445249…57464855204538613759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.969 × 10¹⁰²(103-digit number)
19696321725583889049…14929710409077227519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.939 × 10¹⁰²(103-digit number)
39392643451167778099…29859420818154455039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.878 × 10¹⁰²(103-digit number)
78785286902335556199…59718841636308910079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.575 × 10¹⁰³(104-digit number)
15757057380467111239…19437683272617820159
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,698,033 XPM·at block #6,806,741 · 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