Block #400,078

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/11/2014, 7:57:53 PM · Difficulty 10.4325 · 6,409,534 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7dcab782c6d063c973363ab0220415199aaa2ccd2533df1c12713bdca2b39d06

Height

#400,078

Difficulty

10.432482

Transactions

8

Size

2.57 KB

Version

2

Bits

0a6eb720

Nonce

11,683

Timestamp

2/11/2014, 7:57:53 PM

Confirmations

6,409,534

Merkle Root

76f47abbf6a1acc7d0c8250b5c6e3ae0c4ea0003de45985dbd2d3d5e666fc4aa
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.

6.878 × 10⁹⁸(99-digit number)
68789728636647247098…05370987798919665919
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
6.878 × 10⁹⁸(99-digit number)
68789728636647247098…05370987798919665919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.375 × 10⁹⁹(100-digit number)
13757945727329449419…10741975597839331839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.751 × 10⁹⁹(100-digit number)
27515891454658898839…21483951195678663679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.503 × 10⁹⁹(100-digit number)
55031782909317797678…42967902391357327359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.100 × 10¹⁰⁰(101-digit number)
11006356581863559535…85935804782714654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.201 × 10¹⁰⁰(101-digit number)
22012713163727119071…71871609565429309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.402 × 10¹⁰⁰(101-digit number)
44025426327454238142…43743219130858618879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.805 × 10¹⁰⁰(101-digit number)
88050852654908476285…87486438261717237759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.761 × 10¹⁰¹(102-digit number)
17610170530981695257…74972876523434475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.522 × 10¹⁰¹(102-digit number)
35220341061963390514…49945753046868951039
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,720,972 XPM·at block #6,809,611 · 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