Block #3,066,081

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/24/2019, 2:11:54 AM · Difficulty 10.9961 · 3,778,458 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
856b0e5e9a20d4c5681f354aecfdf24c1c052ae52049bf3a7500114eac2b684d

Height

#3,066,081

Difficulty

10.996052

Transactions

5

Size

2.67 KB

Version

2

Bits

0afefd41

Nonce

719,079,952

Timestamp

2/24/2019, 2:11:54 AM

Confirmations

3,778,458

Merkle Root

6289b5ad89c17c748342c7255132bc0b4c7d98ab37ded716ef90d4cbd1c3465d
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.215 × 10⁹²(93-digit number)
12153293231924660357…55643343093027143799
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.215 × 10⁹²(93-digit number)
12153293231924660357…55643343093027143799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.430 × 10⁹²(93-digit number)
24306586463849320714…11286686186054287599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.861 × 10⁹²(93-digit number)
48613172927698641428…22573372372108575199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.722 × 10⁹²(93-digit number)
97226345855397282857…45146744744217150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.944 × 10⁹³(94-digit number)
19445269171079456571…90293489488434300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.889 × 10⁹³(94-digit number)
38890538342158913143…80586978976868601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.778 × 10⁹³(94-digit number)
77781076684317826286…61173957953737203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.555 × 10⁹⁴(95-digit number)
15556215336863565257…22347915907474406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.111 × 10⁹⁴(95-digit number)
31112430673727130514…44695831814948812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.222 × 10⁹⁴(95-digit number)
62224861347454261028…89391663629897625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.244 × 10⁹⁵(96-digit number)
12444972269490852205…78783327259795251199
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:58,000,715 XPM·at block #6,844,538 · 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