Block #536,521

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 11:01:44 AM · Difficulty 10.9106 · 6,289,992 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
963ed39f19b6e11fc41a851f957f006797cf81bcf69b1dab98b8f6a58b949fd7

Height

#536,521

Difficulty

10.910572

Transactions

2

Size

578 B

Version

2

Bits

0ae91b3e

Nonce

6,817,845

Timestamp

5/11/2014, 11:01:44 AM

Confirmations

6,289,992

Merkle Root

5e9dae03e7ff10ad18bde3dfbcb2a3009cbc1a18519616eee51757adff1e1d1b
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.

1.066 × 10⁹⁹(100-digit number)
10660855403953143236…53900026944030556159
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.066 × 10⁹⁹(100-digit number)
10660855403953143236…53900026944030556159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.132 × 10⁹⁹(100-digit number)
21321710807906286472…07800053888061112319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.264 × 10⁹⁹(100-digit number)
42643421615812572945…15600107776122224639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.528 × 10⁹⁹(100-digit number)
85286843231625145890…31200215552244449279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.705 × 10¹⁰⁰(101-digit number)
17057368646325029178…62400431104488898559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.411 × 10¹⁰⁰(101-digit number)
34114737292650058356…24800862208977797119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.822 × 10¹⁰⁰(101-digit number)
68229474585300116712…49601724417955594239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.364 × 10¹⁰¹(102-digit number)
13645894917060023342…99203448835911188479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.729 × 10¹⁰¹(102-digit number)
27291789834120046684…98406897671822376959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.458 × 10¹⁰¹(102-digit number)
54583579668240093369…96813795343644753919
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,856,248 XPM·at block #6,826,512 · 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