Block #1,070,529

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2015, 8:14:18 AM · Difficulty 10.7428 · 5,738,540 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1ece3598232c83df4fa23f02f2216651408ea4df567fdd93050a68113769017f

Height

#1,070,529

Difficulty

10.742752

Transactions

20

Size

4.25 KB

Version

2

Bits

0abe2504

Nonce

879,365,479

Timestamp

5/22/2015, 8:14:18 AM

Confirmations

5,738,540

Merkle Root

11a1f4f3215cf3dd8d5d8d82ebadadee2465565246e0880dd74925abf5d758e2
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.

9.184 × 10⁹³(94-digit number)
91847293933874216283…59381570902236419099
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
9.184 × 10⁹³(94-digit number)
91847293933874216283…59381570902236419099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.836 × 10⁹⁴(95-digit number)
18369458786774843256…18763141804472838199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.673 × 10⁹⁴(95-digit number)
36738917573549686513…37526283608945676399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.347 × 10⁹⁴(95-digit number)
73477835147099373026…75052567217891352799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.469 × 10⁹⁵(96-digit number)
14695567029419874605…50105134435782705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.939 × 10⁹⁵(96-digit number)
29391134058839749210…00210268871565411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.878 × 10⁹⁵(96-digit number)
58782268117679498421…00420537743130822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.175 × 10⁹⁶(97-digit number)
11756453623535899684…00841075486261644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.351 × 10⁹⁶(97-digit number)
23512907247071799368…01682150972523289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.702 × 10⁹⁶(97-digit number)
47025814494143598736…03364301945046579199
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,716,619 XPM·at block #6,809,068 · 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