Block #404,166

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/14/2014, 4:00:10 PM · Difficulty 10.4345 · 6,410,687 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c5e4edc767d943673532bb73e4716e64cb77aa78412f9a701ad7a57a1048c086

Height

#404,166

Difficulty

10.434543

Transactions

2

Size

3.17 KB

Version

2

Bits

0a6f3e32

Nonce

235,792

Timestamp

2/14/2014, 4:00:10 PM

Confirmations

6,410,687

Merkle Root

83ba6ac792699c25c50dd7f483f8ee5f6eebb2ad1e4185fd869b844c5ea791fc
Transactions (2)
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.

2.078 × 10⁹⁵(96-digit number)
20789487323902271954…73142811832698766959
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
2.078 × 10⁹⁵(96-digit number)
20789487323902271954…73142811832698766959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.157 × 10⁹⁵(96-digit number)
41578974647804543908…46285623665397533919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.315 × 10⁹⁵(96-digit number)
83157949295609087816…92571247330795067839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.663 × 10⁹⁶(97-digit number)
16631589859121817563…85142494661590135679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.326 × 10⁹⁶(97-digit number)
33263179718243635126…70284989323180271359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.652 × 10⁹⁶(97-digit number)
66526359436487270253…40569978646360542719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.330 × 10⁹⁷(98-digit number)
13305271887297454050…81139957292721085439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.661 × 10⁹⁷(98-digit number)
26610543774594908101…62279914585442170879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.322 × 10⁹⁷(98-digit number)
53221087549189816202…24559829170884341759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.064 × 10⁹⁸(99-digit number)
10644217509837963240…49119658341768683519
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,762,907 XPM·at block #6,814,852 · 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