Block #357,479

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 10:55:24 AM · Difficulty 10.3833 · 6,450,488 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c6a853a036259137282e824e7e275e874a95149c198ca2826721d0e8ba013e26

Height

#357,479

Difficulty

10.383263

Transactions

4

Size

2.52 KB

Version

2

Bits

0a621d81

Nonce

110,301

Timestamp

1/13/2014, 10:55:24 AM

Confirmations

6,450,488

Merkle Root

e8e53f576a0c9dbf457e1a0d2e4c3ad58d7906641e70665f04351d792d00d0e5
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.

1.563 × 10⁹⁹(100-digit number)
15637786259403686929…70579607537276672001
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
1.563 × 10⁹⁹(100-digit number)
15637786259403686929…70579607537276672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.127 × 10⁹⁹(100-digit number)
31275572518807373858…41159215074553344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.255 × 10⁹⁹(100-digit number)
62551145037614747716…82318430149106688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.251 × 10¹⁰⁰(101-digit number)
12510229007522949543…64636860298213376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.502 × 10¹⁰⁰(101-digit number)
25020458015045899086…29273720596426752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.004 × 10¹⁰⁰(101-digit number)
50040916030091798173…58547441192853504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.000 × 10¹⁰¹(102-digit number)
10008183206018359634…17094882385707008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.001 × 10¹⁰¹(102-digit number)
20016366412036719269…34189764771414016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.003 × 10¹⁰¹(102-digit number)
40032732824073438538…68379529542828032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.006 × 10¹⁰¹(102-digit number)
80065465648146877077…36759059085656064001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,707,779 XPM·at block #6,807,966 · 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