Block #288,285

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 4:20:54 PM · Difficulty 9.9876 · 6,529,651 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
556dca5064402f1f3b3ce21ac12825dc8b6f5e9d587f3d4fb4baa776f64be056

Height

#288,285

Difficulty

9.987575

Transactions

6

Size

1.84 KB

Version

2

Bits

09fcd1b3

Nonce

38,523

Timestamp

12/1/2013, 4:20:54 PM

Confirmations

6,529,651

Merkle Root

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

5.456 × 10⁹³(94-digit number)
54565368267725585072…98708925595603133301
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
5.456 × 10⁹³(94-digit number)
54565368267725585072…98708925595603133301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.091 × 10⁹⁴(95-digit number)
10913073653545117014…97417851191206266601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.182 × 10⁹⁴(95-digit number)
21826147307090234028…94835702382412533201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.365 × 10⁹⁴(95-digit number)
43652294614180468057…89671404764825066401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.730 × 10⁹⁴(95-digit number)
87304589228360936115…79342809529650132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.746 × 10⁹⁵(96-digit number)
17460917845672187223…58685619059300265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.492 × 10⁹⁵(96-digit number)
34921835691344374446…17371238118600531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.984 × 10⁹⁵(96-digit number)
69843671382688748892…34742476237201062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.396 × 10⁹⁶(97-digit number)
13968734276537749778…69484952474402124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.793 × 10⁹⁶(97-digit number)
27937468553075499556…38969904948804249601
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,553 XPM·at block #6,817,935 · 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