Block #277,871

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 6:08:23 PM · Difficulty 9.9675 · 6,558,723 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d92483e5b94ce4b338d1dfa5008fb5dbf5edb796a90dc7b4245f9645aabcf842

Height

#277,871

Difficulty

9.967474

Transactions

1

Size

1.11 KB

Version

2

Bits

09f7ac65

Nonce

19,517

Timestamp

11/27/2013, 6:08:23 PM

Confirmations

6,558,723

Merkle Root

830ddb41185e5c899bdbb0eac02580fc6910acbf90bbd64d8551136bbac8d34b
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.

8.502 × 10⁹⁹(100-digit number)
85020286309563982976…37280665602212634881
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
8.502 × 10⁹⁹(100-digit number)
85020286309563982976…37280665602212634881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.700 × 10¹⁰⁰(101-digit number)
17004057261912796595…74561331204425269761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.400 × 10¹⁰⁰(101-digit number)
34008114523825593190…49122662408850539521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.801 × 10¹⁰⁰(101-digit number)
68016229047651186381…98245324817701079041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.360 × 10¹⁰¹(102-digit number)
13603245809530237276…96490649635402158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.720 × 10¹⁰¹(102-digit number)
27206491619060474552…92981299270804316161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.441 × 10¹⁰¹(102-digit number)
54412983238120949105…85962598541608632321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.088 × 10¹⁰²(103-digit number)
10882596647624189821…71925197083217264641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.176 × 10¹⁰²(103-digit number)
21765193295248379642…43850394166434529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.353 × 10¹⁰²(103-digit number)
43530386590496759284…87700788332869058561
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,937,022 XPM·at block #6,836,593 · 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