Block #401,177

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/12/2014, 2:07:11 PM · Difficulty 10.4340 · 6,409,907 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0532993135e1604fda00b977190e00243d7b9472de2ad253602ac978e9e40af3

Height

#401,177

Difficulty

10.433954

Transactions

7

Size

2.11 KB

Version

2

Bits

0a6f1796

Nonce

11,884

Timestamp

2/12/2014, 2:07:11 PM

Confirmations

6,409,907

Merkle Root

943f47949ef42f86835291a4c503be5fb87c4066ab2494ee09852ef7f9f8d1f0
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.760 × 10¹⁰²(103-digit number)
37605220441294273676…95417582964975861759
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.760 × 10¹⁰²(103-digit number)
37605220441294273676…95417582964975861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.521 × 10¹⁰²(103-digit number)
75210440882588547353…90835165929951723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.504 × 10¹⁰³(104-digit number)
15042088176517709470…81670331859903447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.008 × 10¹⁰³(104-digit number)
30084176353035418941…63340663719806894079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.016 × 10¹⁰³(104-digit number)
60168352706070837882…26681327439613788159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.203 × 10¹⁰⁴(105-digit number)
12033670541214167576…53362654879227576319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.406 × 10¹⁰⁴(105-digit number)
24067341082428335153…06725309758455152639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.813 × 10¹⁰⁴(105-digit number)
48134682164856670306…13450619516910305279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.626 × 10¹⁰⁴(105-digit number)
96269364329713340612…26901239033820610559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.925 × 10¹⁰⁵(106-digit number)
19253872865942668122…53802478067641221119
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,779 XPM·at block #6,811,083 · 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