Block #546,677

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2014, 12:23:28 AM · Difficulty 10.9564 · 6,271,295 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
439a3dcc74e91b8049f85f43c358d90c58f4373c06e4d808e03af0c3310cc669

Height

#546,677

Difficulty

10.956412

Transactions

10

Size

2.48 KB

Version

2

Bits

0af4d772

Nonce

142,054

Timestamp

5/16/2014, 12:23:28 AM

Confirmations

6,271,295

Merkle Root

6e2de169cbdf2b6125fc80404261a1351c359b8a150580ffa1dc8bc07318a541
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.

4.065 × 10¹⁰⁰(101-digit number)
40657216177641423879…20599741169275089601
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
4.065 × 10¹⁰⁰(101-digit number)
40657216177641423879…20599741169275089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.131 × 10¹⁰⁰(101-digit number)
81314432355282847758…41199482338550179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.626 × 10¹⁰¹(102-digit number)
16262886471056569551…82398964677100358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.252 × 10¹⁰¹(102-digit number)
32525772942113139103…64797929354200716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.505 × 10¹⁰¹(102-digit number)
65051545884226278206…29595858708401433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.301 × 10¹⁰²(103-digit number)
13010309176845255641…59191717416802867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.602 × 10¹⁰²(103-digit number)
26020618353690511282…18383434833605734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.204 × 10¹⁰²(103-digit number)
52041236707381022565…36766869667211468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.040 × 10¹⁰³(104-digit number)
10408247341476204513…73533739334422937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.081 × 10¹⁰³(104-digit number)
20816494682952409026…47067478668845875201
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,787,846 XPM·at block #6,817,971 · 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