Block #3,266,885

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/14/2019, 3:13:20 PM · Difficulty 10.9958 · 3,558,583 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
70924c39c6e499ffff370e4813f097d42e4b7c8cd85373418b9e40f4cdd35dfe

Height

#3,266,885

Difficulty

10.995839

Transactions

7

Size

2.31 KB

Version

2

Bits

0afeef47

Nonce

755,673,572

Timestamp

7/14/2019, 3:13:20 PM

Confirmations

3,558,583

Merkle Root

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

6.026 × 10⁹²(93-digit number)
60261267037972062172…25466530786878321519
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
6.026 × 10⁹²(93-digit number)
60261267037972062172…25466530786878321519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.205 × 10⁹³(94-digit number)
12052253407594412434…50933061573756643039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.410 × 10⁹³(94-digit number)
24104506815188824868…01866123147513286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.820 × 10⁹³(94-digit number)
48209013630377649737…03732246295026572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.641 × 10⁹³(94-digit number)
96418027260755299475…07464492590053144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.928 × 10⁹⁴(95-digit number)
19283605452151059895…14928985180106288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.856 × 10⁹⁴(95-digit number)
38567210904302119790…29857970360212577279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.713 × 10⁹⁴(95-digit number)
77134421808604239580…59715940720425154559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.542 × 10⁹⁵(96-digit number)
15426884361720847916…19431881440850309119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.085 × 10⁹⁵(96-digit number)
30853768723441695832…38863762881700618239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.170 × 10⁹⁵(96-digit number)
61707537446883391664…77727525763401236479
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,847,836 XPM·at block #6,825,467 · 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