Block #2,269,793

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2017, 4:45:27 AM · Difficulty 10.9525 · 4,567,936 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c6d7b6dce3207e46d837b69ab88caa5e95b81b0526fd0aac71174157854b4414

Height

#2,269,793

Difficulty

10.952507

Transactions

7

Size

2.24 KB

Version

2

Bits

0af3d77f

Nonce

527,968,422

Timestamp

8/27/2017, 4:45:27 AM

Confirmations

4,567,936

Merkle Root

5714713ffe26a273731ea4effdc1177fb6c04aedac60b8095ffe39e056de119e
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.668 × 10⁹²(93-digit number)
56686920425682258096…98747882136234231619
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.668 × 10⁹²(93-digit number)
56686920425682258096…98747882136234231619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.133 × 10⁹³(94-digit number)
11337384085136451619…97495764272468463239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.267 × 10⁹³(94-digit number)
22674768170272903238…94991528544936926479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.534 × 10⁹³(94-digit number)
45349536340545806477…89983057089873852959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.069 × 10⁹³(94-digit number)
90699072681091612954…79966114179747705919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.813 × 10⁹⁴(95-digit number)
18139814536218322590…59932228359495411839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.627 × 10⁹⁴(95-digit number)
36279629072436645181…19864456718990823679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.255 × 10⁹⁴(95-digit number)
72559258144873290363…39728913437981647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.451 × 10⁹⁵(96-digit number)
14511851628974658072…79457826875963294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.902 × 10⁹⁵(96-digit number)
29023703257949316145…58915653751926589439
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,946,163 XPM·at block #6,837,728 · 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